A Mobile-Sink-Based Packet Transmission Scheduling Algorithm for Dense Wireless Sensor Networks

A transmission scheduling algorithm is proposed for wireless sensor networks with high node densities, where a mobile sink is responsible for gathering the data packets from the sensor nodes with similar observations. The proposed algorithm is based on the well-known tradeoff between the energy consumption and the probability of successful packet arrival at the sink, when the sensor nodes need to share a single transmission channel at each time slot. An optimal algorithm along with two reduced-complexity algorithms are introduced, where the new data packets generated by the sensor nodes are incorporated in the model. The simulation results indicate that, when the algorithm is used for transmission scheduling, it is advantageous in terms of power consumption and successful packet transmission rate for networks with higher node densities.

[1]  Sze-Chu Liu.  A lifetime-extending deployment strategy for multi-hop wireless sensor networks , 2006, 4th Annual Communication Networks and Services Research Conference (CNSR'06).

[2]  Lang Tong,et al.  Distributed opportunistic transmission for wireless sensor networks , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[3]  Lang Tong,et al.  Sensor networks with mobile agents , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[4]  M. Haenggi.  Twelve reasons not to route over many short hops , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[5]  H. Vincent Poor,et al.  Collaborative beamforming for distributed wireless ad hoc sensor networks , 2005, IEEE Transactions on Signal Processing.

[6]  Member Ieee Liang Song,et al.  Architecture of Wireless Sensor Networks with Mobile Sinks: Multiple Access Case , 2007 .

[7]  Dimitrios Hatzinakos,et al.  Architecture of Wireless Sensor Networks With Mobile Sinks: Sparsely Deployed Sensors , 2007, IEEE Transactions on Vehicular Technology.

[8]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[9]  Sandro Zampieri,et al.  Randomized consensus algorithms over large scale networks , 2007, 2007 Information Theory and Applications Workshop.

[10]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[11]  Mani Srivastava,et al.  Overview of sensor networks , 2004 .

[12]  John G. Proakis,et al.  Digital Communications , 1983 .

[13]  Henry L. Bertoni,et al.  Radio Propagation for Modern Wireless Systems , 1999 .

[14]  P.K. Varshney,et al.  A communication architecture for reaching consensus in decision for a large network , 2005, IEEE/SP 13th Workshop on Statistical Signal Processing, 2005.

[15]  H. Vincent Poor,et al.  A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc Networks , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[16]  Qin Wang,et al.  A Realistic Power Consumption Model for Wireless Sensor Network Devices , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[17]  Deborah Estrin,et al.  Time synchronization for wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[18]  Jang-Ping Sheu,et al.  Efficient path-based multicast in wormhole-routed mesh networks , 2000, J. Syst. Archit..

[19]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .