Title :
Node Filtering and Face Routing for Sensor Network
Author :
Gewali, Laxmi P. ; Amatya, Umang
Author_Institution :
Sch. of Comput. Sci., Univ. of Nevada, Las Vegas, NV, USA
Abstract :
Greedy forward routing and face routing algorithms have been extensively used for sending messages in sensor networks. In this paper, we consider the problem of filtering redundant nodes in a sensor network as a pre-processing step for face routing. We propose an algorithm for identifying redundant nodes. We test the performance of proposed filtering algorithm on generated networks. The prototype algorithm for testing the proposed algorithms has been implemented in the Java programming language. Experimental investigation shows that the proposed filtering algorithms are effective in removing redundant nodes without compromising the network connectivity.
Keywords :
Java; graph theory; greedy algorithms; telecommunication computing; telecommunication network routing; wireless sensor networks; Java programming language; face routing algorithm; greedy forward routing algorithm; network connectivity; redundant node filtering problem; sensor network; Algorithm design and analysis; Clustering algorithms; Face; Filtering; Joining processes; Robot sensing systems; Routing; face routing; greedy forward routing; hybrid routing; redundant nodes; sensor network;
Conference_Titel :
Information Technology: New Generations (ITNG), 2013 Tenth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-0-7695-4967-5
DOI :
10.1109/ITNG.2013.106