Marketplaces as Communication Patterns in Mobile Ad-Hoc Networks

This paper proposes a novel communication pattern for mobile multihop ad-hoc networks which is based on a marketplace metaphor. In order to substantially increase the probability that negotiating peers sucessfully reach an agreement, communication is focused on a static geographic area, called the marketplace. Users are not constrained to be at the marketplace physically, but are allowed to utilize other ones mobile devices located at the marketplace to let a software agent or a service installed on each device negotiate with others on their behalf. The forwarding and negotiation protocols needed to implement the marketplace solution are described in this work. Additionally, a prototypical implementation of the protocols is evaluated in a simulation environment. Since simulation results strongly depend on the mobility model, three realistic models based on an extension of the random way-point model are used. Their movement patterns are resulting from persons on a music festival, a university campus, and an exhibition.

[1]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[2]  Samir R. Das,et al.  Simulation Based Performance Evaluation of Mobile, Ad hoc Network Routing Protocols , 2000 .

[3]  Nitin H. Vaidya,et al.  Geocasting in mobile ad hoc networks: location-based multicast algorithms , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[4]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[5]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[6]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.

[7]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[8]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[9]  Samir Ranjan Das,et al.  Simulation‐based performance evaluation of routing protocols for mobile ad hoc networks , 2000, Mob. Networks Appl..

[10]  Guevara Noubir,et al.  Mobility models for ad hoc network simulation , 2004, IEEE INFOCOM 2004.

[11]  Hannes Frey,et al.  UbiBay: An auction system for mobile multihop ad-hoc networks , 2004 .

[12]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[13]  Nitin H. Vaidya,et al.  GeoTORA: a protocol for geocasting in mobile ad hoc networks , 2000, Proceedings 2000 International Conference on Network Protocols.

[14]  Tomasz Imielinski,et al.  GeoCast—geographic addressing and routing , 1997, MobiCom '97.

[15]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[16]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[17]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[18]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[19]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[20]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[21]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[22]  Jörg Hähner,et al.  Graph-based mobility model for mobile ad hoc network simulation , 2002, Proceedings 35th Annual Simulation Symposium. SS 2002.

[23]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.