Showing papers on "Zone Routing Protocol published in 2018"
TL;DR: A novel four-dimensional (4D) evaluation framework for QoS routing algorithms, whereby the 4D correspond to the type of topology, two forms of scalability of aTopology, and the tightness of the delay constraint, which identifies two algorithms, namely Lagrange relaxation-based aggregated cost (LARAC) and search space reduction delay-cost-constrained routing (SSR+DCCR), that perform very well in most of the4D evaluation space
Abstract: A variety of communication networks, such as industrial communication systems, have to provide strict delay guarantees to the carried flows. Fast and close to optimal quality of service (QoS) routing algorithms, e.g., delay-constrained least-cost (DCLC) routing algorithms, are required for routing flows in such networks with strict delay requirements. The emerging software-defined networking (SDN) paradigm centralizes the network control in SDN controllers that can centrally execute QoS routing algorithms. A wide range of QoS routing algorithms have been proposed in the literature and examined in individual studies. However, a comprehensive evaluation framework and quantitative comparison of QoS routing algorithms that can serve as a basis for selecting and further advancing QoS routing in SDN networks is missing in the literature. This makes it difficult to select the most appropriate QoS routing algorithm for a particular use case, e.g., for SDN controlled industrial communications. We close this gap in the literature by conducting a comprehensive up-to-date survey of centralized QoS routing algorithms. We introduce a novel four-dimensional (4D) evaluation framework for QoS routing algorithms, whereby the 4D correspond to the type of topology, two forms of scalability of a topology, and the tightness of the delay constraint. We implemented 26 selected DCLC algorithms and compared their runtime and cost inefficiency within the 4D evaluation framework. While the main conclusion of this evaluation is that the best algorithm depends on the specific sub-space of the 4D space that is targeted, we identify two algorithms, namely Lagrange relaxation-based aggregated cost (LARAC) and search space reduction delay-cost-constrained routing (SSR+DCCR), that perform very well in most of the 4D evaluation space.
126 citations
TL;DR: Simulation results show that MLProph outperforms PROPHET+, a probabilistic-based routing protocol for OppNets, in terms of number of successful deliveries, dropped messages, overhead, and hop count, at the cost of small increases in buffer time and buffer occupancy values.
Abstract: This paper proposes a novel routing protocol for OppNets called MLProph, which uses machine learning (ML) algorithms, namely decision tree and neural networks, to determine the probability of successful deliveries. The ML model is trained by using various factors such as the predictability value inherited from the PROPHET routing scheme, node popularity, node's power consumption, speed, and location. Simulation results show that MLProph outperforms PROPHET+, a probabilistic-based routing protocol for OppNets, in terms of number of successful deliveries, dropped messages, overhead, and hop count, at the cost of small increases in buffer time and buffer occupancy values.
106 citations
TL;DR: The proposed Intelligent Energy-aware Efficient Routing protocol for MANET (IE2R) is proposed, and the results obtained outperforms existing protocols in terms of several network metrics.
Abstract: Designing an energy efficient routing protocol is one of the main issue of Mobile Ad-hoc Networks (MANETs) It is challenging task to provide energy efficient routes because MANET is dynamic and mobile nodes are fitted with limited capacity of batteries The high mobility of nodes results in quick changes in the routes, thus requiring some mechanism for determining efficient routes In this paper, an Intelligent Energy-aware Efficient Routing protocol for MANET (IE2R) is proposed In IE2R, Multi Criteria Decision Making (MCDM) technique is used based on entropy and Preference Ranking Organization METHod for Enrichment of Evaluations-II (PROMETHEE-II) method to determine efficient route MCDM technique combines with an intelligent method, namely, Intuitionistic Fuzzy Soft Set (IFSS) which reduces uncertainty related to the mobile node and offers energy efficient route The proposed protocol is simulated using the NS-2 simulator The performance of the proposed protocol is compared with the existing routing protocols, and the results obtained outperforms existing protocols in terms of several network metrics
81 citations
TL;DR: A routing protocol based on genetic algorithm for a middle layer oriented network in which the network consists of several stations that are responsible for receiving data and forwarding the data to the sink and three methods are introduced for effective cope with the expansion of network scale problem.
Abstract: Energy saving and effective utilization are an essential issue for wireless sensor network. Most previous cluster based routing protocols only care the relationship of cluster heads and sensor nodes but ignore the huge difference costs between them. In this paper, we present a routing protocol based on genetic algorithm for a middle layer oriented network in which the network consists of several stations that are responsible for receiving data and forwarding the data to the sink. The amount of stations should be not too many and not too few. Both cases will cause either too much construction cost or extra transmission energy consumption. We implement five methods to compare the performance and test the stability of our presented methods. Experimental results demonstrate that our proposed scheme reduces the amount of stations by 36.8 and 20% compared with FF and HL in 100-node network. Furthermore, three methods are introduced to improve our proposed scheme for effective cope with the expansion of network scale problem.
66 citations
TL;DR: A new routing protocol that provides QoS in terms of delay and energy consumption is proposed that incurs less delay and is energy efficient and an evaluation of the approach is performed through simulations.
Abstract: Wireless sensor and actuator networks are composed of sensor and actuator nodes interconnected via wireless links. The actuators are responsible for taking prompt decisions and react accordingly to the data gathered by sensor nodes. In order to ensure efficient actions in such networks, we propose a new routing protocol that provides QoS in terms of delay and energy consumption. The network is organized in clusters supervised by CHs (Cluster-Heads), elected according to important metrics, namely the energy capability, the riches of connectivity, which is used to select the CH with high node density, and the accessibility degree regarding all the actuators. The latter metric is the distance in number of hops of sensor nodes relative to the actuator nodes. This metric enhances more the network reliability by reducing the communication delay when alerting the actuator nodes, and hence, reducing the energy consumption. To reach efficiently the actuator nodes, we design a delay and energy sensitive routing protocol based on-demand routing approach. Our protocol incurs less delay and is energy efficient. We perform an evaluation of our approach through simulations. The obtained results show out performance of our approach while providing effective gain in terms of communication delay and energy consumption.
63 citations
TL;DR: A novel QoS aware evolutionary cluster based routing protocol (QERP) has been proposed for UWSN-based applications that improves packet delivery ratio, and reduces average end-to-end delay and overall network energy consumption.
Abstract: Quality-of-service (QoS) aware reliable data delivery is a challenging issue in underwater wireless sensor networks (UWSNs). This is due to impairments of the acoustic transmission caused by excessive noise, extremely long propagation delays, high bit error rate, low bandwidth capacity, multipath effects, and interference. To address these challenges, meet the commonly used UWSN performance indicators, and overcome the inefficiencies of the existing clustering-based routing schemes, a novel QoS aware evolutionary cluster based routing protocol (QERP) has been proposed for UWSN-based applications. The proposed protocol improves packet delivery ratio, and reduces average end-to-end delay and overall network energy consumption. Our comparative performance evaluations demonstrate that QERP is successful in achieving low network delay, high packet delivery ratio, and low energy consumption.
59 citations
TL;DR: Large-scale simulation results demonstrate that PRD performs better than the widely used ETX metric as well as other two metrics devised recently in terms of energy consumption and end-to-end delay, while guaranteeing packet delivery ratio.
Abstract: This paper investigates the problem of energy consumption in wireless sensor networks. Wireless sensor nodes deployed in harsh environment where the conditions change drastically suffer from sudden changes in link quality and node status. The end-to-end delay of each sensor node varies due to the variation of link quality and node status. On the other hand, the sensor nodes are supplied with limited energy and it is a great concern to extend the network lifetime. To cope with those problems, this paper proposes a novel and simple routing metric, predicted remaining deliveries (PRD), combining parameters, including the residual energy, link quality, end-to-end delay, and distance together to achieve better network performance. PRD assigns weights to individual links as well as end-to-end delay, so as to reflect the node status in the long run of the network. Large-scale simulation results demonstrate that PRD performs better than the widely used ETX metric as well as other two metrics devised recently in terms of energy consumption and end-to-end delay, while guaranteeing packet delivery ratio.
50 citations
01 Mar 2018
TL;DR: A biogeography-based energy saving routing architecture (BERA) is proposed for CH selection and routing with an efficient encoding scheme of a habitat and by formulating a novel fitness function that uses residual energy and distance as its metrics.
Abstract: Biogeography-based optimization (BBO) is a relatively new paradigm for optimization which is yet to be explored to solve complex optimization problems to prove its full potential. In wireless sensor networks (WSNs), optimal cluster head selection and routing are two well-known optimization problems. Researchers often use hierarchal cluster-based routing, in which power consumption of cluster heads (CHs) is very high due to its extra functionalities such as receiving and aggregating the data from its member sensor nodes and transmitting the aggregated data to the base station (BS). Therefore, proper care should be taken while selecting the CHs to enhance the life of the network. After formation of the clusters, data to be routed to the BS in inter-cluster fashion for further enhancing the life of WSNs. In this paper, a biogeography-based energy saving routing architecture (BERA) is proposed for CH selection and routing. The biogeography-based CH selection algorithm is proposed with an efficient encoding scheme of a habitat and by formulating a novel fitness function that uses residual energy and distance as its metrics. The BBO-based routing algorithm is also proposed. The efficient encoding scheme of a habitat is developed, and its fitness function considers the node degree in addition to residual energy and distance. To exhibit the performance of BERA, it is extensively tested with some existing routing algorithms such as DHCR, Hybrid routing, EADC and some bio-inspired algorithms, namely GA and PSO. Simulation results confirm the superiority/competitiveness of the proposed algorithm over existing techniques.
46 citations
TL;DR: The proposed unicast routing protocol based on attractor selecting (URAS) is an opportunistic routing protocol, which is able to change itself adaptively to the complex and dynamic environment by routing feedback packets, and employs a multiattribute decision-making strategy to reduce the number of redundant candidates for next-hop selection.
Abstract: We present a bio-inspired unicast routing protocol for vehicular ad hoc networks which uses the cellular attractor selection mechanism to select next hops. The proposed unicast routing protocol based on attractor selecting (URAS) is an opportunistic routing protocol, which is able to change itself adaptively to the complex and dynamic environment by routing feedback packets. We further employ a multiattribute decision-making strategy, the technique for order preference by similarity to an ideal solution, to reduce the number of redundant candidates for next-hop selection, so as to enhance the performance of attractor selection mechanism. Once the routing path is found, URAS maintains the current path or finds another better path adaptively based on the performance of current path, that is, it can self-evolution until the best routing path is found. Our simulation study compares the proposed solution with the state-of-the-art schemes, and shows the robustness and effectiveness of the proposed routing protocol and the significant performance improvement, in terms of packet delivery, end-to-end delay, and congestion, over the conventional method.
43 citations
TL;DR: This paper analyzed the performance of Ad hoc On-Demand Distance Vector routing protocol, Optimized Link State Routing (OLSR) and Zone Routing Protocol (ZRP) in IEEE 802.15.4 based Wireless Sensor Network (WSN) in the presence of wormhole attacks.
43 citations
TL;DR: This work proposes a novel routing protocol inspired by the cuckoo search method that compares with the routing protocol ad hoc on-demand distance vector, destination sequence distance vector and the bio-inspired routing protocol AntHocNet in terms of the quality of service parameters.
Abstract: Mobile ad hoc networks (MANETs) are becoming an emerging technology that offer several advantages to users in terms of cost and ease of use. A MANET is a collection of mobile nodes connected by wireless links that form a temporary network topology that operates without a base station and centralized administration. Routing is a method through which information is forwarded from a transmitter to a specific recipient. Routing is a strategy that guarantees, at any time, the connection between any two nodes in a network. In this work, we propose a novel routing protocol inspired by the cuckoo search method. Our routing protocol is implemented using Network simulator 2. We chose Random WayPoint model as our mobility model. To validate our work, we opted for the comparison with the routing protocol ad hoc on-demand distance vector, destination sequence distance vector and the bio-inspired routing protocol AntHocNet in terms of the quality of service parameters: packet delivery ratio and end-to-end delay (E2ED).
TL;DR: A small comparison study of some state-of-the-art algorithms on a real Internet topology to help the reader appreciate how the different strategies compare against one another, and demonstrates that it is hard to pick a winner among existing policies.
Abstract: With the exponential growth of content in recent years, users are primarily interested in obtaining particular content and are not concerned with the host housing the content. By treating content as a first class citizen, information- centric networks (ICN) seek to transform the Internet from a host-to-host communication model to a content-centric model. A key component of ICN is to cache content at storage-enabled routers. By caching content at in-network routers, network performance can be improved by delivering content from routers closer to the user and not from the origin servers (content custodians). In this article, we provide an overview of the state-of-the-art cache management and routing policies in ICN. We present a small comparison study of some state-of-the-art algorithms on a real Internet topology to help the reader appreciate how the different strategies compare against one another. Our simulation results demonstrate that it is hard to pick a winner among existing policies. We conclude the article with a discussion of open research questions.
TL;DR: A fuzzy logic-based reliable routing protocol (FRRP) is proposed for MANETs which selects stable routes using fuzzy logic and is able to optimize system efficiency.
Abstract: MANET (mobile ad-hoc network) includes a set of wireless mobile nodes which communicate with one another without any central controls or infrastructures and they can be quickly implemented in the operational environment. One of the most significant issues in MANETs is concerned with finding a secure, safe and short route so that data can be transmitted through it. Although several routing protocols have been introduced for the network, the majority of them just consider the shortest path with the fewest number of hops. Hop criterion is considered for simple implementation and it is reliable in dynamic environments; however, queuing delay and connection delay in the intermediate nodes are not taken into consideration for selecting route in this criterion. In this paper, a fuzzy logic-based reliable routing protocol (FRRP) is proposed for MANETs which selects stable routes using fuzzy logic. It is able to optimize system efficiency. The score allocated to routes are based on four criteria: accessible bandwidth, the amount of energy of battery, the number of hops and the degree of dynamicity of nodes. The simulation results obtained from OPNET simulator version 10.5 indicate that the proposed protocol, in comparison with ad hoc on-demand distance vector (AODV) and fuzzy-based on-demand routing protocol (FBORP), was able to better improve packet delivery rate, average end-to-end delay and throughput.
TL;DR: This paper proposed a new hierarchical clustering algorithm (HCAL) and a corresponded protocol for hierarchical routing in LMANET and extensive performance comparisons are carried out with some state‐of‐the‐art routing algorithms, namely, Dynamic Doppler Velocity Clustering, Signal Characteristic‐Based Clustered, Dynamic Link Duration ClUSTering, and mobility‐based clustering algorithms.
Abstract: Summary
The hierarchical routing algorithm is categorized as a kind of routing method using node clustering to create a hierarchical structure in large-scale mobile ad hoc network (LMANET). In this paper, we proposed a new hierarchical clustering algorithm (HCAL) and a corresponded protocol for hierarchical routing in LMANET. The HCAL is designed based on a cost metric in the form of the link expiration time and node's relative degree. Correspondingly, the routing protocol for HCAL adopts a reactive protocol to control the existing cluster head (CH) nodes and handle proactive nodes to be considered as a cluster in LMANET. Hierarchical clustering algorithm jointly utilizes table-driven and on-demand routing by using a combined weight metric to search dominant set of nodes. This set is composed by link expiration time and node's relative degree to establish the intra/intercommunication paths in LMANET. The performance of the proposed algorithm and protocol is numerically evaluated in average end-to-end delay, number of CH per round, iteration count between the CHs, average CH keeping time, normalized routing overhead, and packet delivery ratio over a number of randomly generated benchmark scenarios. Furthermore, to corroborate the actual effectiveness of the HCAL algorithm, extensive performance comparisons are carried out with some state-of-the-art routing algorithms, namely, Dynamic Doppler Velocity Clustering, Signal Characteristic-Based Clustering, Dynamic Link Duration Clustering, and mobility-based clustering algorithms.
TL;DR: The proposed energy-efficient data sensing and routing scheme (EEDSRS) in unreliable energy-harvesting wireless sensor network is developed and the experimental results demonstrate that the proposed EEDSRS is very promising and efficient.
Abstract: Energy-harvesting wireless sensor network (WSN) is composed of unreliable wireless channels and resource-constrained nodes which are powered by solar panels and solar cells. Energy-harvesting WSNs can provide perpetual data service by harvesting energy from surrounding environments. Due to the random characteristics of harvested energy and unreliability of wireless channel, energy efficiency is one of the main challenging issues. In this paper, we are concerned with how to decide the energy used for data sensing and transmission adaptively to maximize network utility, and how to route all the collected data to the sink along energy-efficient paths to maximize the residual battery energy of nodes. To solve this problem, we first formulate a heuristic energy-efficient data sensing and routing problem. Then, unlike the most existing work that focuses on energy-efficient data sensing and energy-efficient routing respectively, energy-efficient data sensing and routing scheme (EEDSRS) in unreliable energy-harvesting wireless sensor network is developed. EEDSRS takes account of not only the energy-efficient data sensing but also the energy-efficient routing. EEDSRS is divided into three steps: (1) an adaptive exponentially weighted moving average algorithm to estimate link quality. (2) an distributed energetic-sustainable data sensing rate allocation algorithm to allocate the energy for data sensing and routing. According to the allocated energy, the optimal data sensing rate to maximize the network utility is obtained. (3) a geographic routing with unreliable link protocol to route all the collected data to the sink along energy-efficient paths. Finally, extensive simulations to evaluate the performance of the proposed EEDSRS are performed. The experimental results demonstrate that the proposed EEDSRS is very promising and efficient.
TL;DR: Optimal multimodal routing (OMR) as mentioned in this paper makes distributed decisions about the flow in each link and over each technology, at any given time, in order to advance a packet toward its destination.
Abstract: While acoustic communications are still considered the most prominent technology to communicate under water, other technologies are being developed based, e.g., on optical and radio-frequency electromagnetic waves. Each technology has its own advantages and drawbacks: for example, acoustic signals achieve long communication ranges at order-of-kbit/s rates, whereas optical signals offer order-of-Mbit/s transmission rates, but only over short ranges. Such diversity can be leveraged by multimodal systems, which integrate different technologies and provide the intelligence required to decide which one should be used at any given time. In this paper, we address a fundamental part of this intelligence by proposing optimal multimodal routing (OMR), a novel routing protocol for underwater networks of multimodal nodes. OMR makes distributed decisions about the flow in each link and over each technology, at any given time, in order to advance a packet toward its destination; in doing so, it prevents bottlenecks and allocates resources fairly to different nodes. We analyze the performance of OMR via simulations and in a field experiment. The results show that OMR successfully leverages all technologies to deliver data, even in the presence of imperfect topology information. To permit the reproduction of our results, we share our simulation code.
TL;DR: In this paper, the addressing process relies on virtual coordinates from multiple, alternative anchor point sets that act as viewports, and each viewport offers different address granularity within the network space, and its selection is optimized by a packet sending node using a novel heuristic.
Abstract: Packet routing in nanonetworks requires novel approaches, which can cope with the extreme limitations posed by the nano-scale. Highly lossy wireless channels, extremely limited hardware capabilities and non-unique node identifiers are among the restrictions. The present work offers an addressing and routing solution for static 3D nanonetworks that find applications in material monitoring and programmatic property tuning. The addressing process relies on virtual coordinates from multiple, alternative anchor point sets that act as \emph{viewports}. Each viewport offers different address granularity within the network space, and its selection is optimized by a packet sending node using a novel heuristic. Regarding routing, each node can deduce whether it is located on the linear segment connecting the sender to the recipient node. This deduction is made using integer calculations, node-local information and in a stateless manner, minimizing the computational and storage overhead of the proposed scheme. Most importantly, the nodes can regulate the width of the linear path, thus trading energy efficiency (redundant transmissions) for increased path diversity. This trait can enable future adaptive routing schemes. Extensive evaluation via simulations highlights the advantages of the novel scheme over related approaches.
TL;DR: This work proposes a light-weight time series based routing metric prediction method to deal with the high communication cost incurred by collecting the latest routing metrics between nodes and achieves 30% more Packet Delivery Ratio compared to the traditional AODV protocol.
TL;DR: This work proposes an improved BP algorithm called sojourn-time-based BP (STBP), which effectively improves the end-to-end delay while ensuring throughput optimality and analyzes the network stability with delay considerations and proves the throughput Optimality of the STBP in multihop networks.
Abstract: Although the back-pressure (BP) algorithm has been proven to be a throughput-optimal policy for traffic scheduling and routing in wireless networks, the optimal control of delays in the BP algorithm remains an open problem, especially for conventional multihop networks. To enhance the delay performance, we proposed an improved BP algorithm called sojourn-time-based BP (STBP) by introducing a novel delay metric called the sojourn time backlog (STB). The STB considers the queue length and accumulated packet delays comprehensively. It provides more pressure to push forward flows suffering from greater delays. Based on this new metric, the calculation of the routing weight for each packet is determined for maximizing the difference of the STB in the routing process. The proposed routing algorithm is robust and distributed, and does not require any prior knowledge of network connections and load conditions. We analyze the network stability with delay considerations and prove the throughput optimality of the STBP in multihop networks. Simulation results reveal that the enhanced algorithm effectively improves the end-to-end delay while ensuring throughput optimality.
TL;DR: Two protocols are proposed in order to optimally utilize the constrained network resources and reliably detect high-quality links and Signal Strength and Congestion Avoidance protocol (SSCA).
Abstract: During the last two decades, there has been a tremendous growth in the use of MANETs, not only due to the development of the technology but also due to their high flexibility. MANETs have challenges and limitations and among the major challenge is the routing process because of high dynamic topology and distributed nature. This is the main reason for quick depletion of network resources. Thus, there is a need to develop a routing protocol to fulfill various application requirements and enhance routing paths according to the topology change. In this paper, two protocols are proposed in order to optimally utilize the constrained network resources and reliably detect high-quality links. They are Hybrid Geo-cast Routing (HGR) protocol and Signal Strength and Congestion Avoidance protocol (SSCA). The optimal and adaptive HGR protocol utilizes geographical location information to limit search area during route discovery process by including only promising search paths to minimize control overhead. Meanwhile, adaptive SSCA uses SSCA mechanism in order to enhance link and node quality detection and reduce packet drop. The experimental results show that the proposed HGR protocol is able to reduce up to 46.67% control overhead. Meanwhile, the proposed adaptive SSCA protocol reduces packet drop to 71.20%.
TL;DR: Several 3D new routing algorithms that maximize the packets delivery rate and minimize the overhead are proposed that show a significant improvement in delivery rate up to 100% and a huge reduction in overall traffic.
Abstract: One known design for routing algorithms in mobile ad hoc networks is to use flooding. But, these algorithms are usually suffer from high overhead. Another common design is to use the nodes geographic locations to take routing choices. Current geographical routing algorithms usually address the routing environment in 2D space. However, in real life, nodes could be located in 3D space. To benefit from the advantages of both techniques we propose several 3D new routing algorithms that maximize the packets delivery rate and minimize the overhead. Our first set of algorithms (SPF: smart partial flooding) uses the nodes location to do the flooding in the direction of the destination over a sub-graph of the original dense graph. The second set (Progress–SPF) uses geographical routing to progress as much as possible to the destination, if its not possible, SPF is used over a sub-graph extracted locally. The 3rd set (Progress–SPF–Progress) used geographical routing to progress to the destination, if the progress is not possible, SPF is used over a sub-graph for one step only and then the algorithm goes back to the geographical routing. We evaluate our algorithms and compare them with current routing algorithms. The simulation results show a significant improvement in delivery rate up to $$100\%$$
compared to $$70\%$$
and a huge reduction in overall traffic around $$60\%$$
.
01 Jan 2018
TL;DR: This paper presents the link quality, routing path issue built on depth-based routing techniques to overcome the shortages in the existing work and shows that the proposed work reduces the cost of the route and improves the network lifetime by consuming less energy.
Abstract: Underwater sensor network (USN) has a wide range of aquatic application that is totally different from terrestrial sensor network. The nodes of USN have a peculiar characteristics like float mobility, limited bandwidth and energy, signal and link quality, routing challenges and its cost and high error probability. By this nature, USN degrades the performance in terms of throughput and lifetime. This paper presents the link quality, routing path issue built on depth-based routing techniques to overcome the shortages in the existing work. Triangular metric-based routing is a geometric combination of packet reception probability (PRP), signal-to-noise ratio (SNR) and link quality indication (LQI) that is used to select the next forwarding node with reliability, which in turn reduces the routing cost. Moreover, it makes the very less energy consumption and improves the network lifetime. This method overcomes the unnecessary overlapping and repairs the link failure during network operation. The simulation results show that the proposed work reduces the cost of the route and improves the network lifetime by consuming less energy.
TL;DR: The WTR mechanism uses Dijkstra’s shortest path routing algorithm in which the weights are deliberated using certain parameters such as node-distance, packet-loss and trust value of each node which is computed using social impact theory optimizer.
Abstract: In this paper, we have exploited the weight trusted routing (WTR) mechanism to detect and eliminate the malicious nodes involved during the routing path formation in smart-home environments where the routing between the communicating entities is performed through the mesh architecture. Further, to provide a secure communication against malicious behavior of nodes, the proposed mechanism uses Dijkstra’s shortest path routing algorithm in which the weights are deliberated using certain parameters such as node-distance, packet-loss and trust value of each node which is computed using social impact theory optimizer. Moreover, we have presented the network performance trade-off caused by secure path formation with conventional method and have proposed the WTR mechanism for eliminating the potential issues such as packet-loss ratio, end-to-end delay and network throughput. The commercial simulator NS2 is used to simulate and compare the network metrics for both conventional as well as proposed approach and is validated with experimental results over end-to-end delay and message delivery ratio against reported literature.
TL;DR: In this article, a novel heuristic routing algorithm known as QoS assured multi-objective hybrid routing algorithm (Q-MOHRA) for Heterogeneous WSN is presented.
Abstract: Quality of Service (QoS) assurance in Wireless Sensor Network (WSN) is a tough task, and it is more exciting due to the scarcity of resources. The requirement of different WSN applications running over has different constraints. In QoS, routing protocol the network has to balance the traffic. This paper presents a novel heuristic routing algorithm known as QoS assured Multi-objective Hybrid Routing Algorithm (Q-MOHRA) for Heterogeneous WSN. Q-MOHRA takes into account the link (energy, hop count, link quality indicator etc.) and path (jitter) metrics for optimal path selection. The performance of Q-MOHRA is evaluated through intensive simulation and equated with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-objective Routing Algorithm (DyMORA). The metrics such as average energy consumption, residual energy, packet delivery ratio, jitter, and normalized routing load are used for comparison. The performance of Q-MOHRA has been observed to outclass SHRP and DyMORA. It improves the packet delivery ratio by 24.31% as compared to SHRP and 11.86% as compared to DyMORA. Q-MOHRA outperforms DyMORA in terms of average energy consumption by a factor of 8.27%.
TL;DR: Good network scalability and routing efficiency for Bluetooth multihop networks is demonstrated and the layer-based algorithm renders topology controllable and evenly configures the size of the subnet by appropriately selecting configured parameters.
Abstract: In this paper, a joint layer-based formation and self-routing algorithm called Bluelayer is proposed for Bluetooth multihop networks. Without any prior topology information, the layer-based algorithm determines new roots by a root decision criterion and generates individual web-shaped subnets by adopting three preconfigured network parameters. During the scatternet formation stage, a tier-ring addressing scheme is jointly introduced to achieve a distributed self-routing protocol for multihop networks. The routing protocol contains an address query phase to locate a destination and a forwarder decision phase to determine the optimal master as forwarder. With moderate communication overhead, complexity analysis shows that Bluelayer achieves the least computation and route discovery overhead than all the other schemes. In addition, computer simulation shows that the layer-based algorithm renders topology controllable and evenly configures the size of the subnet by appropriately selecting configured parameters. In the routing performance comparison, Bluelayer achieves almost same cost-performance ratio as BlueHMT and achieves better routing performance than BlueHRT and Bluetree under high traffic load conditions. In a nutshell, Bluelayer demonstrates good network scalability and routing efficiency for Bluetooth multihop networks.
TL;DR: A deadlock-free routing algorithm for wireless 3D NoCs, called Floyd-base Inter-chip Traffic distribution (FIT), which is based on Floyd routing algorithm is proposed.
Abstract: In recent years, the idea of wireless three-dimensional network-on-chips (3D NoCs) was promoted in order to design many-core chips with greater performance and lower energy consumption. This technology is the combination of different dies that are stacked on each other. Therefore, it is necessary to propose a suitable routing mechanism for irregular wireless 3D NoCs that can support the agnostic topologies. In this paper, we propose a deadlock-free routing algorithm for wireless 3D NoCs, called Floyd-base Inter-chip Traffic distribution (FIT), which is based on Floyd routing algorithm. In FIT algorithm, the number of hops is reduced compared to the already established deterministic algorithms; moreover, the traffic distribution is improved. Evaluation results show that our proposed routing algorithm significantly improves the performance and throughput by reducing the energy consumption, the average hop count and the communication latency.
TL;DR: Experimental results in network simulator 3 show the advantage of multifactor cross‐layer position‐based routing protocol over traditional state‐of‐the‐art algorithms in terms of packet delivery ratio, overhead, and the mean end‐to‐end delay.
Abstract: Summary
Communication protocols in vehicular sensor networks (VSNs) in urban areas play an important role in intelligent transport systems applications. Many cross-layer communication protocol studies are originated from topology-based algorithms, which is not suitable for the frequently changing computational scenario. In addition, the influence factors that have been considered for VSNs routing are not enough. With these aspects in mind, this paper proposes a multifactor cross-layer position-based routing protocol for VSNs to improve reliability and efficiency in message delivery. Considering the complex intersection environment, the algorithm for vehicles selection at intersections (called AVSI) is further proposed, in which comprehensive factors are taken into account including the position and direction of vehicle, the vehicle density, the signal-to-noise-plus-interference ratio, and the frame error rate in MAC layer. Meanwhile, the dynamic HELLO_STREAM broadcasting system with the various vehicle speeds is proposed to increase the decisions accuracy. Experimental results in network simulator 3 show the advantage of multifactor cross-layer position-based routing protocol over traditional state-of-the-art algorithms in terms of packet delivery ratio, overhead, and the mean end-to-end delay.
TL;DR: An optimization system for WSNs is used which is able to applied and optimize the physical distance between two nodes and signal strength between source node (p) to sink node (q) in transmission range and gradient based protocol is found to be the most efficient among others routing protocol.
Abstract: Wireless sensor nodes are battery powered so there life times are limited. Hence there is need to maximize the overall network life time. The various authors have used different approaches to enhance the network lifetime like by minimization of the energy consumed per packet, bandwidth management, optimizing shortest path, minimizing the cost packet ratio and reduce the energy exhaustion of sensor nodes. In this article, we have used an optimization system for WSNs which is able to applied and optimize the physical distance between two nodes and signal strength between source node (p) to sink node (q) in transmission range. The analysis reported based on ant colony optimization (ACO) meta heuristic method at the network layer routing protocols (data centric) namely directed diffusion protocol, gradient based protocol, energy aware routing protocol and rumor routing protocol. The remaining energy of the nodes has been computed in wireless sensor network area using different parameter. Results show that by using optimization scheme (ACO) give the better performance of directed diffusion protocol as compare to other protocol (gradient based, energy aware routing, and rumor routing) in terms of remaining energy of the node. Link bandwidth has been evaluated considering transmission rate from source node to sink node. The bandwidth of above stated routing protocols has been computed and gradient based protocol is found to be the most efficient among others routing protocol.
TL;DR: This paper shows how a virtualization layer and a new protocol running on top of it —called VNIBR, intersection-based routing on virtual nodes—can achieve better performance than state-of-the-art approaches, enabling an efficient and computationally feasible combination of topological and geographical routing.
Abstract: Recent vehicular ad hoc network routing protocols have relied on geographic forwarding and careful selection of road segments as ways to reduce the impact of individual vehicle movements. This paper shows how a virtualization layer and a new protocol running on top of it —called VNIBR, intersection-based routing on virtual nodes—can achieve better performance than state-of-the-art approaches, enabling an efficient and computationally feasible combination of topological and geographical routing. We prove by means of network simulations that this proposal consistently ensures moderate overhead, good packet delivery ratios, and low end-to-end delays, whereas the other protocols exhibit weaknesses due to flooding processes that scale poorly, proactive routing burdens or costly location services. We also present the results of graphics processing unit profiling used to assess the computational feasibility of the different schemes in the context of a real on-board computer, which reveals new advantages about scalability and impact of computational shortages on the routing performance.
TL;DR: A new QoS aware and Energy efficient Opportunistic Routing protocol (QEOR) to efficiently routing data under QoS and energy constraints for WSNs and results show that QEOR provides best performances as compared to other OR protocols.
Abstract: Energy efficiency and Quality of Service (QoS) providing are known to be critical design concerns in routing protocols for Wireless Sensor Networks (WSNs). Recent studies, demonstrate that Opportunistic Routing (OR) can greatly improve the performance of WSNs by exploiting the broadcast nature of the wireless medium. In this paper, we propose a new QoS aware and Energy efficient Opportunistic Routing protocol (QEOR) to efficiently routing data under QoS and energy constraints for WSNs. QEOR uses a new multi-metric QoS based candidate selection method in order to accurately select and prioritise the candidate forwarders. The selection is focused on a QoS function that takes into consideration the reliabilty of buffers and links, while the prioritisation is established according to transmission delays. To achieve an obvious improvement on the energy consumption, QEOR uses an energy efficient coordination method and an implicit ACKnowledgement scheme for collision and redundancy avoidance. Simulation...