Abstract
The patterns of movement used by Mobile Ad-Hoc networks are application specific, in the sense that networks use nodes which travel in different paths. When these nodes are used in experiments involving social patterns, such as wildlife tracking, algorithms which detect and use these patterns can be used to improve routing efficiency. the intent of this paper is to introduce a routing algorithm which forms a series of social groups which accurately indicate a node's regular contact patterns while dynamically shifting to represent changes to the social environment. With the social groups formed, a probabilistic routing schema is used to effectively identify which social groups have consistent contact with the base station, and route accordingly. the algorithm can be implemented dynamically, in the sense that the nodes initially have no awareness of their environment and works to reduce overhead and message traffic while maintaining high delivery ratio. © 2010 IEEE.
Recommended Citation
R. Cabaniss et al., "Dynamic Social Grouping based Routing in a Mobile Ad-Hoc Network," Proceedings - IEEE International Conference on Mobile Data Management, pp. 295 - 296, article no. 5489688, Institute of Electrical and Electronics Engineers, Aug 2010.
The definitive version is available at https://doi.org/10.1109/MDM.2010.94
Department(s)
Computer Science
Keywords and Phrases
Community detection; Delay-tolerant network; Grouping; Mobile Ad-Hoc network; Routing; Social algorithm
International Standard Book Number (ISBN)
978-076954048-1
International Standard Serial Number (ISSN)
1551-6245
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
09 Aug 2010
