ACM Home Page
Please provide us with feedback. Feedback
An efficient node selection metric for in-network process deployment
Full text PdfPdf (711 KB)
Source ACM International Conference Proceeding Series archive
Proceedings of the 4th Annual International Conference on Wireless Internet table of contents
Maui, Hawaii
SESSION: Mobile ad hoc networks I table of contents
Article No. 4  
Year of Publication: 2008
ISBN:978-963-9799-36-3
Authors
Kenji Tei  Waseda University, Shinjuku-ku, Tokyo, Japan
Yoshiaki Fukazawa  Waseda University, Shinjuku-ku, Tokyo, Japan
Shinichi Honiden  National Institute of Informatics, Chiyoda-ku, Tokyo, Japan
Sponsors
: ICST
: Intel
: XIRRUS
Publisher
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 14,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

In-network processing is a powerful technique for reducing network traffic in an ad hoc network where network efficiency is a critical issue. When an in-network process collects data from multiple data sources, the node hosting the in-network process should be carefully selected to reduce network traffic. Existing metrics used to select the host node are unsatisfactory in this case, because they do not consider differences in the amount of data provided by each data source. In this paper, we propose a node selection metric called COLOR to solve this problem. COLOR value is derived from locations of data sources and the amount of data provided by them so that a data source that provides more data than the others has a stronger effect. Moreover, the communication overheads associated with COLOR are small, because parameters involved by COLOR can be collected during a data retrieval phase, which generally occurs in in-network processing. Simulation results show that data retrieval using COLOR produces less network traffic than that retrieved using existing metrics in environments where placements of data sources and the amount of data are nonuniform.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
A. D. Amis and et al. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 32--41, 2000.
 
3
4
 
5
T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad-hoc network research. Wireless Communications and Mobile Computing, 2(5):483--502, 2002.
 
6
 
7
 
8
 
9
W.-H. Liao and et al. Grid: A fully location-aware routing protocol for mobile ad hoc networks. Telecommunication Systems, 18(1--3):37--60, 2001.
10
 
11
K. Tei and et al. Using mobile agent for location-specific data retrieval in manet. In Proceedings of the 2005 IFIP International Conference on Intelligence in Communication Systems (INTELLCOMM), pages 157--168, 2005.
 
12
K. Tei and et al. Adaptive geographically bound mobile agents. In Proceedings of the 2nd International Conference on Mobile Ad-hoc and Sensor Networks (MSN), pages 353--364, 2006.
 
13
R. Virrankoski and A. Savvides. Tasc: Topology adaptive spatial clustering for sensor networks. In Proceedings of the 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), pages 10--18, 2005.
 
14

Collaborative Colleagues:
Kenji Tei: colleagues
Yoshiaki Fukazawa: colleagues
Shinichi Honiden: colleagues