This website uses cookies to ensure you have the best experience. Learn more

Stable And Self Adaptive Routing For Mobile Ad Hoc Networks Using Cross Layer Design

2857 words - 12 pages

System Design

The cross layer based reliable routing algorithm, is designed using the metric from the physical layer, data link layer and transferring it to the network layer to make the routing decisions. This algorithm involves the mobile node cooperatively to establish the route and introduces the radio link stability with extensive cross layer cooperation to establish reliable and stable routes. We have developed this algorithm by modifying the underlying principle of dynamic source routing protocol. Dynamic source routing is known for its benefits of routing in multiple paths avoiding the overhead of new route discovery whenever the route in use breaks [10. Hang Shen, 2008]. The route discovery and route maintenance easily support uni-directional links and asymmetric routes. DSR is also compatible for internetworking routing consisting of different types of network. The only drawback of DSR could be reported as its performance is not par with other reactive routing protocols in a high mobility environment. Another reason for selecting DSR as base protocol, is much of researches done on cross layer design protocol is discussed with AODV, and minimal work is on with DSR.
Our cross layer, dynamic source routing (CL-DSR) has had two phases Route Discovery and Route Maintenance. Figure 2 represents the architecture of the proposed algorithm.

The cross layer metrics discussed in the literature focus on the link lifetime based on received signal strength, distance between the nodes, the number of damaged received packets which are contributed by SNR (Signal to noise ratio). In reality fading effects due to mobility and multipath propagation also affects the transmission and cause fluctuation of signal strength leading to breakage of an active link [12.Justus Ch. Fricke,, 2007] Forward Error Correction (FEC) channel coding is used in digital transmission system for error correcting provides reliable information that can be retrieved from the soft outputs of the channel decoder. Figure 3 depicts the transfer of required data to compute the metric to establish the route. In our approach of cross layer design along with link SNR, fading effect and FEC role is also accounted to find a stable routes.
Route discovery in CL-DSR

Route discovery consists of link metric computations to decide on the stability, quality of the link to prioritize the route. The components of the link metric is the link instability index contributed by the average bit error probability from the soft output decoder and path loss from the received signal strength.
Similar to DSR, the route discovery is initiated by the source only when it has to send data packets to the destination. The source node broadcasts a RREQ packet to its neighboring nodes. The receiving nodes of the RREQ packet will update the RREQ packet with its ID, next hop and link metric computed based on the CL-DSR rules. At the destination node populates its RREP packet with both metric and...


An Approach of Energy Efficient and Secure Data Transfer Using Multicast Routing Protocol in Ad Hoc Networks

585 words - 3 pages of wireless networks called ad-hoc networks. An ad-hoc networks have become increasingly relevant in recent year due to their potential applications in battlefield, military, and emergency disaster relief etc.,. It is a self-configuring network. And it consists of collection of autonomous mobile nodes formed by topology without use of any existing infrastructure. Each mobile node serve as router or hosts in network. The mobile nodes communicate

An approach of Energy Efficient and secure data transfer using multicast routing protocol in Ad Hoc Networks

946 words - 4 pages neighbor node: Multicast routing protocol consists of unremitting sending the message from source to multiple destinations. It is used in ad-hoc networks. And this multicast routing protocol is efficient way to increase the lifetime of nodes. The nodes will communicate with each other. So, each node should identify the neighbor node for communication within the network or outside the radio range. Hence we introduce distance method to calculate

Ad Hoc Routing Protocols

1903 words - 8 pages routing protocols designed for ad hoc networks. The two broad classifications of ad hoc routing protocols are Table-Driven protocols and Source-Driven (demand-driven) protocols. Table Driven Routing Protocols Table-Driven routing protocols maintain current live routing information from the node to all other nodes in the network. The nodes manage multiple routing tables so that they can they can promptly respond to the constant topology changes, update

Wireless Mobile Ad Hoc Mobile Networks Help Security

1502 words - 7 pages trying to satisfy both of them can be very difficult because such a process can be easily abused or disrupted by adversarial nodes. Neighbor discovery is an important part of many protocols for mobile ad hoc networks, including localization and routing. Communications and protocols performance will depreciate, when neighbor discovery fails. In this paper, we address this open issue by proposing secure and efficient neighbor discovery with respect

A Cross-Layer Adaptive Modulation and Coding Scheme for realistic OFDMA-based Systems

2615 words - 10 pages A Cross-Layer Adaptive Modulation and Coding Scheme for realistic OFDMA-based Systems Abstract—In this letter, we investigate Adaptive Modulation and Coding schemes (AMC) in fast mobility environment with realistic conditions. We argue that feedback Channel State Information (CSI) are outdated and suffer estimation errors for most mobile channels especially fast users. Therefore, ignoring such conditions in AMC scheme design can be

Energy Efficient Mobile Ad Hoc Network (MANET)

