The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper addresses an energy-efficiency (EE) maximized resource allocation (RA) problem for cooperative orthogonal frequency division modulation (OFDM) transmission, when the system's total power consumption (including the circuit power and transmission power) is limited below a peak value. The improved DF relaying protocol proposed in [1] is used with optimized subcarrier pairing. The EE is evaluated...
In this work we present a protocol for self-synchronized duty-cycling in wireless sensor networks with energy harvesting capabilities. The protocol is implemented in Wiselib, a library of generic algorithms for sensor networks. Simulations are conducted with the sensor network simulator Shawn. They are based on the specifications of real hardware known as iSense sensor nodes. The experimental results...
Aiming at the coverage problem, a new coverage algorithm is proposed based on residual energy of sensors in this paper. In the algorithm, it is unnecessary for sensors to know its geographic information. By exchanging some related information with its neighbors, sensors judge its suitable status (active or sleep) according to energy. The algorithm can save sensor energy and extend the time of sensor...
The construction and the deployment of the service bearer network contain multiple network nodes. So it needs to do a unified operation. In the deployment processing, the whole service instance will fail if one operation fails. So it is a distributed transaction with ACID properties. This paper has done some research on the distributed transaction in a service bearer network. In addition to the basic...
Due to energy constraints and limited lifetime, sensor nodes are usually deployed densely in the target fields. Moreover, some applications do not require 100% coverage all the time. In view of these two concepts we may turn off some of the sensor nodes exploiting the redundancy of deployed sensor nodes. On the other side, the underlying communication logical topology is an important issue regarding...
Nowadays, most enterprises use Web services as a framework for facilitating application-to-application interaction within and across them. Describing behaviour of Web services is becoming more and more important. This behaviour can be described by timed business protocols representing the possible sequences of message exchanges. Studying the behaviour of Web services by analyzing their timed business...
The existence of predicate and conditional statements of the protocol transition specified in EFSM model results in the generation of infeasible State Identification Sequence using traditional methods. Thus, how to automatically generate executable State Identification Sequences, in an efficient and effective way, becomes the critical issue for protocol conformance testing. In this paper, we present...
WiMedia ultra wideband (UWB) MAC consists of distributed reservation protocol (DRP) and prioritized contention access (PCA), where DRP is used to reserve the medium for time division multiple access for isochronous and other traffic. This paper proposes an improved service interval-based medium access slot (MAS) allocation (ISIMA) algorithm for MAS allocation to support the quality of service (QoS)...
Slot reservation selection algorithm is a key problem of the VHF data link communication which is based on self-organized TDMA (STDMA) protocol. In this paper, the performance of the algorithm was analyzed with probability analysis method. By analyzing, the effect of the number of slots in a frame, report rate of a station and adjustment factor of candidate slot window on the slot collision probability...
An algorithm is given for the multi-writer version of the Concurrent Reading While Writing (CRWW) problem. The algorithm solves the problem of allowing simultaneous access to arbitrarily sized shared data without requiring waiting, and hence avoids mutual exclusion. This. demonstrates that a quite complicated concurrent control problem can be solved-without eliminating the efficiency of parallelism...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.