RRAND: A New Requirement Aware RAND based Flexible Slot Allocation Mechanism Optimized For Spatial Reuse Of Slots

Schedule based MAC schemes do not perform well for dynamic network and traffic conditions. Their inflexibility makes them unsuitable for most real life applications. This inflexibility is due to the nature of schedule based approach. However, it depends mainly on the re-scheduling and slot allocation strategies employed. A flexible schedule based scheme should allow for the nodes to access the medium with different periodicity. The periodicity should be based on their traffic requirements which may result in improved channel utilization. However, traditionally used slot allocation protocols, e.g. RAND[1], do not consider the required medium access periodicity while allocating slot to the node. Thus, resulting schemes are not flexible to dynamic traffic conditions. This results in bandwidth wastage. In this paper, we propose a new flexible requirement aware RAND (RRAND) mechanism to allocate slots efficiently. Through simulations we show that our mechanism improves channel utilization on an average by about 60 %. The fairness characteristics are also improved significantly.

[1]  David A. Wagner,et al.  Secure verification of location claims , 2003, WiSe '03.

[2]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[3]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[4]  A. Farago,et al.  A performance comparison of hybrid and conventional MAC protocols for wireless networks , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[5]  Jan Vitek,et al.  Redundancy and coverage detection in sensor networks , 2006, TOSN.

[6]  Moustafa Youssef,et al.  WLAN location determination via clustering and probability distributions , 2003, Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, 2003. (PerCom 2003)..

[7]  Di Tian,et al.  A node scheduling scheme for energy conservation in large wireless sensor networks , 2003, Wirel. Commun. Mob. Comput..

[8]  Deying Li,et al.  Wireless Sensor Networks with Energy Efficient Organization , 2002, J. Interconnect. Networks.

[9]  Chenxi Zhu,et al.  A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks , 2001, Wirel. Networks.

[10]  Hongchi Shi,et al.  Coverage and energy tradeoff in density control on sensor networks , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[11]  Jie Wu,et al.  Energy-Efficient Node Scheduling Models In Sensor Networks With Adjustable Ranges , 2005, Int. J. Found. Comput. Sci..

[12]  J. J. Garcia-Luna-Aceves,et al.  A protocol for topology-dependent transmission scheduling in wireless networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[13]  Sajal K. Das,et al.  A hybrid MAC protocol for multimedia traffic in wireless networks , 2000, Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium.

[14]  S. Ramanathan,et al.  A unified framework and algorithm for (T/F/C)DMA channel assignment in wireless networks , 1997, Proceedings of INFOCOM '97.

[15]  Ming Zhang,et al.  Comparisons of channel-assignment strategies in cellular mobile telephone systems , 1989 .

[16]  Sanjay Jha,et al.  Bandwidth Aware Slot Allocation in Hybrid MAC , 2006, Proceedings. 2006 31st IEEE Conference on Local Computer Networks.

[17]  Wenhua Dou,et al.  A Coverage-Preserving Node Scheduling Algorithm for Self-organized Wireless Sensor Networks , 2004, GCC Workshops.

[18]  Moustafa Youssef,et al.  The Horus WLAN location determination system , 2005, MobiSys '05.

[19]  Manhoi Choy,et al.  Efficient fault tolerant algorithms for resource allocation in distributed systems , 1992, STOC '92.

[20]  Tristan Henderson,et al.  The changing usage of a mature campus-wide wireless network , 2004, MobiCom '04.

[21]  Richard P. Martin,et al.  The limits of localization using signal strength: a comparative study , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[22]  Tian He,et al.  Differentiated surveillance for sensor networks , 2003, SenSys '03.

[23]  Stephen S. Rappaport,et al.  Prioritized channel borrowing without locking: a channel sharing strategy for cellular communications , 1996, TNET.

[24]  Tak-Shing Peter Yum,et al.  Compact pattern based dynamic channel assignment for cellular mobile systems , 1993 .

[25]  M. M. Peritsky,et al.  Statistically-Optimum Dynamic Server Assignment in Systems with Interfering Servers , 1972, IEEE Trans. Commun..

[26]  Prashant Krishnamurthy,et al.  Modeling of indoor positioning systems based on location fingerprinting , 2004, IEEE INFOCOM 2004.

[27]  Kuo-Feng Ssu,et al.  Determining active sensor nodes for complete coverage without location information , 2005, Int. J. Ad Hoc Ubiquitous Comput..

[28]  Injong Rhee,et al.  Z-MAC: a hybrid MAC for wireless sensor networks , 2005, SenSys '05.

[29]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[30]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.