DocumentCode
2307793
Title
Almost Delaunay triangulation routing in wireless sensor networks
Author
Haider, M.B. ; Sugihara, Kokichi
Author_Institution
Dept. of Math. Inf., Tokyo Univ., Tokyo
fYear
2007
fDate
27-29 Dec. 2007
Firstpage
1
Lastpage
7
Abstract
To obtain a satisfactory performance in the wireless sensor network, optimal routing is the most important aspect. The lifetime of the sensor network depends mostly on the routing topology. In order to route the data in an efficient way, we propose an almost Delaunay triangulation routing approach, which could be generated locally. This routing graph is generated only once and can be used during the whole lifetime of the wireless sensor network.
Keywords
graph theory; mesh generation; telecommunication network routing; telecommunication network topology; wireless sensor networks; Delaunay triangulation routing; routing graph; routing topology; wireless sensor networks; Ad hoc networks; Batteries; Costs; Data compression; Energy consumption; Informatics; Network topology; Routing; Sensor phenomena and characterization; Wireless sensor networks; Delaunay triangulation; Voronoi diagram; Wireless sensor network; cluster head; sensor node;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and information technology, 2007. iccit 2007. 10th international conference on
Conference_Location
Dhaka
Print_ISBN
978-1-4244-1550-2
Electronic_ISBN
978-1-4244-1551-9
Type
conf
DOI
10.1109/ICCITECHN.2007.4579451
Filename
4579451
Link To Document