Academic
Publications
A Low-Latency Routing Protocol for Wireless Sensor Networks

A Low-Latency Routing Protocol for Wireless Sensor Networks,Antonio G. Ruzzelli,Richard Tynan,G. M. P. O'Hare

A Low-Latency Routing Protocol for Wireless Sensor Networks   (Citations: 3)
BibTex | RIS | RefWorks Download
Recent advances in Wireless Sensors Network (WSN) technology have made possible the manufacturing of tiny low-cost, low-power sensors with wireless multi-hop com- munication and sensing capabilities. Energy conservation for WSNs is a primary objective that needs to be addressed at all layers of the networking protocol stack. In many ap- plications latency is another crucial factor to be addressed. However this must be done in the context of the energy con- straints imposed by the network. In this paper we present an experimental evaluation of two node scheduling regimes within MERLIN (Mac Energy efficient, Routing and Lo- calization INtegrated), an energy-efficient low-latency in- tegrated protocol for WSNs. In particular we contrast the X and V scheduling family schemes with respect to the follow- ing properties: network setup time, network lifetime and message latency. We conduct our experiments within the OmNet++ simulator.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...As the graph colour ing is a complex problem (especially in the ad hoc network s) it is quite often left out from the study and some oth er simpler solutions are used, like to use predefined schedules that can be applied when necessary [9] [1 0]. In several applications the graph colouring problem is solved by using some heuristic method, but usually a centr alized approach is used [11] or the number of colours is predefined [12]...

    Toomas Kirt. Fast and adaptive scheduling in ad hoc networks

    • ...As described in [14], the X and V schedule tables in flgure 2 have been studied and tested...
    • ...In order to have a simultaneous scheduling adoption for the entire group of nodes involved, the migrating agent should flrstly identify the number of zones that will join the change, secondly calculate the overall time necessary so that the packet can be forwarded to all the nodes interested, through the graph provided in [14]...

    Antonio G. Ruzzelliet al. Adaptive Scheduling in Wireless Sensor Networks

Sort by: