Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Basagni, I. Chalamtac, and V. R. Syrotiuk. A distance routing effect algorithm for mobility (dream). In Proc. of the 4th ACM/IEEE Int. Conf, on Mobile Computing and Networking (MobiCom’98), pages 76–84, 1998.
J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proc. of the 4th ACM/IEEE Int. Conf. on Mobile Computing and Networking (MobiCom’98), pages 85–97, 1998.
T. Camp, J. Boleng, and V. Davies. Mobility models for ad hoc network simulations. Wireless Communication & Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2002.
S. Das, R. Castañeda, and J. Yan. Simulation based performance evaluation of mobile, ad hoc network routing protocols. ACM/Baltzer Mobile Networks and Applications (MONET) Journal, pages 179–189, 2000.
S. Das, C. Perkins, and E. Royer. Performance comparison of two on-demand routing protocols for ad hoc networks. In Proc. of the 2000 IEEE Computer and Communications Societies Conference on Computer Communications (INFOCOM-00), pages 3–12, 2000.
H. Frey, J.K. Lehnert, and P. Sturm. Ubibay: An auction system for mobile multihop ad-hoc networks. Workshop on Ad hoc Communications and Collaboration in Ubiquitous Computing Environments (AdHocCCUCE’02), 2002.
X. Hong, M. Gerla, G. Pei, and C. Chiang. A group mobility model for ad hoc wireless networks. In Proc. of the 2nd A CM/IEEE Int. Workshop on Modeling and Simulation of Wireless and Mobile Systems (MSWiM’99), pages 53–60, 1999.
P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark. Scenario-based performance analysis of routing protocols for mobile ad-hoc networks. In Proc. of the 5th ACM/IEEE Int. Conf. on Mobile Computing and Networking (MobiCom’99), pages 195–206, 1999.
D.B. Johnson and D.A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, volume 353 of The Kluwer International Series in Engeneering and Computer Science. Kluwer Academic Publishers, 1996.
Y.-B. Ko and N.H. Vaidya. Geocasting in mobile ad hoc networks: Location-based multicast algorithms. Technical report, TR-98-018, Texas A&M University, 1998.
Y.-B. Ko and N.H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. In Proc. of the 4th ACM/IEEE Int. Conf. on Mobile Computing and Networking (MobiCom’98), pages 66–75, 1998.
Y.-B. Ko and N.H. Vaidya. Geotora: A protocol for geocasting in mobile ad hoc networks. Technical report, TR-00-010, Texas A&M University, 2000.
J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris. A scalable location service for geographic ad-hoc routing. In Proc. of the 6th ACM Int. Conf. on Mobile Computing and Networking (MobiCom’00), pages 120–130, 2000.
M. Mauve, J. Widemer, and H. Hartenstein. A survey on position-based routing in mobile ad-hoc networks. IEEE Network Magazine, 15(6):30–39, 2001.
J.C. Navas and T. Imielinski. Geocast—geographic addressing and routing. In In Proc. of the 3rd ACM/IEEE Int. Conf. on Mobile Computing and Networking (MobiCom’97), pages 66–76, 1997.
S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. Proc. of the 5th ACM/IEEE Int. Conf. on Mobile Computing and Networking, pages 151–162, 1999.
V.D. Park and M.S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proc. of the Conf. on Computer Communications (IEEE INFOCOM’97), pages 1405–1413, 1997.
C. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In ACM SIGCOMM’94 Conference on Communications Architectures, Protocols and Applications, pages 234–244, 1994.
C.E. Perkins. Ad-hoc on-demand distance vector routing. In MILCOM’ 97 panel on Ad Hoc Networks, 1997.
J. Tian, J. Hähner, C. Becker, I. Stepanov, and K. Rothermel. Graph-based mobility model for mobile ad hoc network simulation. In Proc. of the 35th Simulation Symposium, in cooperation with the IEEE Computer Society and ACM, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Görgen, D., Frey, H., Lehnert, J.K., Sturm, P. (2003). Marketplaces as Communication Patterns in Mobile Ad-Hoc Networks*. In: Irmscher, K., Fähnrich, KP. (eds) Kommunikation in Verteilten Systemen (KiVS). Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55569-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-55569-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00365-6
Online ISBN: 978-3-642-55569-5
eBook Packages: Springer Book Archive