Please use this identifier to cite or link to this item:
|Title:||Topology control for delay sensitive applications in wireless sensor networks|
|Keywords:||Delay sensitive applications|
Wireless sensor networks
|Source:||Ahdi, F.,Srinivasan, V.,Chua, K.-C. (2007-12). Topology control for delay sensitive applications in wireless sensor networks. Mobile Networks and Applications 12 (5-6) : 406-421. ScholarBank@NUS Repository. https://doi.org/10.1007/s11036-008-0049-1|
|Abstract:||Wakeup scheduling in wireless sensor networks is known as the most effective way to conserve the limited amount of available energy for each sensor node. Such schedules are applicable to protocols of different network layers and often result in higher latency. Tolerance to latency varies greatly depending on the application so that it is low for a large class of delay sensitive applications. In this paper, we present a unified approach in the design of wakeup schedules in different network layers. A new distributed wakeup schedule is introduced in the context of topology control which aims to conserve more energy while not compromising on the delay performance of the system. The proposed protocol addresses the problem of increasing the network longevity for a given upper bound on the average end-to-end delay. In this scheme neither localization nor synchronization is required and only local information about the network topology is used. In addition to its simplicity of implementation, its energy overhead is negligible and it implicitly determines the routing paths. Our simulation results show that the performance of this protocol is close to the optimal schedule and significantly higher than SPAN, an existing topology control mechanism. © 2008 Springer Science+Business Media, LLC.|
|Source Title:||Mobile Networks and Applications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 5, 2017
checked on Dec 8, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.