A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

Position-based routing and MAC protocols for wireless ad-hoc networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This thesis presents the Forecasting Routing Technique (FORTEL), a routing protocol for Mobile Ad-Hoc Networks (MANETs) based on the nodes’ Location Information. FORTEL stores the nodes’ location information in the Location Table (LT) in order to construct routes between the source and the destination nodes. FORTEL follows the source routing strategy, which has rarely been applied in position-based routing. According to the source routing strategy, the end-to-end route is attached to the packet, therefore, the processing cost, in regards to the intermediate nodes that simply relay the packet according to route, is minimized. FORTEL’s key mechanisms include: first, the location update scheme, employed to keep the LT entries up-to-date with the network topology. Besides the mobility variation and the constant rate location update schemes applied, a window location update scheme is presented to increase the LT’s information accuracy. Second, the switching mechanism, between “Hello” message and location update employed, to reduce the protocol’s routing overhead. Third and most important is the route computation mechanism, which is integrated with a topology forecasting technique to construct up-to-date routes between the communication peers, aiming to achieve high delivery rate and increase the protocol robustness against the nodes’ movement. FORTEL demonstrates higher performance as compared to other MANET’s routing protocols, and it delivers up to 20% more packets than AODV and up to 60 % more than DSR and OLSR, while maintaining low levels of routing overhead and network delay at the same time. The effectiveness of the window update scheme is also discussed, and it proves to increase FORTEL’s delivery rate by up to 30% as compared to the other update schemes. A common and frequently occurring phenomenon, in wireless networks, is the Hidden Terminal problem that significantly impacts the communication performance and the efficiency of the routing and MAC protocols. Beaconless routing approach in MANETs, which delivers data packets without prior knowledge of any sort `of information, suffers from packet duplication caused by the hidden nodes during the contention process. Moreover, the throughput of the IEEE MAC protocol decreases dramatically when the hidden terminal problem occurs. RTS/CTS mechanism fails to eliminate the problem and can further degrade the network’s performance by introducing additional overhead. To tackle these challenges, this thesis presents two techniques, the Sender Suppression Algorithm and the Location-Aided MAC, where both rely on the nodes’ position to eliminate packet duplication in the beaconless routing and improve the performance of the 802.11 MAC respectively. Both schemes are based on the concept of grouping the nodes into zones and assign different time delay to each one. According to the Sender Suppression Algorithm, the sender’s forwarding area is divided into three zones, therefore, the local timer, set to define the time that the receiver has to wait before responding to the sender’s transmission, is added to the assigned zone delay. Following the first response, the sender interferes and suppresses the receivers with active timer of. On the other hand, the Location-Aided MAC, essentially a hybrid MAC, combines the concepts of time division and carrier sensing. The radio range of the wireless receiver is partitioned into four zones with different zone delays assigned to each zone. Channel access within the zone is purely controlled by CSMA/CA protocol, while it is time-based amongst zones. The effectiveness of the proposed techniques is demonstrated through simulation tests. Location-Aided MAC considerably improves the network’s throughput compared to CSMA/CA and RTS/CTS. However, remarkable results come when the proposed technique and the RTS/CTS are combined, which achieves up to 20% more throughput as compared to the standalone RTS/CTS. Finally, the thesis presents a novel link lifetime estimation method for greedy forwarding to compute the link duration between two nodes. Based on a newly introduced Stability-Aware Greedy (SAG) scheme, the proposed method incorporates the destination node in the computation process and thus has a significant advantage over the conventional method, which only considers the information of the nodes composing the link

Performance Analysis of Various Routing Protocols in 3D Body Architecture using Qualnet in WBSN

Wireless Body Sensor Network (WBSN) is a connectionless architecture used to monitor health of a patient or an athlete. Various routing strategies have been proposed to increase the network lifetime. In this work, we have compared some well known ad-hoc network routing protocols like DYMO, DSR, ZRP and LAR1 in WBSN. WBSN works in a small area like Bluetooth or Zigbee. Few gateway nodes are also considered to route the traffic. The simulations have been performed using Qualnet 6.1. Various parameters like jitter, throughput, end to end delay, packet delivery ratio has been used for comparison. Results revealed that ZRP have least end to end delay (0.2) and jitter (0.1), but have low throughput i.e. 2362 b/s as compared to DYMO and DSR i.e. 2752 b/s and 3026 b/s

A receiver-initiated soft-state probabilistic multicasting protocol in wireless ad hoc networks

A novel Receiver-Initiated Soft-State Probabilistic multicasting protocol (RISP) for mobile ad hoc network is proposed in this paper. RISP introduces probabilistic forwarding and soft-state for making relay decisions. Multicast members periodically initiate control packets, through which intermediate nodes adjust the forwarding probability. With a probability decay function (soft-state), routes traversed by more control packets are reinforced, while the less utilized paths are gradually relinquished. In this way, RISP can adapt to node mobility: at low mobility, RISP performs similar to a tree-based protocol; at high mobility, it produces a multicast mesh in the network. Simulation results show RISP has lower delivery redundancy than meshbased protocols, while achieving higher delivery ratio. Further, the control overhead is lower than other compared protocols. © 2005 IEEE.published_or_final_versio

A receiver-initiated soft-state probabilistic multicasting protocol in wireless ad hoc networks

A novel Receiver-Initiated Soft-State Probabilistic multicasting protocol (RISP) for mobile ad hoc network is proposed in this paper. RISP introduces probabilistic forwarding and soft-state for making relay decisions. Multicast members periodically initiate control packets, through which intermediate nodes adjust the forwarding probability. With a probability decay function (soft-state), routes traversed by more control packets are reinforced, while the less utilized paths are gradually relinquished. In this way, RISP can adapt to node mobility: at low mobility, RISP performs similar to a tree-based protocol; at high mobility, it produces a multicast mesh in the network. Simulation results show RISP has lower delivery redundancy than meshbased protocols, while achieving higher delivery ratio. Further, the control overhead is lower than other compared protocols. © 2005 IEEE.published_or_final_versio

Surveying Position Based Routing Protocols for Wireless Sensor and Ad-hoc Networks

A focus of the scientific community is to design network oriented position-based routing protocols and this has resulted in a very high number of algorithms, different in approach and performance and each suited only to particular applications. However, though numerous, very few position-based algorithms have actually been adopted for commercial purposes. This article is a survey of almost 50 position-based routing protocols and it comes as an aid in the implementation of this type of routing in various applications which may need to consider the advantages and pitfalls of position-based routing. An emphasis is made on geographic routing, whose notion is clarified as a more restrictive and more efficient type of position-based routing. The protocols are therefore divided into geographic and non-geographic routing protocols and each is characterized according to a number of network design issues and presented in a comparative manner from multiple points of view. The main requirements of current general applications are also studied and, depending on these, the survey proposes a number of protocols for use in particular application areas. This aims to help both researchers and potential users assess and choose the protocol best suited to their interest

Improved Road Segment-Based Geographical Routing Protocol for Vehicular Ad-hoc Networks

This research was funded by Bahria University, Islamabad Campus.Qureshi, KN.; Ul Islam, F.; Kaiwartya, O.; Kumar, A.; Lloret, J. (2020). Improved Road Segment-Based Geographical Routing Protocol for Vehicular Ad-hoc Networks. Electronics. 9(8):1-20. https://doi.org/10.3390/electronics9081248S1209

Scenario Based Study of On-demand reactive routing protocol for IEEE-802.11 and 802.15.4 standards

Routing data from source to destination is hard in Mobile Ad-Hoc Networks (MANET) due to the mobility of the network elements and lack of central administration. The main method for evaluating the performance of MANETs is simulation. In this paper performance of Ad-hoc On-demand Distance Vector (AODV) reactive routing protocol is studied by considering IEEE 802.11 and IEEE 802.15.4 standards. Metrics like average end-to-end delay, packet delivery ratio, total bytes received and throughput are considered for investigating simulation scenario by varying network size with 10 mps node mobility. Also simulation has been carried out by varying mobility for scenario with 50 nodes

Analysis of pervasive mobile ad hoc routing protocols

Pervasive computing (also referred to as ubiquitous computing or ambient intelligence) aims to create environments where computers are invisibly and seamlessly integrated and connected into our everyday environment. Pervasive computing and intelligent multimedia technologies are becoming increasingly important, although many potential applications have not yet been fully realized. These key technologies are creating a multimedia revolution that will have significant impact across a wide spectrum of consumer, business, healthcare, and governmental domains. This useful volume provides up-to-date and state-of-the-art coverage of the diverse topics related to pervasive computing and intelligent multimedia technologies. The use of different computational intelligence-based approaches to various problems in pervasive computing are examined, including video streaming, intelligent behavior modeling and control for mobile manipulators, tele-gaming, indexing video summaries for quick video browsing, web service processes, virtual environments, ambient intelligence, and prevention and detection of attacks to ubiquitous databases. Topics and features: -Includes a comprehensive overview, providing a thorough literature review and an outline of the important research challenges -Discusses pervasive computing approaches in the context of intelligent multimedia -Examines virtual reality technology, mobile virtual environments, and the potential use of intelligent multimedia and ubiquitous computing in the hotels of the future -Describes various approaches in ambient intelligence for home health care for the elderly and those suffering from Alzheimer’s disease, for volcano monitoring, and for preventing attacks to ubiquitous databases Investigates issues in web services and situation awareness in pervasive computing environments -Explores wireless network applications, such as mobile agents and e-commerce