scispace - formally typeset
Search or ask a question

Showing papers on "Optimized Link State Routing Protocol published in 2014"


Journal ArticleDOI
TL;DR: This article discusses the evolution of the multihop ad hoc networking paradigm by building on the lessons learned from the IETF MANET research, and analyzes four successful networking paradigms, mesh, sensor, opportunistic, and vehicular networks, that emerged from the MANET world as a more pragmatic application.
Abstract: In this article we discuss the state of the art of (mobile) multihop ad hoc networking. This paradigm has often been identified with the solutions developed inside the IETF MANET working group, and for this reason it is called the MANET paradigm. However, they do not coincide, and in the last decade they clearly diverged. In this article, we start from the reasons why the MANET paradigm did not have a major impact on computer communications, and we discuss the evolution of the multihop ad hoc networking paradigm by building on the lessons learned from the MANET research. Specifically, we analyze four successful networking paradigms, mesh, sensor, opportunistic, and vehicular networks, that emerged from the MANET world as a more pragmatic application of the multihop ad hoc networking paradigm. We also present the new research directions in the multihop ad hoc networking field: peoplecentric networking, triggered by the increasing penetration of the smartphones in everyday life, which is generating a people-centric revolution in computing and communications.

427 citations


Journal ArticleDOI
TL;DR: This paper provides a detailed description of various existing routing techniques in literature with an aim of selecting a particular strategy depending upon its applicability in a particular application.

260 citations


01 Apr 2014
TL;DR: In this paper, the Optimized Link State Routing Protocol (OLSRv2) for Mobile Ad Hoc Networks (MANETs) has been proposed for MANETs.
Abstract: This specification describes version 2 of the Optimized Link State Routing Protocol (OLSRv2) for Mobile Ad Hoc Networks (MANETs).

259 citations


Journal ArticleDOI
TL;DR: In this article, the authors discuss the main characteristics and the research challenge of routing in VANETs, which may be considered in designing various routing protocols, and create taxonomy of the current routing protocols for VANets, and surveyed and compared symbolized instances for all the classes of protocols.

231 citations


Journal ArticleDOI
TL;DR: A dynamic trust management protocol for secure routing optimization in DTN environments in the presence of well-behaved, selfish and malicious nodes is designed and validated and can effectively trade off message overhead and message delay for a significant gain in delivery ratio.
Abstract: Delay tolerant networks (DTNs) are characterized by high end-to-end latency, frequent disconnection, and opportunistic communication over unreliable wireless links. In this paper, we design and validate a dynamic trust management protocol for secure routing optimization in DTN environments in the presence of well-behaved, selfish and malicious nodes. We develop a novel model-based methodology for the analysis of our trust protocol and validate it via extensive simulation. Moreover, we address dynamic trust management, i.e., determining and applying the best operational settings at runtime in response to dynamically changing network conditions to minimize trust bias and to maximize the routing application performance. We perform a comparative analysis of our proposed routing protocol against Bayesian trust-based and non-trust based (PROPHET and epidemic) routing protocols. The results demonstrate that our protocol is able to deal with selfish behaviors and is resilient against trust-related attacks. Furthermore, our trust-based routing protocol can effectively trade off message overhead and message delay for a significant gain in delivery ratio. Our trust-based routing protocol operating under identified best settings outperforms Bayesian trust-based routing and PROPHET, and approaches the ideal performance of epidemic routing in delivery ratio and message delay without incurring high message or protocol maintenance overhead.

198 citations


Journal ArticleDOI
TL;DR: A general survey of multicast routing protocols in Mobile adhoc Networks (MANETs) is given, which plays an important role in MANETs to provide group communication.
Abstract: There are many benefits of multicasting using with network. The communication cost reduced by multicasting for applications that sends the same data to many recipients instead of sending via multiple unicast. This paper gives a general survey of multicast routing protocols in Mobile adhoc Networks (MANETs). The multicast routing protocols are divided into two categories- multicast routing based on application independence and multicast routing based on application dependence. Multicast routing protocols plays an important role in MANETs to provide group communication. Multicasting is one of the major communication technologies primarily designed for bandwidth conservation and an efficient way of transferring data to a group of receivers in wireless mesh networks.

173 citations


