DocumentCode
2760367
Title
Enhanced Routing in Heterogeneous Sensor Networks
Author
Gagneja, Kanwalinderjit Kaur ; Du, Xiaojiang ; Nygard, Kendall
Author_Institution
Dept. of Comput. Sci., NDSU, Fargo, ND, USA
fYear
2009
fDate
15-20 Nov. 2009
Firstpage
569
Lastpage
574
Abstract
The research is centered on sensor networks with two types of nodes. The low end nodes are simple and low cost, while the high end nodes are costly but provide significantly more processing power. In this type of sensor networks, the low end nodes are clustered and report to a high end node, which is turn uses a network backbone to send data to a base station. In this research we have configured a new data routing procedure potentially improves the energy efficiency of the network by reducing the number of hops utilized to reach to the Base Station. We gain robustness and energy efficiency by reducing the vulnerability points in the network by employing alternatives to Shortest Path Tree routing. The new data routing procedure is compared with the Directed Diffusion algorithm.
Keywords
telecommunication network routing; trees (mathematics); wireless sensor networks; base station; data routing; directed diffusion algorithm; heterogeneous sensor networks; network backbone; shortest path tree routing; vulnerability points; Base stations; Batteries; Computer networks; Computer science; Condition monitoring; Electronic mail; Energy efficiency; Network topology; Routing; Wireless sensor networks; Base station; Heterogeneous sensor networks; Hierarchical routing; Security.;
fLanguage
English
Publisher
ieee
Conference_Titel
Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2009. COMPUTATIONWORLD '09. Computation World:
Conference_Location
Athens
Print_ISBN
978-1-4244-5166-1
Electronic_ISBN
978-0-7695-3862-4
Type
conf
DOI
10.1109/ComputationWorld.2009.43
Filename
5359654
Link To Document