A Hybrid Approach to Optimize Node Placements in Hierarchical Heterogeneous Networks

In this paper, we address the problem of node placement in a hierarchical heterogeneous wireless sensor network. We consider a two-tiered wireless sensor network where the resource constrained lite nodes (LNs) are used for sensing the environment and high-end sophisticated nodes (SNs) are added to aggregate and forward data. We intend to place minimum number of SNs to handle the traffic generated by LNs and ensure that the SNs form a connected network. We formulate the node placement problem as an optimization problem and use three different algorithms to solve it; namely, binary integer linear programming (BILP), greedy algorithm (GREEDY) and genetic algorithm (GA). We also propose a hybrid approach (HYBRID) combining BILP, GREEDY and GA to improve results. It was found through simulations that GA performed better for random LN deployment. However, using HYBRID, results comparable to original GA could be obtained in only 11.46 % of the time required for the original GA. We support the results with statistical tests.

[1]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

[2]  S. Venkatesan,et al.  Energy efficient sensor, relay and base station placements for coverage, connectivity and routing , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[3]  F. Ramsey,et al.  The Statistical Sleuth , 1996 .

[4]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  Hossam S. Hassanein,et al.  Optimal wireless sensor networks (WSNs) deployment: minimum cost with lifetime constraint , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[7]  Erik D. Demaine,et al.  Deploying sensor networks with guaranteed capacity and fault tolerance , 2005, MobiHoc '05.

[8]  Jukka Suomela.  Computational Complexity of Relay Placement in Sensor Networks , 2006, SOFSEM.

[9]  Mohamed F. Younis,et al.  A survey on routing protocols for wireless sensor networks , 2005, Ad Hoc Networks.

[10]  Erkki Laitinen,et al.  Radio coverage optimization with genetic algorithms , 1998, Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (Cat. No.98TH8361).

[11]  Arunabha Sen,et al.  Relay node placement in large scale wireless sensor networks , 2006, Comput. Commun..

[12]  Y.T. Hou,et al.  On energy provisioning and relay node placement for wireless sensor networks , 2005, IEEE Transactions on Wireless Communications.

[13]  Hai Liu,et al.  On optimal placement of relay nodes for reliable connectivity in wireless sensor networks , 2006, J. Comb. Optim..

[14]  J. Ledolter.  The Statistical Sleuth , 2003 .

[15]  Chris Savarese.  LOCATIONING IN DISTRIBUTED AD-HOC WIRELESS SENSOR NETWORKS , 2001 .

[16]  Jan M. Rabaey,et al.  Location in distributed ad-hoc wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[17]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Christopher R. Houck,et al.  A Genetic Algorithm for Function Optimization: A Matlab Implementation , 2001 .