Similar articles

Abstract: Media streaming delivery in wireless ad hoc networks is challenging due to the stringent resource restrictions, potential high loss rate and the decentralized architecture. To support long and high-quality streams, one viable approach is that a media stream is partitioned into segments, and then the segments are replicated in a network and served in a peer-to-peer (P2P) fashion. However, the searching strategy for segments is one key problem with the approach. This paper proposes a hybrid ants-like search algorithm (HASA) for P2P media streaming distribution in ad hoc networks. It takes the advantages of random walks and ants-like algorithms for searching in unstructured P2P networks, such as low transmitting latency, less jitter times, and low unnecessary traffic. We quantify the performance of our scheme in terms of response time, jitter times, and network messages for media streaming distribution. Simulation results showed that it can effectively improve the search efficiency for P2P media streaming distribution in ad hoc networks.

[1] Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A., 2001. Search in power-law networks. Phys. Rev. E, 64(4):046135.

[2] Bonabeau, E., Dorigo, M., Theraulaz, G., 2000. Inspiration for optimization from social insect behavior. Nature, 406:39-42.

[3] Ghandeharizadeh, S., Krishnamachari, B., Song, S.S., 2004. Placement of continuous media in wireless peer-to-peer networks. IEEE Trans. on Multimedia, 6(2):335-342.

[4] Gkantsidis, C., Mihail, M., Saberi, A., 2005. Hybrid Search Schemes for Unstructured Peer-to-Peer Networks. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 3:1526-1537.

[5] Hussein, O., Saadawi, T., 2003. Ant Routing Algorithm for Mobile Ad-Hoc Networks (ARAMA). Proc. 2003 IEEE Int. Conf. on Performance, Computing, and Communications, p.281-290.

[6] Jiang, S., Guo, L., Zhang, X., 2003. LightFlood: An Efficient Flooding Scheme for File Search in Unstructured Peer-to-Peer Systems. Proc. 2003 Int. Conf. on Parallel Processing, p.627-635.

[7] Jiang, H., Jin, S., 2005. Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks. Proc. 13th IEEE Int. Conf. on Network Protocols, p.122-131.

[8] Jin, S., 2004. Replication of Partitioned Media Streams in Wireless Ad Hoc Networks. Proc. 12th Annual ACM Int. Conf. on Multimedia. New York, USA, p.396-399.

[9] Kleinberg, J., 2000. The Small-World Phenomenon: An Algorithm Perspective. Proc. ACM Symposium on Theory of Computing, p.163-170.

[10] Lü, Q., Cao, P., Cohen, E., Li, K., Shenker, S., 2002. Search and Replication in Unstructured Peer-to-Peer Networks. Proc. 16th ACM Intl. Conf. Supercomputing, p.84-95.

[11] Michlmayr, E., 2006. Ant Algorithms for Search in Unstructured Peer-to-Peer Networks. Proc. 22nd Int. Conf. on Data Engineering Workshops, p.x142-x142.

[12] Xue, G., Jia, Z., You, J., Li, M., 2004. Group Mobility Model in Mobile Peer-to-Peer Media Streaming System. Proc. IEEE Int. Conf. on Services Computing, p.527-530.

[13] Yang, B., Garcia-Molina, H., 2002. Improving Search in Peer-to-Peer Networks. Proc. 22nd Int. Conf. on Distributed Computing Systems, p.5-14.

[14] Zhuang, Z., Liu, Y., Xiao, L., Ni, L.M., 2003. Hybrid Periodical Flooding in Unstructured Peer to Peer Networks. Proc. Int. Conf. on Parallel Processing, p.171-178.