6 research outputs found
Route discovery based on energy-distance aware routing scheme for MANET
Route discovery proses in a Mobile Ad hoc Network (MANET) is challenging due to the limitation of energy at each network node. The energy constraint limits network connection lifetime thus affecting the routing process. Therefore, it is necessary for each node in the network to calculate routing factor in terms of energy and distance in deciding optimal candidate relay nodes needed to forward packets. This study proposes a new route discovery mechanism called the Energy-Distance Routing Aware (EDRA) that determines the selection of nodes during route discovery process to improve the network connection lifetime. This mechanism comprises of three schemes namely the Energy-Distance Factor Aware (EDFA), the Energy-Distance Forward Strategy (EDFS), and the Energy-Aware Route Selection (EARS). The EDFA scheme begins by calculating each nodes energy level (ei) and
the distance (di) to the neighbouring nodes to produce the energy-distance factor value used in selecting the relay nodes. Next, the EDFS scheme forwards route request packets within discovery area of relay nodes based on the number of nodes.
Then, the EARS scheme selects stable routing path utilising updated status information from EDFA and EDFS. The evaluation of EDRA mechanism is performed using network simulator Ns2 based on a defined set of performance metrics, scenarios and network scalability. The experimental results show that the
EDRA gains significant improvement in the network connection lifetime when compared to those of the similar mechanisms, namely the AODV and the DREAM.
EDRA also optimises energy consumption by utilising efficient forwarding decisions on varying scale of network nodes. Moreover, EDRA maximizes network
connection lifetime while preserving throughput and packet drop ratio. This study contributes toward developing an efficient energy-aware routing to sustain longer network connection lifetime in MANET environment. The contribution is significant
in promoting the use of green and sustainable next generation network technology
Recommended from our members
Efficient route discovery for reactive routing
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Information on the location of mobile nodes in Mobile Ad-hoc Networks (MANETs) has
the potential to significantly improve network performance. This thesis uses node location information to develop new techniques for route discovery in on-demand routing protocols such as the Ad-hoc On-Demand Distance Vector (AODV), thus making an important contribution to enhancing the experience of using mobile networks.
A Candidate Neighbours to Rebroadcast the Route Request (CNRR) approach has been
proposed to reduce the deleterious impact, known as the broadcast storm, of RREQ packets
flooding in traditional on-demand routing protocols. The main concept behind CNRR is
specifying a set of neighbours which will rebroadcast the received RREQ. This is a departure from the traditional approach of all receiving nodes rebroadcasting RREQs and has the effect of reducing the problem of redundancy from which mobile networks suffer. The proposed protocol has been developed in two phases: Closest-CNRR and Furthest-CNRR. The simulation results show that the proposed algorithms have a significant effect as they reduce the routing overhead of the AODV protocol by up to 28% compared to the C-CNRR, and by up to 17.5% compared to the F-CNRR. Notably, the proposed algorithms simultaneously achieve better throughput and less data dropping.
The Link Stability and Energy Aware protocol (LSEA) has been developed to reduce the
overhead while increasing network lifetimes. The LSEA helps to control the global
dissemination of RREQs in the network by eliminating those nodes that have a residual
energy level below a specific threshold value from participation in end-to-end routes. The proposed LSEA protocol significantly increases network lifetimes by up to 19% compared with other on-demand routing protocols while still managing to obtain the same packet delivery ratio and network throughput levels. Furthermore, merging the LSEA and CNRR concepts has the great advantage of reducing the dissemination of RREQs in the network without loss of reachability among the nodes.
This increases network lifetimes, reduces the overhead and increases the amount of data
sent and received. Accordingly, a Position-based Selective Neighbour (PSN) approach has
been proposed which combines the advantages of zoning and link stability. The results
show that the proposed technique has notable advantages over both the AODV and MAAODV
as it improves delivery ratios by 24.6% and 18.8%, respectively.Funded by National Council for Training -
Sudan and the Sudan Academy of Science
Recommended from our members
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
Improved AODV Routing Protocol to Cope with High Overhead in High Mobility MANETs
Ad-hoc On-demand Distance Vector (AODV) is the most popular routing protocol for mobile ad-hoc networks (MANETs). According to its nature, AODV makes route discovery when there is data to send at source and source doesnât have route to the specified destination. To discover a route to a destination, AODV floods the network with control messages like RREQ, and RREP which may result in unnecessarily large number of control messages that travel through the network and consume network resources such as bandwidth, and node processing power. This thesis improves AODV protocol by limiting the number of AODV control messages forwarded though the network during the route discovery process. By using Global Positioning System (GPS), each node knows its location and its traveling speed stamped by time. Each source node propagates its location and speed stamped by time to other nodes in the network by adding its location information to the generated RREQ packet and HELLO messages. Each node in the network stores location information of other nodes. We propose two protocols to limit control messages flooding in the Ad-hoc networks. The first proposed protocol which is called AODV-LAR uses alternative request region defined in LAR. It uses location information to estimate the location of the destination and then estimates the rectangular search region. To increase the accuracy of the estimation of the search region, the first proposed protocol takes into account the distance that destination node moves during discovery process by adding tolerance factor to the search region. In the second proposed protocol which is called AODV-Line, the intermediate nodes decide to participate in route discovery process according to their distance from the line connecting the source and destination locations without the need of the information about the destination traveling speed. The route discovery search region is adjusted based on the location information of both source and destination. To reduce the delay of route discovery process, AODV-LAR defines an equation to estimate the initial TTL of the RREQ message. We evaluate the performance of the two proposed protocols using two simulation scenarios. The simulation was done using JIST/SWANS simulator. Different performance metrics were measured including routing overhead, number of RREQ messages, delivery ratio, normalized routing load, and delay. The results were compared to the original AODV routing protocol. The results shows that the two proposed protocols outperform the original AODV, where the results report a valuable reduction of overhead , number of RREQ messages sent through the network, and reduction in delay compared to the original AODV. Results also show that the delivery ratio in the proposed protocols is comparable to the delivery ratio in the original AODV protocol
Position-based routing and MAC protocols for wireless ad-hoc networks
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.EThOS - Electronic Theses Online ServiceGBUnited Kingdo
Position-based routing and MAC protocols for wireless ad-hoc networks
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.EThOS - Electronic Theses Online ServiceGBUnited Kingdo