The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS
Transactions ID Number: 53-549
Full Name: Balamurugan Perumal
Position: Assistant Professor
Age: ON
Sex: Male
Address: Computer sceince and engineering, K.S.R. College of engineering, Tiruchengode,Namakkal,Tamilnadu
Country: INDIA
Tel: 9600761623
Tel prefix:
Fax:
E-mail address: balamurugan_tlr@yahoo.co.in
Other E-mails:
Title of the Paper: Consistent and Proficient Algorithm for Data Gathering in Wireless Sensor Networks
Authors as they appear in the Paper: P. BALAMURUGAN and Dr. K. DURAISWAMY
Email addresses of all the authors: balamurugan_tlr@yahoo.co.in, kduraiswamy@gmail.com
Number of paper pages: 10
Abstract: A wireless sensor network is usually deployed in a harsh geographical area to gather data that can be delivered to the remotely located base station. Sensor nodes have irreplaceable energy source, limited computational capability and limited memory. Therefore, it is a challenge to maximize the use of energy of these sensor nodes to extend the network lifetime. This paper proposes a Rank-Based Data Gathering Algorithm for wireless sensor networks. Sensor nodes are randomly distributed in a network field of different sizes. For every round of data communication, the algorithm steps are as follows: A set of sensor nodes or vertices are given a random rank between 0 and 1. A link is formed between any two nodes if they are within each other's transmission range. If a sensor node has the highest rank among its neighbors, then it is considered an associate node, else it falls into the leaf node. Next, the associate nodes form a complete graph among themselves and later f!
orm a Rooted Directed Tree (RDT) after an implementation of Kruskal's Minimum Spanning Tree algorithm and the Breadth First Search algorithm. Finally, a model that takes into account the energy when deciding what type of node a sensor is implemented. After recording the simulation results, it is concluded that the RBDG yields a better outcome in terms of lifetime and delay per round for TDMA than other popular data gathering algorithms.
Keywords: Rank, Data gathering, Energy awareness, Network lifetime and Delay per round, Kruskal's, Rooted Directed Tree, breadth first search
EXTENSION of the file: .pdf
Special (Invited) Session:
Organizer of the Session:
How Did you learn about congress: A Centralized Energy-Efficient Routing Protocol for Wireless Sensor Networks,Data Gathering in Sensor Networks using the Energy*Delay Metric,Wireless Sensor Networks a Networking Perspective,Data Gathering Algorithms in Sensor Networks using Energy Metrics,Design and Analysis of Low-power Access Protocols for Wireless and Mobile ATM Networks
IP ADDRESS: 124.124.52.164
