CFP last date
22 April 2024
Reseach Article

Heuristic Approaches with Energy Management for Node Placement in Wireless Sensor Networks

by Sasikumar P, Shriram K Vasudevan, Ramesh M,
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 3
Year of Publication: 2010
Authors: Sasikumar P, Shriram K Vasudevan, Ramesh M,
10.5120/80-175

Sasikumar P, Shriram K Vasudevan, Ramesh M, . Heuristic Approaches with Energy Management for Node Placement in Wireless Sensor Networks. International Journal of Computer Applications. 1, 3 ( February 2010), 69-73. DOI=10.5120/80-175

@article{ 10.5120/80-175,
author = { Sasikumar P, Shriram K Vasudevan, Ramesh M, },
title = { Heuristic Approaches with Energy Management for Node Placement in Wireless Sensor Networks },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 3 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 69-73 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number3/80-175/ },
doi = { 10.5120/80-175 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:44:00.212887+05:30
%A Sasikumar P
%A Shriram K Vasudevan
%A Ramesh M,
%T Heuristic Approaches with Energy Management for Node Placement in Wireless Sensor Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 3
%P 69-73
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In Wireless Sensor Network, Device placement is a key factor for determining the coverage, connectivity, and cost along with lifetime. Managing the sensor nodes is not much easier while comparing mobile Ad ¬ Hoc Networks. But the same approach can be implemented to manage the WSN. Addressing the management of the whole network is omitted and a probabilistic scheme where only a subset of nodes is managed is provided for light ¬ weight and efficient management. Relay node placement in heterogeneous WSN are formulated using a generalized node placement optimization problem to minimize the network cost with lifetime constraint, and connectivity. Based on the constraints two scenarios are used. In the first scenario relay nodes are not energy constrained, and in the second scenario all nodes are energy limited. As an optimal solution a two-phase approach is proposed. The placement of the first phase relay nodes (FPRN), which are directly connected to Sensor Nodes (SN), is modeled as a minimum set covering problem. To ensure the relaying of the traffic from the FPRN to the base station, three heuristic schemes are proposed to place the second phase relay nodes (SPRN). Some of the heuristic approaches available are Nearest¬ to ¬ BS¬ First algorithm (NTBF), Max¬ Residual¬ Capacity¬ First algorithm (MRCF) and Best¬ Effort¬ Relaying algorithm (BER). Our contribution is centered on a distributed self organizing management algorithm at the application layer by organizing the management plane by extracting spatiotemporal components and by selecting manager nodes with several election mechanisms applied to wireless sensor nodes. Furthermore, a lower bound on the minimum number of SPRN required for connectivity is provided.

References
  1. H. Abelson et al., Mar. 2000, “Amorphous Computing,” CACM, vol. 43, no. 5, pp. 74–82.
  2. Y. T. Hou, Y. Shi, H. D. Sherali, and S. F. Midkiff, Sep. 2005,“On energy provisioning and relay node placement for wireless sensor networks,” IEEE Trans. Wireless Commun., vol. 4, no. 5, pp. 2579–2590.
  3. S. S. Pradhan, J.Kusuma, and K. Ramchandran, Mar. 2002, “Distributed compression in a dense sensor network,” IEEE Signal Process. Mag., vol. 19,no. 2, pp. 51–60.
  4. A. Sayeed, D. Estrin, G. Pottie, and K. Ramchandran, Guest Editors, IEEE Journal on Selected Areas in Communications—Special Issue on Self organizing Distributed Collaborative Sensor Networks, to be published
  5. Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low¬Rate Wireless Personal Area Networks (LRWPANs) ,2003, IEEE Std. 802.15.4.
  6. J. Pan, Y. T. Hou, L. Cai, Y. Shi, and S. X. Shen, Sep. 2003, “Topology control for wireless sensor networks,” in Proc. ACM MOBICOM, pp.286–299.
  7. W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energyefficient communication protocols for wireless microsensor networks,” in Proc. 33rd Hawaii Int. Conf. Syst. Sciences, Jan. 2000, vol.8,pp.8020–8029.
  8. D. Bertsekas and R. Gallager, Data Networks,1992, 2nd ed. Upper Saddle River, NJ:Prentice Hall.
  9. C. V. Ramamoorthy and B. W. Wah, Mar.1983, “The isomorphism of simple file allocation,” IEEE Trans.Comput., vol. 32, no. 3, pp. 221–231.
  10. G. C. Armour and E. S. Buffa. Jan 963, “A heuristic algorithm and simulation approach to relative location in facilities,” Manag. Sci., vol. 9, no. 1, pp. 294– 309,.
  11. A. S. Manne, Nov. 1964, “Plant location under economies of scale decentralization and computation,” Manag. Sci., vol. 11, pp. 213–235.
  12. M. Patel, R. Chandrasekaran, and S. Venkatesan, Apr. 2005, “Energy efficient sensor, relay and base station placements for coverage, connectivity and routing,” in Proc. IEEE IPCCC, pp. 581–586.
  13. Remi Badonnel, Radu State, Olivier Festor, , JUNE 2007, A Probabilistic Approach for Managing Mobile Ad-Hoc Networks, IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 4,NO. 1.
  14. L. Buttyan and J. P. Hubaux, Oct. 2003, “Stimulating Cooperation in Self¬Organizing Mobile Ad Hoc Networks,” ACM/Kluwer Mobile Networks and Applications, vol. 8, no. 5.
  15. Q. Wang, K. Xu, G. Takahara, and H. Hassanein, Nov.–Dec. 2005, “Locally optimal relay node placement in heterogeneous wireless sensor networks,” in Proc.IEEE GLOBECOM, vol. 6, pp. 3549–3553.
Index Terms

Computer Science
Information Sciences

Keywords

Device placement facility location problem lifetime minimum set covering wireless sensor networks Network management probabilistic analysis