2553 words - 10 pages 1. INTRODUCTION A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less network of mobile devices connected by wireless. In a MANET each and every node is free to move in any direction, and hence change its links to other nodes frequently. All the nodes cooperatively maintain network connectivity without the aid of any fixed infrastructure units. Each node has a routing function whereby it communicates by forwarding packets

Wirelenss Mobile Networks: Design and Performance

754 words - 4 pages access points are deployed to the zones to compose wireless mesh networks. A wireless mesh network is a type of wireless ad hoc network which consists of mesh routers and mesh clients. Mesh routers are usually stationary and they form the backbone of the WMNs, while serving as access points for mesh clients, which can be stationary or mobile. Some of the routers act as Internet gateways to provide Internet access to the clients in the WMN

Mobile Ad Hoc Network Temporarily Forms a Network without Support

1538 words - 7 pages quickly in the routing zone. Example:ZRP(zone routing protocol). 1. Ad-Hoc on-Demand Distance Vector (AODV) AODV utilises sequence numbers and routing beacons from DSDV but performs route discovery using on-demand route requests (RREQ); the same process as the DSR protocol [17]. AODV is different to DSR in that it uses distance vector routing; this requires every node in the route to maintain a temporary routing table for the duration of the

Enhancing Similarity Based Query Searching Performance Using Self Organized Semantic Overlay Networks

1103 words - 5 pages Zhao “SSW: A Small-World-Based Overlay for Peer-to-Peer Search” IEEE Transactions on Knowledge and Data Engineering, Volume: 23 Issue 3, 2011 [2] Anusuya.R1, Dr.Kavitha.V2, Mrs. Golden Julie.E3” Enhancing and Analyzing Search performance in Unstructured Peer to Peer Networks Using Enhanced Guided search protocol(EGSP)” Proceedings of the International Journal of Computation in Volume 2, Issue 6, pp., 198-210, June 2010, [5] Chonggang Wang, Bo

Backpressure Based Adaptive Routing and Scheduling In Delay Tolerant Network

728 words - 3 pages encounter-based mobile networks which are already delay-limited due to the sparse and highly dynamic network connectivity. Such networks have proposed the use of redundant transmissions to improve delay, which do not work well when the traffic load is high. Routing protocol, such as Spray and Wait, that advocate the use of redundant transmissions, to make additional copies of the communicated information in the network. The replication of the content

Design for Mobile Applications

984 words - 4 pages made is settings for bigger text. Some people don’t read in small print but they made a way to make everyone comfortable. Technology is at a good pace now hopefully the future would be even better. Works Cited • Landry, James A., and Todd R. Kauffman. "User Interface Issues in Mobile Computing." N.p., n.d. Web. . • Chapman, Callum. "Design Shack - Web Design Gallery, Articles & Community." 5 Important Lessons I’ve Learned About Mobile App

Similar Essays

Routing Protocols For Ad Hoc Mobile Networks

2227 words - 9 pages rerouting mechanisms. Moreover multi-hop ad hoc networks require every node to behave as router and packet forwarder. Therefore the routing protocols to be considered for such networks have to keep into consideration the bandwidth and power consumption at the mobile nodes. This paper will discuss the some routing protocols designed for ad hoc networks [4]. The two broad classifications of ad hoc routing protocols are Table-Driven protocols and

Sharp: A Joint Spectrum Allocation, Handover And Routing Protocol For Cognitive Radio Ad Hoc Networks

794 words - 4 pages algorithm must be developed to consider all possible interactions between PUs and SUs. In order to address above-mentioned challenges, this paper proposes a joint cross layer resource management consisting from spectrum allocation, handover and CR routing protocol for ad hoc networks (SHARP) that specifically addresses the performance concerns of CR communication over end-to-end path, and the problem of securing the PU communications from the interference generated by SUs specially when they are acting under limited knowledge of the environment and complex and highly stochastic behavior of the multipath fading channel. Our main contributions can be summarized as follows:

Sharp: A Joint Spectrum Allocation, Handover And Routing Protocol For Cognitive Radio Ad Hoc Networks

1647 words - 7 pages • Mobility • Agility In the reactive routing algorithms proposed for adhoc multi-hop networks, hop-count and ETX are key measures for route selection in DSR and AODV algorithms [??]. The expected number of transmissions (ETX) required for achieving success is a commonly used metric for routing in wireless multi-hop, ad¬hoc networks, especially when they suffer from instability in link quality [9, 38, 4, 15]. The ETX is based on measuring the loss

Mobile And Wireless Communication: Mobile Ad Hoc Networks

2437 words - 10 pages digital assistants, smart phones, digital cameras, tablet PCs, MP3 players and many more. All these are driving a new alternative method for mobile communication in which the devices can develop a self-organising, automatic and administering wireless network termed as Mobile Ad Hoc network. Unlike the traditional infrastructure wireless networks, where every user have to communicate directly with a fix access point or base station, in a Mobile Ad