|||N. Abramson. The ALOHA system - another alternative for computer communications. In Proceedings of the Fall 1970 AFIPS Computer Conference, volume 37, pages 281-285, 1970. [ bib ]|
|||E. Anceaume, B. Charron-Bost, P. Minet, and S. Toueg. On the formal specification of group membership services. Technical Report TR95-1534, Cornell University, Computer Science Department, Aug. 25, 1995. [ bib ]|
|||M. Aoki and H. Fujii. Inter-vehicle communication: Technical issues on vehicle control application. IEEE Communications Magazine, 34(10):90-93, Oct. 1996. [ bib ]|
|||Ö. Babaoğlu, R. Davoli, and A. Montresor. Group communication in partitionable systems: Specification and algorithms. Technical Report UBLCS-98-1, University of Bologna, Italy. Department of Computer Science., Apr. 1998. [ bib ]|
|||Ö. Babaoğlu, R. Davoli, A. Montresor, and R. Segala. System support for partition-aware network applications. In 18th International Conference on Distributed Computing Systems, pages 184-191, May 1998. [ bib ]|
|||K. P. Birman. The process group approach to reliable distributed computing. Communications of the ACM, 36(12):37-53, Dec. 1993. [ bib ]|
|||P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. In Third International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 48-55, Aug. 1999. [ bib ]|
|||L. Briesemeister and G. Hommel. Overcoming fragmentation in mobile ad hoc networks. Journal of Communications and Networks., 2(3):182-187, Sept. 2000. ISSN 1229-2370. [ bib ]|
|||L. Briesemeister, L. Schäfers, and G. Hommel. Disseminating messages among highly mobile hosts based on inter-vehicle communication. In IEEE Intelligent Vehicles Symposium, pages 522-527, Oct. 2000. [ bib ]|
|||J. Broch, D. Johnson, and D. Maltz. The dynamic source routing protocol for mobile ad hoc networks, Dec. 1998. IETF Internet Draft (work in progress). http://www.ietf.org/internet-drafts/draft-ietfmanet-dsr-01.txt. [ bib ]|
|||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 4th ACM/IEEE International Conference on Mobile Computing and Networking, pages 85-97, Oct. 1998. [ bib ]|
D. Câmara and A. A. F. Loureiro.
A novel routing algorithm for ad hoc networks.
In 33rd Hawaii International Conference on System Sciences,
Maui, Hawaii, USA, Jan. 2000.
[ bib |
A mobile ad hoc network (MANET) is comprised of mobile hosts that can communicate with two other using wireless links. In this paper we present a novel routing algorithm called GPSAL (GPS/Ant-Like Routing Algorithm) which is based on GPS (Global Positioning System) and mobile software agents modeled on ants for routing in ad hoc networks. We compare our algorithm to the Location-Aided Routing (LAR) algorithm for MANET which is also based on GPS. Simulation results show that our algorithm has less overhead than LAR.
|||T. D. Chandra, V. Hadzilacos, S. Toueg, and B. Charron-Bost. On the impossibility of group membership. In 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 322-330, May 1996. [ bib ]|
|||J. M. Charnes. Statistical analysis of output processes. In Winter Simulation Conference, pages 41-49, Dec. 1993. [ bib ]|
|||C.-C. Chiang, M. Gerla, and L. Zhang. Forwarding group multicast protocol (FGMP) for multihop, mobile wireless networks. ACM-Baltzer Journal of Cluster Computing: Special Issue on Mobile Computing, 1(2), 1998. [ bib ]|
|||D. Dolev, D. Malki, and R. Strong. A framework for partitionable membership service. Technical Report 95-4, Institute of Computer Science, The Hebrew University of Jerusalem, Mar. 1995. (16 pages). [ bib ]|
|||J. Ellsberger, D. Hogrefe, and A. Sarma. SDL - Formal Object-oriented Language for Communicating Systems. Prentice Hall, 1997. [ bib ]|
|||The Ensemble Distributed Communication System. Department of Computer Science, Cornell University, http://www.cs.cornell.edu/Info/Projects/Ensemble/. [ bib ]|
|||A. Ephremides, J. Wieselthier, and D. Baker. A design concept for reliable mobile radio networks with frequency hopping signaling. Proceedings of the IEEE, 75(1):56-73, Jan. 1987. [ bib ]|
|||D. Estrin, R. Govindan, J. Heidemann, and S. Kumar. Next century challenges: Scalable coordination in sensor networks. In 5th ACM/IEEE International Conference on Mobile Computing and Networking, pages 263-270, 1999. [ bib ]|
|||P. D. Ezhilchelvan, R. A. Macêdo, and S. K. Shrivastava. Newtop: A fault-tolerant group communication protocol. In 15th International Conference on Distributed Computing Systems (ICDCS'95), pages 296-306, May 1995. [ bib ]|
|||A. Fekete, N. Lynch, and A. Shvartsman. Specifying and using a partitionable group communication service. To appear in ACM Transactions on Computer Systems, http://www.toc.lcs.mit.edu/tds/. [ bib ]|
|||A. Fekete, N. Lynch, and A. Shvartsman. Specifying and using a partionable group communication service. In 16th Annual ACM Symposium on Principles of Distributed Computing, pages 53-62, Aug. 1997. [ bib ]|
|||O. Gehring and H. Fritz. Lateral control concepts for truck platooning in the CHAUFFEUR project. In 4th World Congress on Intelligent Transport Systems, Oct. 1997. [ bib ]|
|||M. Gerla and J. T.-C. Tsai. Multicluster, mobile, multimedia radio network. ACM/Baltzer Wireless Networks, 1(3):255-265, Aug. 1995. [ bib ]|
|||D. Goldsman. Simulation output analysis. In Winter Simulation Conference, pages 97-103, Dec. 1992. [ bib ]|
|||F. Harary. The maximum connectivity of a graph. Proc. of the National Academy of Sciences, 48:1142-1146, 1962. [ bib ]|
|||T. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for real-time systems. In 18th ACM Symposium on Principles of Programming Languages, pages 353-366, Jan. 1991. [ bib ]|
|||C. Ho, K. Obraczka, G. Tsudik, and K. Viswanath. Flooding for reliable multicast in multi-hop ad hoc networks. In 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM), pages 64-71, Aug. 1999. [ bib ]|
|||Internet Engineering Task Force (IETF). Mobile Ad Hoc Networks (MANET) Working Group Charter. http://www.ietf.org/html.charters/manet-charter.html. [ bib ]|
|||T. Imielinski and J. C. Navas. GPS-based geographic addressing, routing, and resource discovery. Communications of the ACM, 42(4):86-92, Apr. 1999. [ bib ]|
|||C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In 6th Annual International Conference on Mobile Computing and Networking, pages 56-67, Aug. 2000. [ bib ]|
|||International Telecommunication Union. ITU-T Recommendation Z.100. Specification and description language (SDL), Sept. 1999. [ bib ]|
|||R. Jain, A. Puri, and R. Sengupta. Geographical routing using partial information for wireless ad hoc networks. Technical Report M99/69, University of California, Berkeley, Dec. 20, 1999. [ bib ]|
|||S. Janz. Mikroskopische Minimalmodelle des Straßenverkehrs. Master's thesis, Mathematisch Naturwissenschaftliche Fakultät, Universität zu Köln, May 1998. [ bib ]|
|||The Jgroup Project. Department of Computer Science, University of Bologna, http://www.cs.unibo.it/projects/jgroup/. [ bib ]|
|||B. Karp and H. T. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In 6th Annual International Conference on Mobile Computing and Networking, pages 243-254, Aug. 2000. [ bib ]|
|||I. Keidar, J. Sussman, K. Marzullo, and D. Dolev. A client-server oriented algorithm for virtually synchronous group membership in WANs. Technical Report CS1999-0623, University of California, San Diego, Computer Science and Engineering, June 1999. [ bib ]|
|||L. Kleinrock and S. S. Lam. Packet switching in a multiaccess broadcast channel: performance evaluation. IEEE trans. on commun., 23(4):410-422, Apr. 1975. [ bib ]|
|||Y.-B. Ko and N. H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. Technical Report TR98-012, Texas A&M University, June 1, 1998. [ bib ]|
|||Y.-B. Ko and N. H. Vaidya. Geocasting in mobile ad hoc networks: Location based multicast algorithms. In Proceedings of IEEE Workshop on Mobile Computing Systems and Applications, Feb. 1999. [ bib ]|
|||Y.-B. Ko and N. H. Vaidya. Location-aided routing (LAR) in mobile ad hoc networks. Wireless Networks, 6(4):307-321, July 2000. [ bib ]|
|||S. Krauß. Microscopic traffic simulation: Robustness of a simple approach. Technical report, Deutsches Zentrum für Luft- und Raumfahrt, 1997. [ bib ]|
|||S. Krauß. Microscopic Modeling of Traffic Flow: Investigation of Collision Free Vehicle Dynamics. PhD thesis, Mathematisches Institut, Universität zu Köln, Apr. 1998. [ bib ]|
|||W. Kremer and W. Kremer. Vehicle density and communication load estimation in mobile radio local area networks (MR-LANs). In 42nd Vehicular Technology Society Conference, volume 2, pages 698-704, May 1992. [ bib ]|
|||J. Li, J. Jannotti, D. S. J. D. Couto, D. R. Karger, and R. Morris. A scalable location service for geographic ad hoc routing. In 6th Annual International Conference on Mobile Computing and Networking, pages 120-130, Aug. 2000. [ bib ]|
|||Q. Li and D. Rus. Sending messages to mobile users in disconnected ad-hoc wireless networks. In 6th Annual International Conference on Mobile Computing and Networking, pages 44-55, Aug. 2000. [ bib ]|
|||W.-Y. Li. Design and implementation of digital radio communications link for platoon control experiments. PATH Research Report UCB-ITS-PRR-95-2, University of California, Berkeley, Jan. 1995. [ bib ]|
M.-J. Lin, K. Marzullo, and S. Masini.
Gossip versus deterministic flooding: Low message overhead and high
reliability for broadcasting on small networks.
Technical Report CS1999-0637, University of California, San Diego,
Computer Science and Engineering, Nov. 18, 1999.
[ bib ]
Rumor mongering (also known as gossip) is an epidemiological protocol that implements broadcasting with a reliability that can be very high. Rumor mongering is attractive because it is generic, scalable, adapts well to failures and recoveries, and has a reliability that gracefully degrades with the number of failures in a run. In this paper we present a protocol that superficially resembles rumor mongering but is deterministic. We show that this new protocol has most of the same attractions as rumor mongering. The one attraction that rumor mongering has - namely graceful degradation - comes at a high cost in terms of the number of messages sent. We compare the two approaches both at an abstract level and in terms of how they perform in an Ethernet.
|||Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer, 1992. [ bib ]|
|||The First Annual Workshop on Mobile Ad Hoc Networking & Computing, Aug. 2000. http://www.cs.tamu.edu/faculty/vaidya/mobihoc/2000/workshop.html. [ bib ]|
|||ACM Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc), Oct. 2001. http://www.cs.tamu.edu/faculty/vaidya/mobihoc/2001/main.html. [ bib ]|
|||A. Montresor. System Support for Programming Object-Oriented Dependable Applications in Partitionable Systems. PhD thesis, University of Bologna, Italy, Mar. 2000. Technical Report UBLCS-2000-10. [ bib ]|
R. Morris, J. Jannotti, F. Kaashoek, J. Li, and D. S. J. D. Couto.
CarNet: A scalable ad hoc wireless network system.
In Proceedings of the 9th ACM SIGOPS European workshop:
Beyond the PC: New Challenges for the Operating System, Kolding, Denmark,
[ bib ]
CarNet is an application for a large ad hoc mobile network system that scales well without requiring a fixed network infrastructure to route messages. CarNet places radio nodes in cars, which communicate using Grid, a novel scalable routing system. Grid uses geographic forwarding and a scalable distributed location service to route packets from car to car without flooding the network. CarNet will support IP connectivity as well as applications such as cooperative highway congestion monitoring, fleet tracking, and discovery of nearby points of interest.
|||J. C. Navas and T. Imielinski. GeoCast - geographic addressing and routing. In 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 66-76, Sept. 1997. [ bib ]|
The Network Simulator - ns-2
http://www.isi.edu/nsnam/ns/. [ bib ]
|||M. Ohtomo, R. Kimura, S. Fukushima, and N. Fujii. Automatic following system utilizing vehicle-to-vehicle communication. In IEEE International Conference on Intelligent Vehicles, pages 381-384, Oct. 1998. [ bib ]|
|||E. Pagani and G. P. Rossi. Reliable broadcast in mobile multihop packet networks. In Third Annual ACM/IEEE International Conference on Mobile Computing and Networking, Sept. 1997. [ bib ]|
|||E. Pagani and G. P. Rossi. Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks. Mobile Networks and Applications, 4(3):175-192, 1999. [ bib ]|
|||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, Aug. 1994. [ bib ]|
|||R. Prakash and R. Baldoni. Architecture for group communication in mobile systems. In 17th IEEE Symposium on Reliable Distributed Systems, pages 235-244, Oct. 1998. [ bib ]|
|||L. Rodrigues and K. Guo. Partitionable light-weight groups. In 20th IEEE International Conference on Distributed Computing Systems (ICDCS'20), pages 38-45, Apr. 2000. [ bib ]|
|||E. Royer and C.-K. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications Magazine, pages 46-55, Apr. 1999. [ bib ]|
|||S. R. Sachs and P. Varaiya. A communication system for the control of automated vehicles. PATH Technical Memorandum 93-5, University of California, Berkeley, Sept. 1993. [ bib ]|
|||The SDL Forum Society. http://www.sdl-forum.org. [ bib ]|
|||The Spread Wide Area Group Communication system. Center for Networking and Distributed Systems, Johns Hopkins University, http://www.spread.org/. [ bib ]|
|||I. Stojmenovic and X. Lin. GEDIR: Loop-free location based routing in wireless networks. In IASTED International Conference on Parallel and Distributed Computing and Systems, pages 1025-1028, Nov. 1999. [ bib ]|
|||I. Stojmenovic and X. Lin. Power aware localized routing in wireless networks. In IEEE International Parallel and Distributed Processing Symposium, pages 371-376, May 2000. [ bib ]|
|||I. Stojmenovic and M. Russell. Depth first search and location based localized routing and QoS routing in wireless networks. In IEEE International Conference on Parallel Processing, pages 173-180, Aug. 2000. [ bib ]|
|||H. Takagi and L. Kleinrock. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Transactions on Communications, 32(3):246-257, Mar. 1984. [ bib ]|
|||The Transis Project Home Page. Computer Science Department, The Hebrew University of Jerusalem, http://www.cs.huji.ac.il/~transis/. [ bib ]|
|||A. Vahdat and D. Becker. Epidemic routing for partially-connected ad hoc networks. Technical Report CS-200006, Duke University, Apr. 2000. [ bib ]|
|||C. K. H. Wilson, S. Rogers, and S. Weisenburger. The potential of precision maps in intelligent vehicles. In IEEE International Conference on Intelligent Vehicles, pages 419-422, Oct. 1998. [ bib ]|
|||H. Zhou and S. Singh. Content based multicast (CBM) in ad hoc networks. In First Annual Workshop on Mobile Ad Hoc Networking and Computing, pages 51-60, Aug. 2000. [ bib ]|
This file was generated by bibtex2html 1.96.