Designing a Path Management Method in Large-scale Multiple Sensor Networks


The KIPS Transactions:PartC, Vol. 15, No. 3, pp. 205-212, Jun. 2008
10.3745/KIPSTC.2008.15.3.205,   PDF Download:

Abstract

In the environment with multiple heterogeneous wireless sensor networks with a single point of sensed data collection or a gateway (GW), relay points (RPs) may be required for the energy efficient delivery of sensed data from static or mobile sinks to the GW. The optimal placement of RPs becomes an even more difficult problem if static sinks are dynamically added or the trajectory of mobile sinks can not be known in advance. In order to resolve this problem, we propose a mechanism to deploy RPs in a grid pattern and to use the tree-based relaying network for reducing the cost of the RP and for reducing the control overhead incurred by the route setup from sinks to the GW. For the performance evaluation of our proposed mechanism, we have carried out a numerical analysis on a single route setup from a sink to the GW and, for more general performance evaluations, ns-2 based simulations have been carried out. According to the performance evaluation results, our tree-based relaying network mechanism outperforms that based on AODV in terms of the data delivery time, the network service time and the control overhead.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. J. Lim, J. S. Park, S. H. Ahn, "Designing a Path Management Method in Large-scale Multiple Sensor Networks," The KIPS Transactions:PartC, vol. 15, no. 3, pp. 205-212, 2008. DOI: 10.3745/KIPSTC.2008.15.3.205.

[ACM Style]
Yu Jin Lim, Jae Sung Park, and Sang Hyun Ahn. 2008. Designing a Path Management Method in Large-scale Multiple Sensor Networks. The KIPS Transactions:PartC, 15, 3, (2008), 205-212. DOI: 10.3745/KIPSTC.2008.15.3.205.