Please use this identifier to cite or link to this item:
|Title:||Mobility-based d-hop clustering algorithm for mobile ad hoc networks|
Mobile ad hoc networks
|Source:||Er, I.I.,Seah, W.K.G. (2004). Mobility-based d-hop clustering algorithm for mobile ad hoc networks. 2004 IEEE Wireless Communications and Networking Conference, WCNC 2004 4 : 2359-2364. ScholarBank@NUS Repository.|
|Abstract:||This paper presents a mobility-based d-hop clustering algorithm (MobDHop), which forms variable-diameter clusters based on node mobility pattern in MANETs. We introduce a new metric to measure the variation of distance between nodes over time in order to estimate the relative mobility of two nodes. We also estimate the stability of clusters based on relative mobility of cluster members. Unlike other clustering algorithms, the diameter of clusters is not restricted to two hops. Instead, the diameter of clusters is flexible and determined by the stability of clusters. Nodes which have similar moving pattern are grouped into one cluster. The simulation results show that MobDHop has stable performance in randomly generated scenarios. It forms lesser clusters than Lowest-ID and MOBIC algorithm in the same scenario. In conclusion, MobDHop can be used to provide an underlying hierarchical routing structure to address the scalability of routing protocol in large MANETs.|
|Source Title:||2004 IEEE Wireless Communications and Networking Conference, WCNC 2004|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.