topology control protocol based on eligibility and efficiency metrics

Abstract: The question of fairness in wireless sensor networks is not studied very well. It is not unusual to observe in the literature fairness traded for low latency or reliability. However, a disproportional use of some critical nodes as relaying nodes can cause premature network fragmentation. This paper investigates fairness in multi-hop wireless sensor networks and proposes a topology control protocol that enables nodes to exhaust their energy fairly. Moreover, it demonstrates that whereas the number of neighboring nodes with which a node should cooperate depends on the density of the network, increasing this number beyond a certain amount does not contribute to network connectivity.

[1]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[2]  Matthias R. Brust,et al.  A Taxonomic Approach to Topology Control in Ad Hoc and Wireless Networks , 2007, Sixth International Conference on Networking (ICN'07).

[3]  Paolo Santi.  Topology control in wireless ad hoc and sensor networks , 2005 .

[4]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.

[6]  Lin Guan,et al.  Energy Model for H2S Monitoring Wireless Sensor Network , 2008, 2008 11th IEEE International Conference on Computational Science and Engineering.

[7]  Anantha Chandrakasan,et al.  Upper bounds on the lifetime of sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

[9]  W..  Relative Neighborhood Graphs and Their Relatives , 2004 .

[10]  Rong-Hong Jan,et al.  The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[11]  Anthony Ephremides,et al.  Energy concerns in wireless networks , 2002, IEEE Wirel. Commun..

[12]  Rami Mochaourab,et al.  A fair and energy-efficient topology control protocol for wireless sensor networks , 2008, CASEMANS '08.

[13]  Zaher Dawy,et al.  Optimal Number of Relay Nodes in Wireless Ad Hoc Networks with Non-Cooperative Accessing Schemes , 2002 .

[14]  Lin Guan,et al.  Energy Model for H 2 S Monitoring Wireless Sensor Network , 2008 .

[15]  Noel A Cressie,et al.  Statistics for Spatial Data. , 1992 .

[16]  Mauro Leoncini,et al.  The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks , 2003, MobiHoc '03.

[17]  Mike Rees,et al.  5. Statistics for Spatial Data , 1993 .

[18]  G. Shedler,et al.  Simulation of Nonhomogeneous Poisson Processes by Thinning , 1979 .

[19]  Wendi B. Heinzelman,et al.  Application-specific protocol architectures for wireless networks , 2000 .

[20]  Chung-Ming Huang,et al.  Load Sharing Topology Control Protocol for Harsh Environments in Wireless Sensor Networks , 2008, 22nd International Conference on Advanced Information Networking and Applications (aina 2008).

[21]  Roger Wattenhofer,et al.  XTC: a practical topology control algorithm for ad-hoc networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[22]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[23]  GuanLin,et al.  A topology control protocol based on eligibility and efficiency metrics , 2011 .