Journal ArticleDOI
Zhexiong Wei1, Helen Tang, F. Richard Yu1, Maoyu Wang, Peter C. Mason 
TL;DR: This paper proposes a unified trust management scheme that enhances the security in MANETs and shows that throughput and packet delivery ratio (PDR) can be improved significantly with slightly increased average end-to-end delay and overhead of messages.
Abstract: The distinctive features of mobile ad hoc net- works (MANETs), including dynamic topology and open wireless medium, may lead to MANETs suffering from many security vul- nerabilities. In this paper, using recent advances in uncertain rea- soning that originated from the artificial intelligence community, we propose a unified trust management scheme that enhances the security in MANETs. In the proposed trust management scheme, the trust model has two components: trust from direct observa- tion and trust from indirect observation. With direct observation from an observer node, the trust value is derived using Bayesian inference, which is a type of uncertain reasoning when the full probability model can be defined. On the other hand, with indirect observation, which is also called secondhand information that is obtained from neighbor nodes of the observer node, the trust value is derived using the Dempster-Shafer theory (DST), which is another type of uncertain reasoning when the proposition of interest can be derived by an indirect method. By combining these two components in the trust model, we can obtain more accurate trust values of the observed nodes in MANETs. We then evaluate our scheme under the scenario of MANET routing. Extensive simulation results show the effectiveness of the proposed scheme. Specifically, throughput and packet delivery ratio (PDR) can be improved significantly with slightly increased average end-to-end delay and overhead of messages.

164 citations


Proceedings ArticleDOI
27 May 2014
TL;DR: A realistic mobility model designed for UAV ad hoc networks is presented since evaluating the performances of ad hoc protocols is an important step in order to predict possible problems that can affect the system in the real environment.
Abstract: With the technological advances, there is an increasing attention on micro-UAVs in the military area as well as in the civilian domain. They are used as swarm (several UAVs) forming a UAS (Unmanned Aircraft System) since they are relatively cheap and offer better performance than one aircraft. The UAVs, in a UAS, have to exchange information with each other and with the control station in order to create a clear vision of the swarm situation and the task performance. This exchange is made possible by the application of an ad hoc network between UAVs which is a challenging issue because of the node mobility, the network topology change, and the operation communication requirements in term of quality of service (delay, throughput or loss rate for instance). This paper presents a realistic mobility model designed for UAV ad hoc networks. since evaluating the performances of ad hoc protocols is an important step in order to predict possible problems that can affect the system in the real environment. This mobility model behavior is compared to the well-known mobility model behavior Random-Way Point. It is also compared to real movements traces using several metrics.

140 citations


Proceedings ArticleDOI
10 Jun 2014
TL;DR: This work presents a feasible solution for improving the data packet delivery ratio in mobile UWSN by using the greedy opportunistic forwarding to route packets and to move void nodes to new depths to adjust the topology.
Abstract: Efficient protocols for data packet delivery in mobile underwater sensor networks (UWSNs) are crucial to the effective use of this new powerful technology for monitoring lakes, rivers, seas, and oceans. However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. In this work, we present a feasible solution for improving the data packet delivery ratio in mobile UWSN. The GEographic and opportunistic routing with Depth Adjustment-based topology control for communication Recovery (GEDAR) over void regions uses the greedy opportunistic forwarding to route packets and to move void nodes to new depths to adjust the topology. Simulation results shown that GEDAR outperforms the baseline solutions in terms of packet delivery ratio, latency and energy per message.

120 citations


Journal ArticleDOI
TL;DR: An integrative analysis of deterministic protocols via a generic framework is given and several representative protocols are presented, respectively, pointing out promising research directions towards energy-efficient neighbor discovery.
Abstract: Due to slow advance in battery technology, power remains a bottleneck to limit wide applications of mobile ad hoc and wireless sensor networks. Among all extensive studies on minimizing power consumption, neighbor discovery is one of the fundamental components focusing on communication and access. This work surveys research literature on neighbor discovery protocols (NDPs). In general, they can be roughly classified by four underlying principles: randomness, over-half occupation, rotation-resistant intersection, and coprime cycles. The Birthday protocols act as representatives of NDPs using randomness, in which a node decides to listen, transmit, or sleep with probabilities. The original idea of over-half occupation is to be active over at least half of each period, though several refinements have been proposed to decrease its high duty cycle. Methods of rotation-resistant intersection formulate the problem of discovery using combinatorial characteristics of discrete time slots, and guarantee discovery at least once per period. Moreover, neighbor discovery can also be guaranteed within a worst-case bound, as shown by methods adopting coprime cycles. In this paper, we elaborate on these ideas and present several representative protocols, respectively. In particular, we give an integrative analysis of deterministic protocols via a generic framework. A qualitative comparison incorporating multiple criteria and a quantitative evaluation on energy efficiency are also included. Finally, we point out promising research directions towards energy-efficient neighbor discovery.

118 citations


Journal ArticleDOI
TL;DR: This article first classify existing protocols based on different design criteria and then presents a survey of the state-of-the-art routing protocols in this area, illustrating how each of the protocols works, and discusses their advantages and disadvantages.
Abstract: Wireless sensor networks with mobile sinks, mWSNs, have attracted a lot of attention recently. This is because sink mobility can greatly alleviate the hotspot issue in WSNs and further prolong the network lifetime. However, sink mobility also causes unexpected changes in network topology and data routing paths, which can largely affect the routing performance in such networks. Design of efficient routing protocols for mWSNs has been a critical issue, and much work has been carried out in this aspect. In this article, we first classify existing protocols based on different design criteria and then present a survey of the state-of-the-art routing protocols in this area. We illustrate how each of the protocols works, and discuss their advantages and disadvantages. Finally, we point out some future directions for efficient routing in mWSNs.

Proceedings ArticleDOI
06 Mar 2014
TL;DR: This paper surveys a number of the recent analysis leads to routing space and presents various existing routing protocols with their merits and demerits.
Abstract: In recent years, rapid growth in the number of vehicles on the road has increased demands for communication on the move. A new kind of Ad hoc network with an immense improvement in technological innovations is emerging these days known as VANET (Vehicular ad hoc network). It is an assortment of vehicular nodes that act as mobile hosts establish a transient network without the assistance of any centralized administration or any established infrastructure. Therefore, it is called autonomous & self configured network. In VANET, two kinds of communication can be done to provide a list of applications like emergency vehicle warning, safety etc. These are between various vehicles known as vehicle to vehicle and between vehicles and roadside units known as vehicle to roadside communication. Performance of such kind of communication between vehicles depends on various routing protocols. We have a tendency to survey a number of the recent analysis leads to routing space. In the following sections we present various existing routing protocols with their merits and demerits.

Journal ArticleDOI
TL;DR: This paper proposes a novel game theoretic approach with multiple players for security in MANETs, which can enable an individual node in MANets to make strategic security defence decisions without centralized administration.
Abstract: Game theory can provide a useful tool to study the security problem in mobile ad hoc networks (MANETs). Most of existing works on applying game theories to security only consider two players in the security game model: an attacker and a defender. While this assumption may be valid for a network with centralized administration, it is not realistic in MANETs, where centralized administration is not available. In this paper, using recent advances in mean field game theory, we propose a novel game theoretic approach with multiple players for security in MANETs. The mean field game theory provides a powerful mathematical tool for problems with a large number of players. The proposed scheme can enable an individual node in MANETs to make strategic security defence decisions without centralized administration. In addition, since security defence mechanisms consume precious system resources (e.g., energy), the proposed scheme considers not only the security requirement of MANETs but also the system resources. Moreover, each node in the proposed scheme only needs to know its own state information and the aggregate effect of the other nodes in the MANET. Therefore, the proposed scheme is a fully distributed scheme. Simulation results are presented to illustrate the effectiveness of the proposed scheme.

Journal ArticleDOI
TL;DR: A stochastic microscopic mobility model that captures time variations of intervehicle distances and a discrete-time finite-state Markov chain with state-dependent transition probabilities is proposed to model the distance headway.
Abstract: A vehicular ad hoc network (VANET) is a promising addition to future intelligent transportation systems, which supports various safety and infotainment applications. The high node mobility and frequent topology changes in VANETs impose new challenges in maintaining a long-lasting connection between network nodes. As a result, the lifetime of communication links is a crucial issue in VANET development and operation. This paper presents a probabilistic analysis of the communication link in VANETs for three vehicle density ranges. First, the authors present the stationary distribution of the communication link length using mesoscopic mobility models. Second, the authors propose a stochastic microscopic mobility model that captures time variations of intervehicle distances (distance headways). A discrete-time finite-state Markov chain with state-dependent transition probabilities is proposed to model the distance headway. Third, the proposed stochastic microscopic model and first passage time analysis are used to derive the probability distribution of the communication link lifetime. Numerical results are presented to evaluate the proposed model, which demonstrate a close agreement between analytical and simulation results.

Journal ArticleDOI
TL;DR: RMECR is able to find energy-efficient and reliable routes similar to RMER, while also extending the operational lifetime of the network, which makes RMECR an elegant solution to increase energy-efficiency, reliability, and lifetime of wireless ad hoc networks.
Abstract: We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable minimum energy routing (RMER). RMECR addresses three important requirements of ad hoc networks: energy-efficiency, reliability, and prolonging network lifetime. It considers the energy consumption and the remaining battery energy of nodes as well as quality of links to find energy-efficient and reliable routes that increase the operational lifetime of the network. RMER, on the other hand, is an energy-efficient routing algorithm which finds routes minimizing the total energy required for end-to-end packet traversal. RMER and RMECR are proposed for networks in which either hop-by-hop or end-to-end retransmissions ensure reliability. Simulation studies show that RMECR is able to find energy-efficient and reliable routes similar to RMER, while also extending the operational lifetime of the network. This makes RMECR an elegant solution to increase energy-efficiency, reliability, and lifetime of wireless ad hoc networks. In the design of RMECR, we consider minute details such as energy consumed by processing elements of transceivers, limited number of retransmissions allowed per packet, packet sizes, and the impact of acknowledgment packets. This adds to the novelty of this work compared to the existing studies.

Journal ArticleDOI
TL;DR: A new implementation of the RPL standard for the Contiki operating system (OS) to improve data delivery reliability and to adopt a flexible cross-layering design that provides simple routing optimizations, enhanced link estimation capabilities, and efficient management of neighbor tables.
Abstract: The IPv6 routing protocol for low-power and lossy networks (RPL) has been recently standardized by the Internet Engineering Task Force (IETF) routing protocol for low-power and lossy networks (ROLL) working group to support IPv6 routing for resource-constrained devices in industrial, home, and urban environments. However, several studies have shown that RPL may experience (very) low delivery rates, particularly in large-scale deployments. In this paper, we provide an in-depth analysis of the protocol attributes and design choices that generate such unreliability issues. Then, we describe and evaluate a new implementation of the RPL standard for the Contiki operating system (OS) to improve data delivery reliability. The salient feature of our RPL implementation is to adopt a flexible cross-layering design that provides simple routing optimizations, enhanced link estimation capabilities, and efficient management of neighbor tables. In order to verify the effectiveness of our RPL implementation, we use an advanced metering infrastructure (AMI) as a case study. Results obtained using Cooja emulator in two sets of experiments, differentiated by the presence or lack of duty cycling, indicate that our RPL implementation outperforms the one provided in Contiki in terms of average packet delivery rates by up to 200% in networks with 100 nodes.

Journal ArticleDOI
TL;DR: This paper proposes efficient power aware routing (EPAR), a newPower aware routing protocol that increases the network lifetime of MANET and reduces for more than 20% the total energy consumption and decreases the mean delay, especially for high load networks, while achieving a good packet delivery ratio.
Abstract: Notice of Violation of IEEE Publication Principles "Designing Energy Routing Protocol with Power Consumption Optimization in MANET," by Shivashankar, H.N. Suresh, G. Varaprasad, and G. Jayanthi, in the IEEE Transactions on Emerging Topics in Computing, Vol.2, No.2, June 2014, pp.192-197 After careful and considered review, it has been determined that the above paper is in violation of IEEE's Publication Principles. One of the authors, Golla Varaprasad, falsified reviewer names and provided them as recommended reviewers for the manuscript. As technology rapidly increases, diverse sensing and mobility capabilities have become readily available to devices and, consequently, mobile ad hoc networks (MANETs) are being deployed to perform a number of important tasks. In MANET, power aware is important challenge issue to improve the communication energy efficiency at individual nodes. We propose efficient power aware routing (EPAR), a new power aware routing protocol that increases the network lifetime of MANET. In contrast to conventional power aware algorithms, EPAR identifies the capacity of a node not just by its residual battery power, but also by the expected energy spent in reliably forwarding data packets over a specific link. Using a mini-max formulation, EPAR selects the path that has the largest packet capacity at the smallest residual packet transmission capacity. This protocol must be able to handle high mobility of the nodes that often cause changes in the network topology. This paper evaluates three ad hoc network routing protocols (EPAR, MTPR, and DSR) in different network scales, taking into consideration the power consumption. Indeed, our proposed scheme reduces for more than 20% the total energy consumption and decreases the mean delay, especially for high load networks, while achieving a good packet delivery ratio.

Journal ArticleDOI
TL;DR: Tests using computer simulation in Network Simulator 2 (ns-2) indicate that the overhead in PSR is only a fraction of the overhead of these baseline protocols, and PSR yields similar or better data transportation performance thanThese baseline protocols.
Abstract: Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networking, with most research conducted for stationary wireless networks. One of the reasons why opportunistic data forwarding has not been widely utilized in mobile ad hoc networks (MANETs) is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. In this paper, we propose a lightweight proactive source routing (PSR) protocol. PSR can maintain more network topology information than distance vector (DV) routing to facilitate source routing, although it has much smaller overhead than traditional DV-based protocols [e.g., destination-sequenced DV (DSDV)], link state (LS)-based routing [e.g., optimized link state routing (OLSR)], and reactive source routing [e.g., dynamic source routing (DSR)]. Our tests using computer simulation in Network Simulator 2 (ns-2) indicate that the overhead in PSR is only a fraction of the overhead of these baseline protocols, and PSR yields similar or better data transportation performance than these baseline protocols.

Journal ArticleDOI
TL;DR: Simulation results have shown that the proposed scheme is able to reduce both the handoff delay and packet loss rate.
Abstract: The goal of the network mobility management is to effectively reduce the complexity of handoff procedure and keep mobile devices connecting to the Internet. When users are going to leave an old subnet and enter a new subnet, the handoff procedure is executed on the mobile device, and it may break off the real-time service, such as VoIP or mobile TV, because of the mobility of mobile devices. Because a vehicle is moving so fast, it may cause the handoff and packet loss problems. Both of the problems will lower down the throughput of the network. To overcome these problems, we propose a novel network mobility protocol for vehicular ad hoc networks. In a highway, because every car is moving in a fixed direction at a high speed, a car adopting our protocol can acquire an IP address from the vehicular ad hoc network through the vehicle-to-vehicle communications. The vehicle can rely on the assistance of a front vehicle to execute the prehandoff procedure, or it may acquire a new IP address through multihop relays from the car on the lanes of the same or opposite direction and thus may reduce the handoff delay and maintain the connectivity to the Internet. Simulation results have shown that the proposed scheme is able to reduce both the handoff delay and packet loss rate. Copyright © 2013 John Wiley & Sons, Ltd.

Journal ArticleDOI
TL;DR: A new mechanism to establish stable and sustainable paths between all pairs of nodes in a Mobile Ad hoc Network using a stability function as the main path selection criterion based on the calculation of the mobility degree of a node relative to its neighbor is proposed.

Journal ArticleDOI
TL;DR: This paper proposes a new routing protocol, i.e., authenticated anonymous secure routing (AASR), to satisfy the requirement and defend against the attacks, and demonstrates the effectiveness of the proposed AASR protocol with improved performance as compared with the existing protocols.
Abstract: Anonymous communications are important for many of the applications of mobile ad hoc networks (MANETs) deployed in adversary environments. A major requirement on the network is the ability to provide unidentifiability and unlinkability for mobile nodes and their traffic. Although a number of anonymous secure routing protocols have been proposed, the requirement is not fully satisfied. The existing protocols are vulnerable to the attacks of fake routing packets or denial-of-service broadcasting, even the node identities are protected by pseudonyms. In this paper, we propose a new routing protocol, i.e., authenticated anonymous secure routing (AASR), to satisfy the requirement and defend against the attacks. More specifically, the route request packets are authenticated by a group signature, to defend against potential active attacks without unveiling the node identities. The key-encrypted onion routing with a route secret verification message is designed to prevent intermediate nodes from inferring a real destination. Simulation results have demonstrated the effectiveness of the proposed AASR protocol with improved performance as compared with the existing protocols.

Journal ArticleDOI
TL;DR: A diversity technology called Channel-Aggregation Diversity (CAD), through which each node can utilize multiple channels simultaneously and efficiently allocate the upper-bounded power resource with only one data radio is proposed, aimed at improving both spectrum and energy efficiencies.
Abstract: In cognitive Ad Hoc networks (CAHN), because the contentions and mutual interferences among secondary nodes are inevitable as well as secondary nodes usually have limited power budget, spectrum efficiency and energy efficiency are critically important to the CAHN, especially for the medium access control (MAC) protocol design. Aiming at improving both spectrum and energy efficiencies, we in this paper propose a diversity technology called Channel-Aggregation Diversity (CAD), through which each node can utilize multiple channels simultaneously and efficiently allocate the upper-bounded power resource with only one data radio. Based on the proposed CAD technology, we further develop a CAD-based MAC (CAD-MAC) protocol, which enables the secondary nodes to sufficiently use available channel resources under the upper-bounded power and transmit multiple data packets in one transmission process subject to the transmission-time fairness constraint. In order to improve the performance of CAHNs, we propose two joint power-channel allocation schemes. In the first scheme, we aim at maximizing the data transmission rate. By converting the joint power-channel allocation to the Multiple-Choice Knapsack Problem, we derive the optimal allocation policy through dynamic programming. In the second scheme, our objective is to optimize the energy efficiency and we obtain the corresponding allocation policy through fractional programming. Simulation results show that our proposed CAD-MAC protocol can efficiently increase the spectrum and energy efficiencies as well as the throughput of the CAHN compared with existing protocols. Moreover, the energy efficiency of the CAHN can be further improved by adopting the energy efficiency optimization based resource allocation scheme.

Proceedings ArticleDOI
10 Sep 2014
TL;DR: The Fuzzy-Based Multi-Interface System (FBMIS), where each node is equipped with two interfaces: the traditional cellular network interface and Mobile Ad hoc Networks (MANET) interface, is proposed and evaluated by computer simulations using MATLAB.
Abstract: Several solutions have been proposed for improving the Quality of Service (QoS) in wireless cellular networks, such as Call Admission Control (CAC) and handover strategies. However, none of them considers the usage of different interfaces for different conditions. In this work, we propose the Fuzzy-Based Multi-Interface System (FBMIS), where each node is equipped with two interfaces: the traditional cellular network interface and Mobile Ad hoc Networks (MANET) interface. The proposed FBMIS system is able to switch from cellular to Ad-Hoc mode and vice versa. We consider three input parameters: distance between nodes, node mobility and the angle between node and the base station. We evaluated the performance of the proposed system by computer simulations using MATLAB. The simulation results show that our system has a good performance.

Patent
18 Feb 2014
TL;DR: In this article, the authors present methods for integrating an ad hoc cellular network into a fixed cellular network by configuring an access or backhaul configuration and radio characteristics to optimize network performance.
Abstract: In this invention, we disclose methods directed toward integrating an ad hoc cellular network into a fixed cellular network. The methods disclosed herein automate the creation and integration of these networks. In additional embodiments, we disclose methods for establishing a stand-alone, ad hoc cellular network. In either of these implementations, we integrate or establish an ad hoc cellular network using mobile ad hoc cellular base stations configured to transmit and receive over a variety of frequencies, protocols, and duplexing schemes. The methods flexibly and dynamically choose an access or backhaul configuration and radio characteristics to optimize network performance. Additional embodiments provide for enhancing an existing network's coverage as needed, establishing a local network in the event of a loss of backhaul coverage to the core network, and providing local wireless access service within the ad hoc cellular network.

Proceedings ArticleDOI
25 Sep 2014
TL;DR: This paper presents the required core components to build SDN-based Mobile Cloud, including variations that are required to accommodate different wireless environments, such as mobility and unreliable wireless link conditions, and introduces several instances of the proposed architectures based on frequency selection of wireless transmission that are designed around different use cases ofSDN- based Mobile Cloud.
Abstract: Software-Defined Networking (SDN) is an emerging technology which brings flexibility and programmability to networks and introduces new services and features. However, most SDN architectures have been designed for wired infrastructures, especially in the data center space, and primary trends for wireless and mobile SDN are on the access network and the wireless backhaul. In this paper, we propose several designs for SDN-based Mobile Cloud architectures, focusing on Ad hoc networks. We present the required core components to build SDN-based Mobile Cloud, including variations that are required to accommodate different wireless environments, such as mobility and unreliable wireless link conditions. We also introduce several instances of the proposed architectures based on frequency selection of wireless transmission that are designed around different use cases of SDN- based Mobile Cloud. We demonstrate the feasibility of our architecture by implementing SDN-based routing in the mobile cloud and comparing it with traditional Mobile Ad Hoc Network (MANET) routing. The feasibility of our architecture is shown by achieving high packet delivery ratio with acceptable overhead.

