DocumentCode
3087375
Title
Link Activity Scheduling for Minimum End-to-End Latency in Multihop Wireless Sensor Networks
Author
Cheng, Maggie X. ; Gong, Xuan ; Xu, Yibo ; Cai, Lin
Author_Institution
Dept. of Comput. Sci., Missouri Univ. of Sci. & Technol., Rolla, MO, USA
fYear
2011
fDate
5-9 Dec. 2011
Firstpage
1
Lastpage
5
Abstract
End-to-end delay is an important QoS metric in sensor networks as well as any application that involves transferring of small-sized files. In this paper, we address how to minimize the end-to-end delay in a multihop wireless network. End-to-end delay is defined as the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the routing path and the interference level along the path. In this paper we present a transmission scheduling scheme that minimizes the end-to-end delay along a given route. The link scheduling scheme is based on integer linear programming and involves interference modeling. Using this schedule, there are no conflicting transmissions at any time. Through simulation, we show that the proposed link scheduling scheme can significantly reduce end-to- end latency regardless of the routing algorithm used.
Keywords
integer programming; interference (signal); linear programming; quality of service; scheduling; telecommunication network routing; wireless sensor networks; end-to-end latency; integer linear programming; interference level; interference modeling; link activity scheduling; multihop wireless sensor networks; quality of service; routing path; transmission scheduling; Delay; Interference; Peer to peer computing; Routing; Throughput; Wireless networks; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
Conference_Location
Houston, TX, USA
ISSN
1930-529X
Print_ISBN
978-1-4244-9266-4
Electronic_ISBN
1930-529X
Type
conf
DOI
10.1109/GLOCOM.2011.6134517
Filename
6134517
Link To Document