Energy analysis of distributed neighbour discovery algorithms based on frame slotted-ALOHA for cooperative networks

The design of communications protocols that exploit the availability of both cellular and short-range radio access interfaces in a same terminal can be exploited to improve the energy efficiency of wireless communications networks. Devices equipped with a cellular radio interface can act as dynamic gateways to provide energy-constrained devices in its single-hop cluster with cellular connectivity. For this purpose, any device may discover its single-hop neighbourhood in order to select the appropriate gateway candidates. Conventional neighbour discovery algorithms have a great cost in terms of delay and energy consumption, and thus they are not the optimal approach for energy-constrained devices. This paper presents the energy consumption analysis of two distributed neighbour discovery algorithms based on frame slotted-ALOHA, and evaluates their performance in terms of energy consumption. In addition, it describes the conditions that minimize the energy consumption in the discovery process.

[1]  David C. Yen,et al.  Taxonomy and survey of RFID anti-collision protocols , 2006, Comput. Commun..

[2]  Donald F. Towsley,et al.  Neighbor discovery in wireless networks and the coupon collector's problem , 2009, MobiCom '09.

[3]  Kwan-Wu Chin,et al.  On the Suitability of Framed Slotted Aloha based RFID Anti-collision Protocols for Use in RFID-Enhanced WSNs , 2007, 2007 16th International Conference on Computer Communications and Networks.

[4]  Harald Vogt,et al.  Efficient Object Identification with Passive RFID Tags , 2002, Pervasive.

[5]  M. Victoria Bueno-Delgado,et al.  Performance Evaluation of Non-persistent CSMA as Anti-collision Protocol for Active RFID Tags , 2007, WWIC.

[6]  Zhang Fan,et al.  Rapid RFID tag collision resolution with the frame slotted ALOHA protocol , 2010, 2010 International Conference on Computer Application and System Modeling (ICCASM 2010).

[7]  Frank H. P. Fitzek,et al.  Analysis of Cooperative Power Saving Strategies with NetLogo , 2007 .

[8]  Jun Luo,et al.  Compressed neighbor discovery for wireless ad hoc networks: The Rayleigh fading case , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[10]  Stefan Dulman,et al.  NetDetect: Neighborhood Discovery in Wireless Networks Using Adaptive Beacons , 2011, 2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems.