Showing papers on "Link-state routing protocol published in 2011"
TL;DR: A taxonomy of the ad hoc routing protocols is created to uncover the requirements considered by the different protocols, the resource limitations under which they operate, and the design decisions made by the authors.
554 citations
TL;DR: An extensive survey of protocols developed according to the principles of swarm intelligence, taking inspiration from the foraging behaviors of ant and bee colonies, and introduces a novel taxonomy for routing protocols in wireless sensor networks.
370 citations
30 Aug 2011
TL;DR: This work proposes an architecture that integrates OpenFlow with WMNs and provides such flow-based routing and forwarding capabilities and implemented a simple solution to solve the problem of client mobility in a WMN which handles the fast migration of client addresses.
Abstract: everal protocols for routing and forwarding in Wireless Mesh Networks (WMN) have been proposed, such as AODV, OLSR or B.A.T.M.A.N. However, providing support for e.g. flow-based routing where flows of one source take different paths through the network is hard to implement in a unified way using traditional routing protocols. OpenFlow is an emerging technology which makes network elements such as routers or switches programmable via a standardized interface. By using virtualization and flow-based routing, OpenFlow enables a rapid deployment of novel packet forwarding and routing algorithms, focusing on fixed networks. We propose an architecture that integrates OpenFlow with WMNs and provides such flow-based routing and forwarding capabilities. To demonstrate the feasibility of our OpenFlow based approach, we have implemented a simple solution to solve the problem of client mobility in a WMN which handles the fast migration of client addresses (e.g. IP addresses) between Mesh Access Points and the interaction with re-routing without the need for tunneling. Measurements from a real mesh testbed (KAUMesh) demonstrate the feasibility of our approach based on the evaluation of forwarding performance, control traffic and rule activation time.
311 citations
01 May 2011
TL;DR: This work provides an extensive overview of the research in the field of routing for CRNs, clearly differentiating two main categories: approaches based on a full spectrum knowledge, and approaches that consider only local spectrum knowledge obtained via distributed procedures and protocols.
Abstract: Cognitive radio networks (CRNs) are composed of cognitive, spectrum-agile devices capable of changing their configurations on the fly based on the spectral environment. This capability opens up the possibility of designing flexible and dynamic spectrum access strategies with the purpose of opportunistically reusing portions of the spectrum temporarily vacated by licensed primary users. On the other hand, the flexibility in the spectrum access phase comes with an increased complexity in the design of communication protocols at different layers. This work focuses on the problem of designing effective routing solutions for multi-hop CRNs, which is a focal issue to fully unleash the potentials of the cognitive networking paradigm. We provide an extensive overview of the research in the field of routing for CRNs, clearly differentiating two main categories: approaches based on a full spectrum knowledge, and approaches that consider only local spectrum knowledge obtained via distributed procedures and protocols. In each category we describe and comment on proposed design methodologies, routing metrics and practical implementation issues. Finally, possible future research directions are also proposed.
305 citations
TL;DR: The main purpose of this study is to address the issues like data forwarding, deployment and localization in UWSNs under different conditions, and presents a review and comparison of different algorithms proposed recently in order to fulfill this requirement.
305 citations
TL;DR: This paper designs an Energy-Balanced Routing Protocol (EBRP) by constructing a mixed virtual potential field in terms of depth, energy density, and residual energy and shows significant improvements in energy balance, network lifetime, coverage ratio, and throughput as compared to the commonly used energy-efficient routing algorithm.
Abstract: Energy is an extremely critical resource for battery-powered wireless sensor networks (WSN), thus making energy-efficient protocol design a key challenging problem. Most of the existing energy-efficient routing protocols always forward packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of residual energy among sensor nodes, and eventually results in a network partition. In this paper, with the help of the concept of potential in physics, we design an Energy-Balanced Routing Protocol (EBRP) by constructing a mixed virtual potential field in terms of depth, energy density, and residual energy. The goal of this basic approach is to force packets to move toward the sink through the dense energy area so as to protect the nodes with relatively low residual energy. To address the routing loop problem emerging in this basic algorithm, enhanced mechanisms are proposed to detect and eliminate loops. The basic algorithm and loop elimination mechanism are first validated through extensive simulation experiments. Finally, the integrated performance of the full potential-based energy-balanced routing algorithm is evaluated through numerous simulations in a random deployed network running event-driven applications, the impact of the parameters on the performance is examined and guidelines for parameter settings are summarized. Our experimental results show that there are significant improvements in energy balance, network lifetime, coverage ratio, and throughput as compared to the commonly used energy-efficient routing algorithm.
233 citations
10 Apr 2011
TL;DR: SANE is the first forwarding mechanism that combines the advantages of both social-aware and stateless approaches in pocket switched network routing, based on the observation that individuals with similar interests tend to meet more often.
Abstract: In this paper we describe SANE, the first forwarding mechanism that combines the advantages of both social-aware and stateless approaches in pocket switched network routing. SANE is based on the observation“that we validate on real-world traces”that individuals with similar interests tend to meet more often. In our approach, individuals (network members) are characterized by their interest profile, a compact representation of their interests. Through extensive experiments, we show the superiority of social-aware, stateless forwarding over existing stateful, social-aware and stateless, social-oblivious forwarding. An important byproduct of our interest-based approach is that it easily enables innovative routing primitives, such as interest-casting. An interest-casting protocol is also described, and extensively evaluated through experiments based on both real-world and synthetic mobility traces.
212 citations
TL;DR: This paper presents a class of routing protocols for vehicular ad hoc networks (VANETs) called the Intersection-based Geographical Routing Protocol (IGRP), which outperforms existing routing schemes in city environments and significantly improves VANET performance when compared with several prominent routing protocols, such as greedy perimeter stateless routing (GPSR), greedy perimeter coordinator routing ( GPCR), and optimized link-state routing (OLSR).
Abstract: This paper presents a class of routing protocols for vehicular ad hoc networks (VANETs) called the Intersection-based Geographical Routing Protocol (IGRP), which outperforms existing routing schemes in city environments. IGRP is based on an effective selection of road intersections through which a packet must pass to reach the gateway to the Internet. The selection is made in a way that guarantees, with high probability, network connectivity among the road intersections while satisfying quality-of-service (QoS) constraints on tolerable delay, bandwidth usage, and error rate. Geographical forwarding is used to transfer packets between any two intersections on the path, reducing the path's sensitivity to individual node movements. To achieve this, we mathematically formulate the QoS routing problem as a constrained optimization problem. Specifically, analytical expressions for the connectivity probability, end-to-end delay, hop count, and bit error rate (BER) of a route in a two-way road scenario are derived. Then, we propose a genetic algorithm to solve the optimization problem. Numerical and simulation results show that the proposed approach gives optimal or near-optimal solutions and significantly improves VANET performance when compared with several prominent routing protocols, such as greedy perimeter stateless routing (GPSR), greedy perimeter coordinator routing (GPCR), and optimized link-state routing (OLSR).
205 citations
01 Jan 2011
TL;DR: The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints.
Abstract: Multipath routing protocols for Mobile Ad hoc NETwork (MANET) address the problem of scalability, security (confidentiality and integrity), lifetime of networks, instability of wireless transmissions, and their adaptation to applications. Our protocol, called MultiPath OLSR (MP-OLSR), is a multipath routing protocol based on OLSR [1]. The Multipath Dijkstra Algorithm is proposed to obtain multiple paths. The algorithm gains great flexibility and extensibility by employing different link metrics and cost functions. In addition, route recovery and loop detection are implemented in MP-OLSR in order to improve quality of service regarding OLSR. The backward compatibility with OLSR based on IP source routing is also studied. Simulation based on Qualnet simulator is performed in different scenarios. A testbed is also set up to validate the protocol in real world. The results reveal that MP-OLSR is suitable for mobile, large and dense networks with large traffic, and could satisfy critical multimedia applications with high on time constraints.
187 citations
04 Jun 2011
TL;DR: This work designs a novel low-cost congestion propagation network that leverages both local and non-local network information for more accurate congestion estimates and offers effective adaptivity for congestion beyond neighboring nodes, and proposes Destination-Based Adaptive Routing (DBAR).
Abstract: With the emergence of many-core architectures, it is quite likely that multiple applications will run concurrently on a system. Existing locally and globally adaptive routing algorithms largely overlook issues associated with workload consolidation. The shortsightedness of locally adaptive routing algorithms limits performance due to poor network congestion avoidance. Globally adaptive routing algorithms attack this issue by introducing a congestion propagation network to obtain network status information beyond neighboring nodes. However, they may suffer from intra- and inter-application interference during output port selection for consolidated workloads, coupling the behavior of otherwise independent applications and negatively affecting performance. To address these two issues, we propose Destination-Based Adaptive Routing (DBAR). We design a novel low-cost congestion propagation network that leverages both local and non-local network information for more accurate congestion estimates. Thus, DBAR offers effective adaptivity for congestion beyond neighboring nodes. More importantly, by integrating the destination into the selection function, DBAR mitigates intra- and inter-application interference and offers dynamic isolation among regions. Experimental results show that DBAR can offer better performance than the best baseline algorithm for all measured configurations; it is well suited for workload consolidation. The wiring overhead of DBAR is low and DBAR provides improvement in the energy-delay product for medium and high injection rates.
183 citations
TL;DR: This article surveys this paradigm shift for routing in WSNs and follows a rather chronological organization within the given protocol taxonomy, sheds some light on the design choices of emerging IETF ROLL protocols and provides design parameters of interest to the WSN engineer, essentially enabling the design and implementation of more reliable and efficient WSN solutions.
Abstract: In large networks, a data source may not reach the intended sink in a single hop, thereby requiring the traffic to be routed via multiple hops. An optimized choice of such routing path is known to significantly increase the performance of said networks. This holds particularly true for wireless sensor networks (WSNs) consisting of a large amount of miniaturized battery-powered wireless networked sensors required to operate for years with no human intervention. There has hence been a growing interest on understanding and optimizing WSN routing and networking protocols in recent years, where the limited and constrained resources have driven research towards primarily reducing energy consumption, memory requirements and complexity of routing functionalities. To this end, early flooding-based and hierarchical protocols have migrated within the past decade to geographic and self-organizing coordinate-based routing solutions. The former have been brought to standardization through the Internet Engineering Task Force (IETF) Mobile Ad-hoc Networks (MANET) working group; the latter are currently finding their way into standardization through the IETF Routing Over Low power and Lossy networks (ROLL) working group. This article thus surveys this paradigm shift for routing in WSNs and, unlike previous milestone surveys, follows a rather chronological organization within the given protocol taxonomy. For each protocol family, we provide a didactic presentation of the basic concept, a discussion on the enhancements and variants on that concept, and a detailed description of the latest state-of-the-art protocols of that family. We believe that this organization sheds some light on the design choices of emerging IETF ROLL protocols and also provides design parameters of interest to the WSN engineer, essentially enabling the design and implementation of more reliable and efficient WSN solutions.
Patent•
08 Aug 2011
TL;DR: In this paper, the authors propose a set of low overhead mechanisms to enable on-demand routing protocols using route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken.
Abstract: Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.
TL;DR: An evolutionary-based routing protocol is proposed, which can guarantee better tradeoff between the lifespan and the stability period of the network with efficient energy utilization and can provide more robust results than the existing heuristic and meta-heuristic protocols in terms of network stability period, lifetime, and energy consumption.
Abstract: The main challenges in designing and planning the operations of Wireless Sensor Networks (WSNs) are to optimize energy consumption and prolong network lifetime. Cluster-based routing techniques, such as the well-known low-energy adaptive clustering hierarchy (LEACH), are used to achieve scalable solutions and extend the network lifetime until the last node dies (LND). Also, evolutionary algorithms (EAs), have been successfully used in recent years as meta-heuristics to address energy-aware routing challenges by designing intelligent models that collaborate together to optimize an appropriate energy-aware objective function. On the other hand, some protocols, such as stable election protocol (SEP), are concerned with another objective: extending the stability time until the first node dies (FND). Often, there is a tradeoff between extending the time until FND and the time until LND. To our knowledge, no attempt has been made to obtain a better compromise between the stability time and network lifetime. This paper reformulates the design of the most important characteristic of the EA (i.e., the objective function), so as to obtain a routing protocol that can provide more robust results than the existing heuristic and meta-heuristic protocols in terms of network stability period, lifetime, and energy consumption. An evolutionary-based routing protocol is proposed, which can guarantee better tradeoff between the lifespan and the stability period of the network with efficient energy utilization. To support this claim, extensive simulations on 90 homogeneous and heterogeneous WSN models are evaluated and compared against the LEACH, SEP, and one of the existing evolutionary-based routing protocols, hierarchical clustering-algorithm-based genetic algorithm (HCR).
TL;DR: This paper proposes a multipath routing scheme whose goal is to combine fast re-routing and load balancing loop-free routes and achieves a good tradeoff between path diversity and overhead.
TL;DR: Insight is provided into routing protocols designed specifically for large-scale WSNs based on the hierarchical structure and a comparison of each routing protocol is conducted to demonstrate the differences between the protocols.
Abstract: With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. “Large-scale” means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner and other metrics. Finally some open issues in routing protocol design in large-scale wireless sensor networks and conclusions are proposed.
01 Jan 2011
TL;DR: This paper presents the traces of communication between different mobile nodes using Routing Protocols in MANETs and analyzes the simulation results by graphical manner and trace file based on QoS metrics such as Throughput, Drop, Delay, Jitter etc.
Abstract: A Mobile Ad Hoc Networks (MANETs) is a group of mobile nodes which cooperate in forwarding packets in a multi-hop fashion without any centralized administration. One of its key challenges is routing. Many routing protocols for MANET have been proposed and the protocols can be classified as proactive routing and on demand routing protocols. This paper uses ns-2 as the simulation tool, 802.11 as the wireless MAC protocol, and AODV & DSDV as the routing protocol. We present the traces of communication between different mobile nodes using Routing Protocols in MANETs. To compare the performance of Proactive and Reactive routing protocol, we have to analyze the simulation results by graphical manner and trace file based on QoS metrics such as Throughput, Drop, Delay, Jitter etc. Here, we have analyzed the simulation result by traces files only. The performance differentials have been analyzed based on network load, mobility, and network size. INDEX TERMS DSDV, AODV, MANET, QoS, Network Simulator-2 (NS2).
13 Apr 2011
TL;DR: A performance analysis of RPL shows that RPL can ensure a very fast network set-up, thus allowing the development of advanced monitoring applications also in critical conditions and finds that further research is required to optimize the RPL signaling in order to decrease the protocol overhead.
Abstract: The IETF Routing Over Low-power and Lossy Networks working group has recently proposed the IPv6 Routing Protocol for Low power and Lossy Networks, i.e., the RPL protocol. It has been designed to face the typical requirements of wireless sensor networks. Given its relevance in the industrial and scientific communities, this paper presents a performance analysis of RPL based on simulations. Our results clearly show that RPL can ensure a very fast network set-up, thus allowing the development of advanced monitoring applications also in critical conditions. On the other hand, we found that further research is required to optimize the RPL signaling in order to decrease the protocol overhead.
TL;DR: This paper proposes a new link-state routing protocol, PEFT, that splits traffic over multiple paths with an exponential penalty on longer paths and provably achieves optimal traffic engineering while retaining the simplicity of hop-by-hop forwarding.
Abstract: This paper settles an open question with a positive answer: Optimal traffic engineering (or optimal multicommodity flow) can be realized using just link-state routing protocols with hop-by-hop forwarding. Today's typical versions of these protocols, Open Shortest Path First (OSPF) and Intermediate System-Intermediate System (IS-IS), split traffic evenly over shortest paths based on link weights. However, optimizing the link weights for OSPF/IS-IS to the offered traffic is a well-known NP-hard problem, and even the best setting of the weights can deviate significantly from an optimal distribution of the traffic. In this paper, we propose a new link-state routing protocol, PEFT, that splits traffic over multiple paths with an exponential penalty on longer paths. Unlike its predecessor, DEFT, our new protocol provably achieves optimal traffic engineering while retaining the simplicity of hop-by-hop forwarding. The new protocol also leads to a significant reduction in the time needed to compute the best link weights. Both the protocol and the computational methods are developed in a conceptual framework, called Network Entropy Maximization, that is used to identify the traffic distributions that are not only optimal, but also realizable by link-state routing.
TL;DR: A data-centric multiobjective QoS-Aware routing protocol, called DMQoS, is proposed, which facilitates the system to achieve customized QoS services for each traffic category differentiated according to the generated data types.
Abstract: In this paper, we address Quality-of-Service (QoS)-aware routing issue for Body Sensor Networks (BSNs) in delay and reliability domains. We propose a data-centric multiobjective QoS-Aware routing protocol, called DMQoS, which facilitates the system to achieve customized QoS services for each traffic category differentiated according to the generated data types. It uses modular design architecture wherein different units operate in coordination to provide multiple QoS services. Their operation exploits geographic locations and QoS performance of the neighbor nodes and implements a localized hop-by-hop routing. Moreover, the protocol ensures (almost) a homogeneous energy dissipation rate for all routing nodes in the network through a multiobjective Lexicographic Optimization-based geographic forwarding. We have performed extensive simulations of the proposed protocol, and the results show that DMQoS has significant performance improvements over several state-of-the-art approaches.
Posted Content•
TL;DR: The paper discusses the advantages / disadvantages and the applications of various routing protocols for vehicular ad hoc networks, and explores the motivation behind the designed, and traces the evolution of these routing protocols.
Abstract: Vehicular Ad Hoc Networks (VANET) is a subclass of Mobile ad hoc networks which provides a distinguished approach for Intelligent Transport System (ITS) The survey of routing protocols in VANET is important and necessary for smart ITS T his paper discusses the advantages / disadvantages and the applications of various routing protocols for vehicular ad hoc networks It explores the motivation behind the designed, and traces the evolution of these routing protocols F inally the paper concludes by a tabular comparison of the various routing protocols for VANET
15 Jun 2011
TL;DR: This simulative study aims to determine the performance of current MANET routing protocols with respect to various mobility models implemented in ns-2 and compares a number of reactive and proactive routing protocols including AODV, DSR, DSDV, OLSR and DYMO.
Abstract: The fundamental characteristic which differentiates MANETs from other wireless or wired networks is mobility. Therefore, MANET routing protocols are designed to adaptively cater for dynamic changes in topology while maximizing throughput and packet delivery ratio, and minimizing delay, routing load and energy consumption. A major design issue for an efficient and effective routing protocol for real MANETs is, therefore, to achieve optimum values of performance parameters under network scenarios where nodes are subjected to different types of mobility that dynamically change the network topology. Our simulative study on MANET routing protocols and mobility models aims to determine the performance of current MANET routing protocols with respect to various mobility models implemented in ns-2. We compare a number of reactive and proactive routing protocols including AODV, DSR, DSDV, OLSR and DYMO. The results of our extensive network simulations are tabulated along with a comprehensive analysis. The effort allows a fair comparison of the capabilities and limitations of different types of mobility patterns and their suitability for contemporary MANET routing protocols.
01 Jan 2011
TL;DR: The 2ACK scheme is proposed that serves as an add-on technique for routing schemes to detect routing misbehavior and to mitigate their effect.
Abstract: We are considering the Routing misbehavior in MANETs (Mobile Ad Hoc Networks). Routing protocols for MANETs are based on the assumption which are, all participating nodes are fully cooperative. But, due to the open structure node misbehaviors may exist. One such routing misbehavior is that some nodes will take part in the route discovery and maintenance processes but refuse to forward data packets. In this, we propose the 2ACK scheme that serves as an add-on technique for routing schemes to detect routing misbehavior and to mitigate their effect. The basic idea of the 2ACK scheme is to send two-hop acknowledgment packets in the opposite direction of the routing path. To reduce extra routing overhead, only a few of the received data packets are acknowledged in the 2ACK scheme.
TL;DR: A geographical routing algorithm called location-aware routing for delay-tolerant networks (LAROD), enhanced with a location service, location dissemination service (LoDiS), which together are shown to suit an intermittently connected MANET (IC-MANET).
Abstract: Combining mobile platforms such as manned or unmanned vehicles and peer-assisted wireless communication is an enabler for a vast number of applications. A key enabler for the applications is the routing protocol that directs the packets in the network. Routing packets in fully connected mobile ad hoc networks (MANETs) has been studied to a great extent, but the assumption on full connectivity is generally not valid in a real system. This case means that a practical routing protocol must handle intermittent connectivity and the absence of end-to-end connections. In this paper, we propose a geographical routing algorithm called location-aware routing for delay-tolerant networks (LAROD), enhanced with a location service, location dissemination service (LoDiS), which together are shown to suit an intermittently connected MANET (IC-MANET). Because location dissemination takes time in IC-MANETs, LAROD is designed to route packets with only partial knowledge of geographic position. To achieve low overhead, LAROD uses a beaconless strategy combined with a position-based resolution of bids when forwarding packets. LoDiS maintains a local database of node locations, which is updated using broadcast gossip combined with routing overhearing. The algorithms are evaluated under a realistic application, i.e., unmanned aerial vehicles deployed in a reconnaissance scenario, using the low-level packet simulator ns-2. The novelty of this paper is the illustration of sound design choices in a realistic application, with holistic choices in routing, location management, and the mobility model. This holistic approach justifies that the choice of maintaining a local database of node locations is both essential and feasible. The LAROD-LoDiS scheme is compared with a leading delay-tolerant routing algorithm (spray and wait) and is shown to have a competitive edge, both in terms of delivery ratio and overhead. For spray and wait, this case involved a new packet-level implementation in ns-2 as opposed to the original connection-level custom simulator.
TL;DR: This paper shows that the minimum energy routing schemes in the literature could fail without considering the routing overhead involved and node mobility, and proposes a more accurate analytical model to track the energy consumptions due to various factors and a simple energy-efficient routing scheme PEER to improve the performance during path discovery and in mobility scenarios.
Abstract: Many minimum energy (energy-efficient) routing protocols have been proposed in recent years. However, very limited effort has been made in studying routing overhead, route setup time, and route maintenance issues associated with these protocols. Without a careful design, an energy-efficient routing protocol can perform much worse than a normal routing protocol. In this paper, we first show that the minimum energy routing schemes in the literature could fail without considering the routing overhead involved and node mobility. We then propose a more accurate analytical model to track the energy consumptions due to various factors, and a simple energy-efficient routing scheme PEER to improve the performance during path discovery and in mobility scenarios. Our simulation results indicate that compared to a conventional energy-efficient routing protocol, PEER protocol can reduce up to 2/3 path discovery overhead and delay, and 50 percent transmission energy consumption.
Patent•
23 Nov 2011TL;DR: In this article, an algorithm integrating a modified S-MAC (an algorithm for medium access control) protocol for decreasing energy usage in operating the node and associated sensors is presented. And a routing protocol is further integrated into the algorithm, the routing protocol being based upon CH rotation.
Abstract: The wireless sensor network with energy efficient protocols includes a network of external sensors in communication with a data sink. The network utilizes an algorithm integrating a modified S-MAC (an algorithm for medium access control) protocol for decreasing energy usage in operating the node and associated sensors. A routing protocol is further integrated into the algorithm, the routing protocol being based upon cluster head rotation.
10 Apr 2011
TL;DR: This work proposes a novel approach for mobile users to collect the network-wide data by only performing a local modification to update the routing structure while the routing performance is bounded and controlled compared to the optimal performance.
Abstract: We study the ubiquitous data collection for mobile users in wireless sensor networks. People with handheld devices can easily interact with the network and collect data. We propose a novel approach for mobile users to collect the network-wide data. The routing structure of data collection is additively updated with the movement of the mobile user. With this approach, we only perform a local modification to update the routing structure while the routing performance is bounded and controlled compared to the optimal performance. The proposed protocol is easy to implement. Our analysis shows that the proposed approach is scalable in maintenance overheads, performs efficiently in the routing performance, and provides continuous data delivery during the user movement. We implement the proposed protocol in a prototype system and test its feasibility and applicability by a 49-node testbed. We further conduct extensive simulations to examine the efficiency and scalability of our protocol with varied network settings.
TL;DR: An overview of a wide range of the existing routing protocols with a particular focus on their characteristics and functionality is provided and the comparison is provided based on the routing methodologies and information used to make routing decisions.
Abstract: In recent years, a vast research has been seen going on in the field of Mobile Ad Hoc Networks (MANETs). Due to limited resources in MANETs, to design an efficient and reliable routing strategy is still a challenge. An intelligent routing strategy is required to efficiently use the limited resources. Also the algorithms designed for traditional wired networks such as link-state or distance vector, does not scale well in wireless environment. Routing in MANETs is a challenging task and has received a tremendous amount of attention from researchers around the world. To overcome this problem a number of routing protocols have been developed and the number is still increasing day by day. It is quite difficult to determine which protocols may perform well under a number of different network scenarios such as network size and topology etc. In this paper we provide an overview of a wide range of the existing routing protocols with a particular focus on their characteristics and functionality. Also, the comparison is provided based on the routing methodologies and information used to make routing decisions. The performance of all the routing protocols is also discussed. Further this study will help the researchers to get an overview of the existing protocols and suggest which protocols may perform better with respect to varying network scenarios.
01 Jan 2011
TL;DR: Most of the routing protocols reported in the available literature are critically analyzed to help in having a wider understanding of the problem domain and can be used to develop or some new or to extend already proposed schemes.
Abstract: Routing is a challenging issue in mobile ad-hoc network. Concerning routing various solutions have been reported. In this context, only few of the proposed solutions are commonly evaluated and less attention has been paid to mention some other schemes. The contribution of this paper is to critically analyze most of the routing protocols which are reported in the available literature. This will help in having a wider understanding of the problem domain and can also be used to develop or some new or to extend already proposed schemes.
01 Mar 2011
TL;DR: The proposed connectivity-aware minimum-delay geographic routing protocol for vehicular ad hoc networks (VANETs), which adapts well to continuously changing network status in such networks, is compared with two plausible geographic connectivity- aware routing protocols for VANets, A-STAR and VADD.
Abstract: In this paper, we propose the connectivity-aware minimum-delay geographic routing (CMGR) protocol for vehicular ad hoc networks (VANETs), which adapts well to continuously changing network status in such networks. When the network is sparse, CMGR takes the connectivity of routes into consideration in its route selection logic to maximize the chance of packet reception. On the other hand, in situations with dense network nodes, CMGR determines the routes with adequate connectivity and selects among them the route with the minimum delay. The performance limitations of CMGR in special vehicular networking situations are studied and addressed. These situations, which include the case where the target vehicle has moved away from its expected location and the case where traffic in a road junction is so sparse that no next-hop vehicle can be found on the intended out-going road, are also problematic in most routing protocols for VANETs. Finally, the proposed protocol is compared with two plausible geographic connectivity-aware routing protocols for VANETs, A-STAR and VADD. The obtained results show that CMGR outperforms A-STAR and VADD in terms of both packet delivery ratio and ratio of dropped data packets. For example, under the specific conditions considered in the simulations, when the maximum allowable one-way transmission delay is 1min and one gateway is deployed in the network, the packet delivery ratio of CMGR is approximately 25% better than VADD and A-STAR for high vehicle densities and goes up to 900% better for low vehicle densities.
Posted Content•
TL;DR: This paper has attempted to present an overview of the routing protocols, the known routing attacks and the proposed countermeasures to these attacks in various works.
Abstract: Mobile ad hoc networks (MANETs) are a set of mobile nodes which are self-configuring and connected by wireless links automatically as per the defined routing protocol. The absence of a central management agency or a fixed infrastructure is a key feature of MANETs. These nodes communicate with each other by interchange of packets, which for those nodes not in wireless range goes hop by hop. Due to lack of a defined central authority, securitizing the routing process becomes a challenging task thereby leaving MANETs vulnerable to attacks, which results in deterioration in the performance characteristics as well as raises a serious question mark about the reliability of such networks. In this paper we have attempted to present an overview of the routing protocols, the known routing attacks and the proposed countermeasures to these attacks in various works. —————————— ——————————