Relay node placement algorithm in wireless sensor network

Author

Nitesh, Kumar ; Jana, Prasanta K.

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Sch. of Mines, Dhanbad, India

fYear

2014

fDate

21-22 Feb. 2014

Firstpage

220

Lastpage

225

Abstract

In a two-tier wireless sensor network (WSN), the relay nodes act as the cluster heads for data aggregation and dissemination to the base station. It is very crucial and difficult to find the proper position where the relay nodes can be placed so that the WSN is fully covered and connected. In this paper, we propose an algorithm for placing minimum number of relay nodes with full coverage and connectivity of the WSN with the constraint of minimizing the overall communication cost. The algorithm is based on spiral sequence generated for arbitrarily deployed sensor nodes. The simulation results demonstrate the effectiveness of the algorithm.

Keywords

greedy algorithms; sensor placement; wireless sensor networks; WSN; arbitrarily deployed sensor nodes; base station; cluster heads; communication cost minimization; data aggregation; data dissemination; relay node placement algorithm; spiral sequence; two-tier wireless sensor network; Base stations; Clustering algorithms; Conferences; Relays; Simulation; Spirals; Wireless sensor networks; Relay node placement; Sensor sequence; Wireless sensor network;

fLanguage

English

Publisher

ieee

Conference_Titel

Advance Computing Conference (IACC), 2014 IEEE International

Conference_Location

Gurgaon

Print_ISBN

978-1-4799-2571-1

Type

conf

DOI

10.1109/IAdCC.2014.6779324

Filename

6779324