A Time-Varying Opportunistic Approach to Lifetime Maximization of Wireless Sensor Networks

被引:41
作者
Cohen, Kobi [1 ]
Leshem, Amir [1 ,2 ]
机构
[1] Bar Ilan Univ, Sch Engn, IL-52900 Ramat Gan, Israel
[2] Delft Univ Technol, Dept Elect Engn Math & Comp Sci, NL-2628 CD Delft, Netherlands
关键词
Network lifetime; opportunistic medium access control; wireless sensor networks;
D O I
10.1109/TSP.2010.2052459
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we examine the advantages of transmission scheduling by medium access control (MAC) protocols for energy- limited wireless sensor networks (WSN) as a means of maximizing network lifetime. We consider transmission scheduling for sensor networks with a mobile access point, where each sensor transmits its measurement directly to an access point through a fading channel. WSN lifetime maximization depends almost exclusively on the channel-state information (CSI) and the residual-energy information (REI) of each sensor in the network. We discuss distributed protocols which exploit local CSI and REI. We present a novel protocol for distributed transmission scheduling, dubbed the time-varying opportunistic protocol (TOP), for maximizing the network lifetime. TOP prioritizes sensors with better channels when the network is young, by exploiting local CSI to reduce transmission energy. However, TOP prefers sensors with higher residual energy when the network is old by exploiting local REI to reduce the wasted energy. We show that the relative performance loss of TOP compared to the optimal centralized protocol in terms of network lifetime decreases as the initial energy stored in the sensors increases. Furthermore, TOP significantly simplifies the implementation of carrier sensing compared to other distributed MAC protocols. We also explore the case of large-scale wireless sensor networks, where the activated sensors are picked randomly and modify the implementation of TOP for such networks. Simulation results show that TOP outperforms other distributed MAC protocols that have been proposed recently.
引用
收藏
页码:5307 / 5319
页数:13
相关论文
共 23 条
[1]   A survey on sensor networks [J].
Akyildiz, IF ;
Su, WL ;
Sankarasubramaniam, Y ;
Cayirci, E .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) :102-114
[2]   Autoregressive modeling for fading channel simulation [J].
Baddour, KE ;
Beaulieu, NC .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2005, 4 (04) :1650-1662
[3]   OPTIMAL SENSOR SCHEDULING IN NONLINEAR FILTERING OF DIFFUSION-PROCESSES [J].
BARAS, JS ;
BENSOUSSAN, A .
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 1989, 27 (04) :786-813
[4]  
Bhardwaj M, 2002, IEEE INFOCOM SER, P1587, DOI 10.1109/INFCOM.2002.1019410
[5]  
Bhardwaj M, 2001, 2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, P785, DOI 10.1109/ICC.2001.937346
[6]   Estimation of the number of operating sensors in large-scale sensor networks with mobile access [J].
Budianu, C ;
Ben-David, S ;
Tong, L .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (05) :1703-1715
[7]  
Castanon DA, 1997, IEEE DECIS CONTR P, P1202, DOI 10.1109/CDC.1997.657615
[8]   Maximum lifetime routing in wireless sensor networks [J].
Chang, JH ;
Tassiulas, L .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (04) :609-619
[9]  
CHEN Y, 2005, C INF SCI SYST J HOP
[10]   Transmission scheduling for optimizing sensor network lifetime: A Stochastic shortest path approach [J].
Chen, Yunxia ;
Zhao, Qing ;
Krishnamurthy, Vikram ;
Djonin, Dejan .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2007, 55 (05) :2294-2309