NDLI: Approximation algorithm for minimizing relay node placement in wireless sensor networks

Content Provider	Springer Nature Link
Author	Lu, KeZhong Chen, GuoLiang Feng, YuHong Liu, Gang Mao, Rui
Copyright Year	2010
Abstract	To eliminate the routing load unbalance among sensor nodes, one approach is to deploy a small number of powerful relay nodes acting as routing nodes in wireless sensor networks, the major optimization objective of which is to minimize the number of relay nodes required. In this paper, we prove that the relay node placement problem in a bounded plane is a P problem, but its computational complexity in general case is quite great. From the geometric cover feature of the relay node placement problem, an O(n $^{2}$ log n) time greedy approximation algorithm is proposed, where n is the number of sensor nodes. Particularly, at each stage of this algorithm’s iterative process, we first select a critical node from uncovered sensor nodes, and then determine the location of relay node based on the principle of preferring to cover the sensor node closer to the critical node, so as to prevent the emergence of isolated node. Experiment results indicate that our proposed algorithm can generate a near optimum feasible relay node deployment in a very short time, and it outperforms existing algorithms in terms of both the size of relay node deployment and the execution time.
Starting Page	2332
Ending Page	2342
Page Count	11
File Format	PDF
ISSN	1674733X
Journal	Science in China Series : Information Sciences
Volume Number	53
Issue Number	11
e-ISSN	18691919
Language	English
Publisher	SP Science China Press
Publisher Date	2010-10-22
Publisher Place	Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	wireless sensor network relay node placement geometrical cover approximation algorithm greedy algorithm Information Systems and Communication Service
Content Type	Text
Resource Type	Article
Subject	Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Connectivity-Aware Approximation Algorithm for Relay Node Placement in Wireless Sensor Networks

Weighted relay node placement for wireless sensor network connectivity

Approximation Algorithms for Constrained Relay Node Placement in Energy Harvesting Wireless Sensor Networks

PSH: A Pruning and Substitution Based Heuristic Algorithm for Relay Node Placement in Two-Tiered Wireless Sensor Networks

Relay Node Placement in Wireless Sensor Networks

Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks

EQAR: Effective QoS-Aware Relay Node Placement Algorithm for Connecting Disjoint Wireless Sensor Subnetworks

Set Covering-based Approximation Algorithm for Delay Constrained Relay Node Placement in Wireless Sensor Networks

Opportunistic Routing Algorithm for Relay Node Selection in Wireless Sensor Networks

Approximation algorithm for minimizing relay node placement in wireless sensor networks

Similar Documents

A Connectivity-Aware Approximation Algorithm for Relay Node Placement in Wireless Sensor Networks

Weighted relay node placement for wireless sensor network connectivity

Approximation Algorithms for Constrained Relay Node Placement in Energy Harvesting Wireless Sensor Networks

PSH: A Pruning and Substitution Based Heuristic Algorithm for Relay Node Placement in Two-Tiered Wireless Sensor Networks

Relay Node Placement in Wireless Sensor Networks

Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks

EQAR: Effective QoS-Aware Relay Node Placement Algorithm for Connecting Disjoint Wireless Sensor Subnetworks

Set Covering-based Approximation Algorithm for Delay Constrained Relay Node Placement in Wireless Sensor Networks

Opportunistic Routing Algorithm for Relay Node Selection in Wireless Sensor Networks

Approximation algorithm for minimizing relay node placement in wireless sensor networks