Abstract
Devices in a mobile ad-hoc environment can follow different movement patterns based on the application environment. Some environments, such as mass transit systems, follow regular and predictable patterns. Others, such as an aerial monitoring network, generally follow random paths. Optimal routing schemes tend to take advantage of information regarding movement patterns available in social interaction domains. in a social environment like wildlife tracking or monitoring socio-human interactions, the devices and/or users will follow regular contact habits, tending to encounter social groups in which they participate. in this paper, by dynamically identifying these groups, the patterns are used to speed routing through a social environment. When social groups are formed, a probability-based scheme is used to route messages to devices efficiently. This algorithm can be implemented ad null, meaning the devices have no information of their environment, and works to reduce overhead, message traffic, and delivery time while maintaining a high delivery ratio. © 2011 IEEE.
Recommended Citation
R. Cabaniss et al., "DSG-N²: A Group-Based Social Routing Algorithm," 2011 IEEE Wireless Communications and Networking Conference, WCNC 2011, pp. 504 - 509, article no. 5779184, Institute of Electrical and Electronics Engineers, Jun 2011.
The definitive version is available at https://doi.org/10.1109/WCNC.2011.5779184
Department(s)
Computer Science
Keywords and Phrases
Grouping; Mobile Ad-Hoc Network; Node-to-Node Delay-Tolerant Network Routing; Social Algorithm
International Standard Book Number (ISBN)
978-161284254-7
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
23 Jun 2011
