EraMobile

Last updated

EraMobile -Epidemic-based Reliable and Adaptive Multicast for Mobile ad hoc networks is a bio-inspired reliable multicast protocol targeting mission critical ad hoc networks. [1] [2] EraMobile supports group applications that require high reliability and low overhead with loose delivery time constraints. The protocol aims to deliver multicast data with maximum reliability and minimal network overhead under adverse network conditions. EraMobile adopts an epidemic-based approach, which uses gossip messages, [3] to cope with dynamic topology changes due to the mobility of network nodes. EraMobile's epidemic mechanism does not require maintaining any tree- or mesh-like structure for multicast operation. It requires neither a global nor a partial view of the network, nor does it require information about neighboring nodes and group members. The lack of a central structure for multicast lowers the network overhead by eliminating redundant data transmissions. EraMobile contains a simple adaptivity mechanism which tunes the frequency of control packages based on the node density in the network. This adaptivity mechanism helps the delivery of data reliably in both sparse networks -in which network connectivity is prone to interruptions- and dense networks -in which congestion is likely because of shared wireless medium-.

Related Research Articles

Wireless mesh network

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.

Optimized Link State Routing Protocol IP routing protocol optimized for mobile ad hoc networks

The Optimized Link State Routing Protocol (OLSR) is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR is a proactive link-state routing protocol, which uses hello and topology control (TC) messages to discover and then disseminate link state information throughout the mobile ad hoc network. Individual nodes use this topology information to compute next hop destinations for all nodes in the network using shortest hop forwarding paths.

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.

Dynamic Source Routing (DSR) is a routing protocol for wireless mesh networks. It is similar to AODV in that it forms a route on-demand when a transmitting node requests one. However, it uses source routing instead of relying on the routing table at each intermediate device.

IP multicast is a method of sending Internet Protocol (IP) datagrams to a group of interested receivers in a single transmission. It is the IP-specific form of multicast and is used for streaming media and other network applications. It uses specially reserved multicast address blocks in IPv4 and IPv6.

There are two drastically different kind of MobiCast.

Flooding (computer networking) Simple routing algorithm sending incoming packets to all other links than the sender

Flooding is used in computer networks routing algorithm in which every incoming packet is sent through every outgoing link except the one it arrived on.

The Multicast MAnet Routing Protocol (MMARP) aims to provide multicast routing in Mobile Ad Hoc Networks (MANETs) taking into account interoperation with fixed IP networks with support of IGMP/MLD protocol. This is achieved by the Multicast Internet Gateway (MIG) which is an ad hoc node itself and is responsible for notifying access routers about the interest revealed by common ad hoc nodes. Any of these nodes may become a MIG at any time but needs to be one hop away from the network access router. Once it self-configures as MIG it should then broadcast periodically its address as being the one of the default multicast gateway. Whoever besides this proactive advertisement the protocol states a reactive component the ad hoc mesh is created and maintained.

6LoWPAN is an acronym of IPv6 over Low -Power Wireless Personal Area Networks. 6LoWPAN is the name of a concluded working group in the Internet area of the IETF.

Wireless grids are wireless computer networks consisting of different types of electronic devices with the ability to share their resources with any other device in the network in an ad hoc manner. A definition of the wireless grid can be given as: "Ad hoc, distributed resource-sharing networks between heterogeneous wireless devices" The following key characteristics further clarify this concept:

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 in wired networks or access points in wireless networks. Instead, each node participates in routing by forwarding data for other nodes, so the determination of which nodes forward data is made dynamically on the basis of network connectivity and the routing algorithm in use.

B.A.T.M.A.N. Routing protocol for multi-hop mobile ad hoc networks

The Better Approach to Mobile Ad-hoc Networking (B.A.T.M.A.N.) is a routing protocol for multi-hop mobile ad hoc networks which is under development by the German "Freifunk" community and intended to replace the Optimized Link State Routing Protocol (OLSR).

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.

A gossip protocol is a procedure or process of computer peer-to-peer communication that is based on the way epidemics spread. Some distributed systems use peer-to-peer gossip to ensure that data is disseminated to all members of a group. Some ad-hoc networks have no central registry and the only way to spread common data is to rely on each member to pass it along to their neighbours.

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 multi-hop networks, Adaptive Quality of Service routing protocols have become increasingly popular and have numerous applications. One application in which it may be useful is in Mobile ad hoc networking (MANET).

IEEE 802.11s is a wireless LAN standard and an IEEE 802.11 amendment for mesh networking, defining how wireless devices can interconnect to create a wireless LAN (WLAN) mesh network, which may be used for relatively fixed topologies and wireless ad hoc networks. The IEEE 802.11s task group drew upon volunteers from university and industry to provide specifications and possible design solutions for wireless mesh networking. As a standard, the document was iterated and revised many times prior to finalization.

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.

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.

References

  1. Genc, Zulkuf; Ozkasap, Oznur (2007). "EraMobile: Epidemic-Based Reliable and Adaptive Multicast for MANETs". 2007 IEEE Wireless Communications and Networking Conference: 4395–4400. doi:10.1109/WCNC.2007.801. ISBN   978-1-4244-0658-6. S2CID   17357981.
  2. Ozkasap, Oznur; Genc, Zulkuf; Atsan, Emre (2009). "Epidemic-based reliable and adaptive multicast for mobile ad hoc networks". Computer Networks. 53 (9): 1409–1430. doi:10.1016/j.comnet.2009.01.007.
  3. Özkasap, Öznur; Genç, Zülküf; Atsan, Emre (2006). "Epidemic-based approaches for reliable multicast in mobile ad hoc networks". ACM Sigops Operating Systems Review. 40 (3): 73–79. doi:10.1145/1151374.1151390. S2CID   2194318.