TY - GEN
T1 - A multi-attribute routing protocol for opportunistic network environments
AU - Yasmin, Sadaf
AU - Rais, Rao Naveed Bin
AU - Qayyum, Amir
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/9/25
Y1 - 2014/9/25
N2 - In opportunistic networks, nodes hold packets in permanent storage and make independent routing decisions on sporadically emerging links. This helps to achieve connectivity even if an end-to-end contemporaneous path does not exist between a pair of nodes. Next-hop decision is generally dependent on future probability of encounters with a destination node while other constraints on nodes' resources are ignored. We argue, in this paper that considering multiple parameters related to destination dependent and independent characteristics of a node, while determining its next-hop fitness, can help achieve better performance in resource-stringent opportunistic network environments. Our proposed routing protocol, MARS, not only gets itself cognizant of mobility patterns present within the network but also combines these mobility patterns with other stochastic information about nodes' characteristics. With the help of simulations, we show that MARS is able to achieve high delivery rates and comparable end-to-end latency with well-known routing protocols while maintaining its overhead to a significantly low limit.
AB - In opportunistic networks, nodes hold packets in permanent storage and make independent routing decisions on sporadically emerging links. This helps to achieve connectivity even if an end-to-end contemporaneous path does not exist between a pair of nodes. Next-hop decision is generally dependent on future probability of encounters with a destination node while other constraints on nodes' resources are ignored. We argue, in this paper that considering multiple parameters related to destination dependent and independent characteristics of a node, while determining its next-hop fitness, can help achieve better performance in resource-stringent opportunistic network environments. Our proposed routing protocol, MARS, not only gets itself cognizant of mobility patterns present within the network but also combines these mobility patterns with other stochastic information about nodes' characteristics. With the help of simulations, we show that MARS is able to achieve high delivery rates and comparable end-to-end latency with well-known routing protocols while maintaining its overhead to a significantly low limit.
UR - https://www.scopus.com/pages/publications/84908193703
U2 - 10.1109/ICCCN.2014.6911876
DO - 10.1109/ICCCN.2014.6911876
M3 - Conference contribution
AN - SCOPUS:84908193703
T3 - Proceedings - International Conference on Computer Communications and Networks, ICCCN
BT - 2014 23rd International Conference on Computer Communication and Networks, ICCCN Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 23rd International Conference on Computer Communication and Networks, ICCCN 2014
Y2 - 4 August 2014 through 7 August 2014
ER -