The model of energy cost in a wireless sensor network （WSN）environment is built, and the energy awareness and the wireless interference mainly due to different path loss models are studied. A special case of a clust...
详细信息
The model of energy cost in a wireless sensor network （WSN）environment is built, and the energy awareness and the wireless interference mainly due to different path loss models are studied. A special case of a clustering scheme, a twodimensional grid clustering mechanism, is adopted. Clusterheads are rotated evenly among all sensor nodes in an efficient and decentralized manner, based on the residual energy in the battery and the random backoff time. In addition to transmitting and receiving packets within the sensors＇ electrical and amplification circuits, extra energy is needed in the retransmission of packets due to packet collisions caused by severe interference. By analysis and mathematical derivation, which are based on planar geometry, it is shown that the total energy consumed in the network is directly related to the gridstructure in the proposed grid based clustering mechanism. The transmission range is determined by cluster size, and the path loss exponent is determined by nodal separation. The summation of overall interference is caused by all the sensors that are transmitting concurrently. By analysis and simulation, an optimal grid structure with the corresponding grid size is presented, which balances between maximizing energy conservation and minimizing overall interference in wireless sensor networks.
P2P流媒体cache是一种有效减少带宽开销、提高对象利用率的技术,通常采用FIFO,LRU等算法置换内容.然而,流媒体不同于Web对象,P2P网络也有别于客户/服务器模式.在分布式应用中这些算法可能影响系统的性能,为此,分析了FIFO和LRU置换算法,提出了基于供求关系的SD算法,以及基于分片副本数量的REP算法,并对其进行评估和比较.针对不同的节点到达间隔,将SD和REP同FIFO,LRU进行比较,发现在启动延迟、媒体副本数量和根节点依赖度方面SD和REP几乎均优于FIFO和LRU.同LSB(least sent bytes)算法相比,某些场景中SD的启动延迟减少了约40%,而REP在副本数量方面远远超过LSB的结果,说明在P2P网络流媒体服务中使用SD和REP缓存置换算法有助于提高系统性能.
To fulfill the requirements for hybrid real-time system scheduling, a long-release-interval-first （LRIF） real-time scheduling algorithm is proposed. The algorithm adopts both the fixed priority and the dynamic prior...
详细信息
To fulfill the requirements for hybrid real-time system scheduling, a long-release-interval-first （LRIF） real-time scheduling algorithm is proposed. The algorithm adopts both the fixed priority and the dynamic priority to assign priorities for tasks. By assigning higher priorities to the aperiodic soft real-time jobs with longer release intervals, it guarantees the executions for periodic hard real-time tasks and further probabilistically guarantees the executions for aperiodic soft real-time tasks. The schedulability test approach for the LRIF algorithm is presented. The implementation issues of the LRIF algorithm are also discussed. Simulation result shows that LRIF obtains better schedulable performance than the maximum urgency first （MUF） algorithm, the earliest deadline first （EDF） algorithm and EDF for hybrid tasks. LRIF has great capability to schedule both periodic hard real-time and aperiodic soft real-time tasks.
暂无评论