Traffic analysis in ad hoc networks based on location-aware clustering
Li J.1; Jia W.2
Source PublicationProceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003
AbstractAdapting up-to-date positioning technology, location-aware clustering enables some attractive new applications on ad hoc networks. In this paper we propose a novel traffic analysis approach for ad hoc networks partitioned using location-aware clustering criterion. Based on the cluster model, the proposed approach is able to calculate the average traffic load for cluster heads, gateway nodes and ordinary cluster members respectively. Given anticipate input traffic input rate, the ad hoc network load can be analyzed without actually testing with clustering protocol. Our analytical results show how the two basic parameters for traffic flow between various nodes such as the intra and inter cluster average distances that affect the traffic load distribution among different types of nodes in the clustered Ad-hoc network.
KeywordAd hoc networks Computer networks Electronic mail Intelligent networks Mobile ad hoc networks Performance analysis Routing Size measurement Telecommunication traffic Traffic control
URLView the original
Fulltext Access
Citation statistics
Document TypeConference paper
CollectionUniversity of Macau
Affiliation1.Xi'an Jiaotong University
2.City University of Hong Kong
Recommended Citation
GB/T 7714
Li J.,Jia W.. Traffic analysis in ad hoc networks based on location-aware clustering[C],2003:503-506.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li J.]'s Articles
[Jia W.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li J.]'s Articles
[Jia W.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li J.]'s Articles
[Jia W.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.