Journal ArticleDOI
TL;DR: This review paper provides an overview of existing mobile ad-hoc proactive and reactive routing protocols depending on their reactive and reactive nature respectively by presenting their characteristics, functionality, benefits and limitations and then makes their comparative analysis so to analyze their performance.
Abstract: mobile ad-hoc network is characterized as network without any physical connections. In this network there is no fixed topology due to the mobility of nodes, interference, multipath propagation and path loss. Many Routing protocols have been developed to overcome these characteristics. The purpose of this paper is to review existing mobile ad-hoc proactive and reactive routing protocols depending on their proactive and reactive nature respectively. This review paper provides an overview of these protocols by presenting their characteristics, functionality, benefits and limitations and then makes their comparative analysis so to analyze their performance. The objective of this review paper is to provide analysis about improvement of these existing protocols.

Proceedings ArticleDOI
27 Mar 2014
TL;DR: Energy efficient routing protocol known as Position Responsive Routing Protocol (PRRP) is introduced to enhance energy efficiency of WSN and shows significant improvement of 45% in energy efficiency by increasing battery life of individual nodes.
Abstract: Nowadays Wireless Sensor Networks WSNs are playing a vital role in several application areas ranging health to battlefield Wireless sensor networks are easy to deploy due to its unique characteristics of size and self-organizing networks. Wireless sensor nodes contain small unchangeable and not chargeable batteries. It is a resource constraint type network Routing in WSN is most expensive task as it utilizes more power resources. This paper is intended to introduce energy efficient routing protocol known as Position Responsive Routing Protocol (PRRP) to enhance energy efficiency of WSN. Position responsive routing protocol differs in several ways than other existing routing techniques. Position response routing protocol approach allows fair distribution of gateway\cluster head selection, maximum possible distance minimization among nodes and gateways\cluster heads to utilize less energy. Position responsive routing protocol shows significant improvement of 45% in energy efficiency of wireless sensor network life time as a whole by increasing battery life of individual nodes. Furthermore PRRP shows drastic increases for data throughput and provide better solution to routing energy hole due to it fair distributed approach of gateway selection.

Journal ArticleDOI
TL;DR: The proposed scheme associates the backward difference traffic moments with the Sleep-time duration to tune the activity durations of a node for achieving optimal energy conservation and alleviating the uncontrolled energy consumption of wireless devices.

Journal ArticleDOI
TL;DR: An Efficient and Reliable MAC protocol for VANETs (VER-MAC) is proposed which allows nodes to broadcast safety packets twice during both the control channel interval and service channel interval to increase the safety broadcast reliability.
Abstract: Vehicular Ad hoc Network (VANET) is developed to enhance the safety, comfort and efficiency of driving. The IEEE 802.11p/WAVE and IEEE 1609.4 family are standards intended to support wireless access in VANETs. In this paper, we propose an Efficient and Reliable MAC protocol for VANETs (VER-MAC) which allows nodes to broadcast safety packets twice during both the control channel interval and service channel interval to increase the safety broadcast reliability. By using the additional data structures, nodes can transmit service packets during the control channel interval to improve the service throughput.

Journal ArticleDOI
Xuelian Cai1, Ying He1, Chunchun Zhao1, Lina Zhu1, Changle Li1 
TL;DR: A Link State aware Geographic Opportunistic routing protocol (LSGO) which exploits a combination of geographic location and the link state information as the routing metric to improve the reliability of data transmission in a highly dynamic environment is proposed.
Abstract: Robust and efficient data delivery in vehicular ad hoc networks (VANETs) with high mobility is a challenging issue due to dynamic topology changes and unstable wireless links. The opportunistic routing protocols can improve the reliability of routing by making full use of the broadcast characteristics and assist in data transmission through additional backup links. In this paper, we propose a Link State aware Geographic Opportunistic routing protocol (LSGO) which exploits a combination of geographic location and the link state information as the routing metric. The LSGO aims to improve the reliability of data transmission in a highly dynamic environment, which selects the forwarders and prioritizes them based on the vehicle’s geographic location and the link’s quality. We compare the performance of LSGO with GpsrJ + which removes the unnecessary stop at a junction and greedy traffic aware routing protocol (GyTAR) using network simulator ns-2. The simulation results show that it opens more nodes to participate in the opportunistic data forwarding and increases a connection’s throughput while using no more network capacity than traditional routing. In the simulation, compared with other two protocols, when the number of vehicles and the average vehicle velocity increase, LSGO’s packet dropping rate is reduced and the network throughput is improved.