Related Research Articles
An ad hoc network refers to technologies that allow network communications on an ad hoc basis. Associated technologies include:
A wireless mesh network (WMN) is a communications network made up of radio nodes organized in a mesh topology. It can also be a form of wireless ad hoc network.
Wireless sensor networks (WSNs) refer to networks of spatially dispersed and dedicated sensors that monitor and record the physical conditions of the environment and forward the collected data to a central location. WSNs can measure environmental conditions such as temperature, sound, pollution levels, humidity and wind.
Delay-tolerant networking (DTN) is an approach to computer network architecture that seeks to address the technical issues in heterogeneous networks that may lack continuous network connectivity. Examples of such networks are those operating in mobile or extreme terrestrial environments, or planned networks in space.
Vehicular ad hoc networks (VANETs) are created by applying the principles of mobile ad hoc networks (MANETs) – the spontaneous creation of a wireless network of mobile devices – to the domain of vehicles. VANETs were first mentioned and introduced in 2001 under "car-to-car ad-hoc mobile communication and networking" applications, where networks can be formed and information can be relayed among cars. It was shown that vehicle-to-vehicle and vehicle-to-roadside communications architectures will co-exist in VANETs to provide road safety, navigation, and other roadside services. VANETs are a key part of the intelligent transportation systems (ITS) framework. Sometimes, VANETs are referred as Intelligent Transportation Networks. They are understood as having evolved into a broader "Internet of vehicles". which itself is expected to ultimately evolve into an "Internet of autonomous vehicles".
A wireless ad hoc network (WANET) or mobile ad hoc network (MANET) is a decentralized type of wireless network. The network is ad hoc because it does not rely on a pre-existing infrastructure, such as routers or wireless access points. Instead, each node participates in routing by forwarding data for other nodes. The determination of which nodes forward data is made dynamically on the basis of network connectivity and the routing algorithm in use.
Geographic routing is a routing principle that relies on geographic position information. It is mainly proposed for wireless networks and based on the idea that the source sends a message to the geographic location of the destination instead of using the network address. In the area of packet radio networks, the idea of using position information for routing was first proposed in the 1980s for interconnection networks. Geographic routing requires that each node can determine its own location and that the source is aware of the location of the destination. With this information, a message can be routed to the destination without knowledge of the network topology or a prior route discovery.
Ian F. Akyildiz is a Turkish-American electrical engineer. He received his BS, MS, and PhD degrees in Electrical and Computer Engineering from the University of Erlangen-Nürnberg, Germany, in 1978, 1981 and 1984, respectively. Currently, he is the President and CTO of the Truva Inc. since March 1989. He retired from the School of Electrical and Computer Engineering (ECE) at Georgia Tech in 2021 after almost 35 years service as Ken Byers Chair Professor in Telecommunications and Chair of the Telecom group.
Augmented tree-based routing (ATR) protocol, first proposed in 2007, is a multi-path DHT-based routing protocol for scalable networks. ATR resorts to an augmented tree-based address space structure and a hierarchical multi-path routing protocol in order to gain scalability and good resilience against node failure/mobility and link congestion/instability.
Routing in delay-tolerant networking concerns itself with the ability to transport, or route, data from a source to a destination, which is a fundamental ability all communication networks must have. Delay- and disruption-tolerant networks (DTNs) are characterized by their lack of connectivity, resulting in a lack of instantaneous end-to-end paths. In these challenging environments, popular ad hoc routing protocols such as AODV and DSR fail to establish routes. This is due to these protocols trying to first establish a complete route and then, after the route has been established, forward the actual data. However, when instantaneous end-to-end paths are difficult or impossible to establish, routing protocols must take to a "store and forward" approach, where data is incrementally moved and stored throughout the network in hopes that it will eventually reach its destination. A common technique used to maximize the probability of a message being successfully transferred is to replicate many copies of the message in hopes that one will succeed in reaching its destination.
In mobility management, the random waypoint model is a random model for the movement of mobile users, and how their location, velocity and acceleration change over time. Mobility models are used for simulation purposes when new network protocols are evaluated. The random waypoint model was first proposed by Johnson and Maltz. It is one of the most popular mobility models to evaluate mobile ad hoc network (MANET) routing protocols, because of its simplicity and wide availability.
Subhash Suri is an Indian-American computer scientist, a professor at the University of California, Santa Barbara. He is known for his research in computational geometry, computer networks, and algorithmic game theory.
A mobile wireless sensor network (MWSN) can simply be defined as a wireless sensor network (WSN) in which the sensor nodes are mobile. MWSNs are a smaller, emerging field of research in contrast to their well-established predecessor. MWSNs are much more versatile than static sensor networks as they can be deployed in any scenario and cope with rapid topology changes. However, many of their applications are similar, such as environment monitoring or surveillance. Commonly, the nodes consist of a radio transceiver and a microcontroller powered by a battery, as well as some kind of sensor for detecting light, heat, humidity, temperature, etc.
Chai Keong Toh is a Singaporean computer scientist, engineer, industry director, former VP/CTO and university professor. He is currently a Senior Fellow at the University of California Berkeley, USA. He was formerly Assistant Chief Executive of Infocomm Development Authority (IDA) Singapore. He has performed research on wireless ad hoc networks, mobile computing, Internet Protocols, and multimedia for over two decades. Toh's current research is focused on Internet-of-Things (IoT), architectures, platforms, and applications behind the development of smart cities.
Ramesh Govindan is an Indian-American professor of computer science. He is the Northrop Grumman Chair in Engineering and Professor of Computer Science and Electrical Engineering at the University of Southern California.
Associativity-based routing is a mobile routing protocol invented for wireless ad hoc networks, also known as mobile ad hoc networks (MANETs) and wireless mesh networks. ABR was invented in 1993, filed for a U.S. patent in 1996, and granted the patent in 1999. ABR was invented by Chai Keong Toh while doing his Ph.D. at Cambridge University.
Atta ur Rehman Khan is a computer scientist and academician who has contributed to multiple domains of the field. According to a Stanford University report, he is among World's Top 2% Scientists. He is the founder of National Cyber Crime Forensics Lab Pakistan, which operates in partnership with NR3C. He has published numerous research articles and books. He is a senior member of IEEE and ACM.
Zygmunt J. Haas is a professor and distinguished chair in computer science, University of Texas at Dallas (UTD) also the professor emeritus in electrical and computer engineering, Cornell University. His research interests include ad hoc networks, wireless networks, sensor networks, and zone routing protocols.
Matthias Grossglauser is a Swiss communication engineer. He is a professor of computer science at EPFL and co-director of the Information and Network Dynamics Laboratory (INDY) at EPFL's School of Computer and Communication Sciences School of Basic Sciences.
References
- "A distance routing effect algorithm for mobility (DREAM)" in
- Basagni, Stefano; Imrich Chlamtac; Violet R. Syrotiuk; Barry A. Woodward (1998). International Conference on Mobile Computing and Networking Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking. New York: ACM Press. pp. 76–84. doi:10.1145/288235.288254. ISBN 978-1-58113-035-5. S2CID 195349662.
- ↑ Mauve, M.; Widmer, J.; Hartenstein, H. (November 2001). "A survey on position-based routing in mobile ad hoc networks". IEEE Network. 15 (6): 30–39. CiteSeerX 10.1.1.25.2774 . doi:10.1109/65.967595.
- ↑ Abolhasan, Mehran; Wysocki, Tadeusz; Dutkiewicz, Eryk (January 2004). "A review of routing protocols for mobile ad hoc networks". Ad Hoc Networks. 2 (1): 1–22. doi:10.1016/S1570-8705(03)00043-X.
- ↑ Lee, Sung-Ju; Hsu, Julian; Hayashida, Russell; Gerla, Mario; Bagrodia, Rajive (May 2003). "Selecting a routing strategy for your ad hoc network" (PDF). Computer Communications. 26 (7): 723–733. doi:10.1016/S0140-3664(02)00207-4.
- ↑ Camp, T.; Boleng, J.; Wilcox, L. (1 January 2002). "Location information services in mobile ad hoc networks". 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333). Vol. 5. pp. 3318–3324 vol.5. CiteSeerX 10.1.1.10.3721 . doi:10.1109/ICC.2002.997446. ISBN 978-0-7803-7400-3. S2CID 10480331.
 | This computer networking article is a stub. You can help Wikipedia by expanding it. |