DocumentCode :
1840822
Title :
Clustering between Data Mules for Better Message Delivery
Author :
Mkhwanazi, Xoluqobo ; Le, Hanh ; Blake, Edwin
Author_Institution :
Comput. Sci. Dept., Univ. of Cape Town, Cape Town, South Africa
fYear :
2012
fDate :
26-29 March 2012
Firstpage :
209
Lastpage :
214
Abstract :
Traditionally data cannot be delivered between isolated networks. However by using a data mule which is a combination between an electronic device and a mobile entity we can connect isolated networks. However, the main problem is that a long delay is experience and most of the time a large amount of undeliverable. In this paper we propose an algorithm that increases message delivery by clustering data mules in order to find a more reliable path between the sender and the receiver. Instead of data remaining on the same mule when travelling from one network to another, our algorithm allows mules to transfer data to nearby mules arriving to the destination network sooner. Using movement traces for the data mules for rural-like areas we compared two algorithms for a different number of nodes in the network and different communication ranges for each node. The preliminary results show that our proposed algorithm increases the network performance.
Keywords :
data handling; local area networks; mobile computing; pattern clustering; data mule clustering; data transfer; destination network; electronic device; message delivery; mobile entity; mobile ubiquitous LAN extension; rural-like areas; Ad hoc networks; Algorithm design and analysis; Cities and towns; Clustering algorithms; Mobile computing; Protocols; Receivers; algorithms; data mules; isolated networks; latency; mule communication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Information Networking and Applications Workshops (WAINA), 2012 26th International Conference on
Conference_Location :
Fukuoka
Print_ISBN :
978-1-4673-0867-0
Type :
conf
DOI :
10.1109/WAINA.2012.199
Filename :
6185124
Link To Document :
بازگشت