ABSTRACT
Message ferries support delay-tolerant networking in scenarios where nodes are too far from each other to communicate directly. We study scenarios where a data ferry moves between a fixed set of stationary nodes not connected otherwise. Thus, ferrying is assumed to be the only means of communication in the network. In order to minimize the average message delivery time, the ferry dynamically decides on the next node to visit. For this, we assume local knowledge only, i.e. the decision made by the ferry is solely based on locally derived information.
Our studies are based on an abstract state transition model for the system. Based on this model we analyze the performance of different algorithms. This includes a static planning algorithm selecting the shortest Euler tour (TSP) and our dynamic decision algorithm (SOFCOM) based on local knowledge. In order to study the performance of both algorithms, we compare these with results derived by an idealized nondeterministic algorithm (oracle) assuming global as well as future knowledge on the generated messages. Our studies are based on symmetric as well as asymmetric traffic with exponential message arrivals. We show that our SOFCOM algorithm typically outperforms the TSP algorithm and that it achieves results close to the oracle solution. Especially important, our studies show that the benefits of global knowledge of the system state are rather small, and that local knowledge is sufficient to achieve very good results.
- Bauckhage, C., Kersting, K., and Rastegarpanah, B. The weibull as a model of shortest path distributions in random networks. In Proc. Int. Workshop on Mining and Learning with Graphs, Chicago, IL, USA (2013).Google Scholar
- Bin Tariq, M. M., Ammar, M., and Zegura, E. Message ferry route design for sparse ad hoc networks with mobile nodes. In Proceedings of the 7th ACM international symposium on mobile ad hoc networking and computing (New York, NY, USA, 2006), MobiHoc '06, ACM, pp. 37--48. Google ScholarDigital Library
- Chuah, M.-C., and Yang, P. A message ferrying scheme with differentiated services. In Military Communications Conference, 2005. MILCOM 2005. IEEE (2005), pp. 1521--1527 Vol. 3.Google ScholarCross Ref
- Gu, Y., Bozdag, D., Ekici, E., Ozguner, F., and Lee, C.-G. Partitioning based mobile element scheduling in wireless sensor networks. In Proceedings of the Second Annual IEEE Conference on Sensor and ad hoc Communications and Networks (2005), pp. 386--395.Google Scholar
- Mansy, A., Ammar, M. H., and Zegura, E. W. Deficit round-robin based message ferry routing. In GLOBECOM (2011), IEEE, pp. 1--5.Google ScholarCross Ref
- Simon, T., and Mitschele-Thiel, A. A self-organized message ferrying algorithm. In Proceedings of the 14th IEEE World of Wireless, Mobile and Multimedia Networks (WoWMoM), Workshop on Autonomic and Opportunistic Communications (AOC) (2013), pp. 1--6.Google ScholarCross Ref
- Somasundara, A. A., Ramamoorthy, A., and Srivastava, M. B. Mobile element scheduling for efficient data collection in wireless sensor networks with dynamic deadlines. In IEEE RTSS (2004), pp. 296--305. Google ScholarDigital Library
- Somasundara, A. A., Ramamoorthy, A., and Srivastava, M. B. Mobile element scheduling with dynamic deadlines. IEEE Transactions on Mobile Computing 6, 4 (2007), 395--410. Google ScholarDigital Library
- Sugihara, R., and Gupta, R. K. Path planning of data mules in sensor networks. ACM Transactions on Sensor Networks (TOSN) 8, 1 (2011). Google ScholarDigital Library
- Wang, T., and Low, C. P. The general message ferry route (mfr*) problem and the an-improved-route (air) scheme. Comput. Netw. 56, 4 (Mar. 2012), 1442--1457. Google ScholarDigital Library
- Zhao, W., Ammar, M., and Zegura, E. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (New York, NY, USA, 2004), MobiHoc, ACM, pp. 187--198. Google ScholarDigital Library
Index Terms
Next-Hop Decision-Making in Mobility-Controlled Message Ferrying Networks
Recommendations
Trading latency for energy in densely deployed wireless ad hoc networks using message ferrying
Wireless mobile ad hoc networks (MANETs) have the potential for use in important application environments, such as remote environmental monitoring, where energy resources are limited. Efficient power management is necessary to allow these networks to ...
Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks
FTDCS '03: Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing SystemsAn ad hoc network allows devices with wireless interfaces to communicate with each other without any preinstalled infrastructure. Due to node mobility, limited radio power, node failure and wide deployment area, ad hoc networks are often vulnerable to ...
A Power-Aware Multicast Routing Protocol forMobile Ad Hoc Networks with Mobility Prediction
LCN '05: Proceedings of the The IEEE Conference on Local Computer Networks 30th AnniversaryA mobile ad hoc network (MANET) is a dynamically reconfigurable wireless network that does not have a fixed infrastructure. Due to the high mobility of nodes, the network topology of MANETs changes very fast, making it more difficult to find the routes ...
Comments