Search results

In particular, this paper aims to systematically analyze a few prominent wireless sensor network (WSN) clustering routing protocols and compare these different approaches according to the taxonomy and several significant metrics.

In this paper, the authors have summarized recent research results on data routing in sensor networks and classified the approaches into four main categories, namely, data-centric, hierarchical, location-based and quality of service (QoS)-aware, and the authors have discussed the effect of node placement strategies on the operation and performance of WSNs.

Performance-controlled planned networks, where placement and routing must be intertwined and everything from delays to throughput to energy requirements is well-defined and relevant, is an interesting subject of current and future research. Real-time, deadline guarantees and their relationship with routing, mac-layer, duty-cycles and other protocol stack issues are interesting issues that would benefit from further research.

A wireless body area network (WBAN) plays a crucial role in the health-care domain. With the emergence of technologies like the internet of things, there is increased usage of WBAN for providing quality health services. With wearable devices and sensors associated with human body, patient’s vital signs are captured and sent to doctor. The WBAN has number of sensor nodes that are resource constrained. The communications among the nodes are very crucial as human health information is exchanged. The purpose of this paper aims to have Quality of Service (QoS) with energy aware and control overhead aware. Maximizing network lifetime is also essential for the improved quality in services. There are many existing studies on QoS communications in WBAN.

In this paper, with the aim of energy-efficient WBAN for QoS, a cross-layer routing protocol is designed and implemented. A cross-layer routing protocol that is ad hoc on-demand distance vector (AODV)-based, energy and control overhead-aware (AODV-ECOA) is designed and implemented for energy-efficient routing in WBAN. The cross-layer design that involves multiple layers of open systems interconnection reference model, which will improve energy efficiency and thus QoS.

Implementation is simulated using the network simulator tool, i.e. NS-2. The proposed cross-layer routing protocol AODV-ECOA shows least bandwidth requirement by control packets, leading to less control overhead, highest packet delivery ratio and energy efficiency. The experimental results revealed that AODV-ECOA shows better performance over existing protocols such as AODV and POLITIC.

An efficient control overhead reduction algorithm is proposed for reducing energy consumption further and improves performance of WBAN communications to realize desired QoS.

Abstract‐CEDAR protocol is a distributed routing protocol oriented to Quality of Service (QoS) support in MANET, and bandwidth is the QoS parameter of interest in this protocol. However, without energy efficiency consideration, earlier node failure will occur in overloaded nodes in CEDAR, and in turn may lead to network partitioning and reduced network lifetime. The storage and processing overhead of CEDAR is fairly high because too many kinds of control packets are exchanged between nodes and too much state information needs to be maintained by core nodes. The routing algorithm depends fully on the link state information known by core nodes. But the link state information may be imprecise, which will result in route failures. In this paper, we present an improved energy efficient CEDAR protocol, and propose a new efficient method of bandwidth calculation. Simulation results show that the improved CEDAR is efficient in terms of packet delivery ratio, throughput and mean‐square error of energy.

Wireless sensor networks are expected to be an integral part of any pervasive computing environment. This implies an ever‐increasing need for efficient energy and resource management of both the sensor nodes, as well as the overall sensor network, in order to meet the expected quality of data and service requirements. There have been numerous studies that have looked at the routing of data in sensor networks with the sole intention of reducing communication power consumption. However, there has been comparatively little prior art in the area of multi‐criteria based routing that exploit both the semantics of queries and the state of sensor nodes to improve network service longevity. In this paper, we look at routing in sensor networks from this perspective and propose an adaptive multi‐criteria routing protocol. Our algorithm offers automated reconfiguration of the routing tree as demanded by variations in the network state to meet application service requirements. Our experimental results show that our approach consistently outperforms, in terms of Network Lifetime and Coverage, the leading semantic‐based routing algorithm which reconfigures the routing tree at fixed periods.

Designing an efficient routing protocol that opportunistically forwards data to the destination node through nearby sensor nodes or devices is significantly important for an effective incidence response and disaster recovery framework. Existing sensor routing protocols are mostly not effective in such disaster recovery applications as the networks are affected (destroyed or overused) in disasters such as earthquake, flood, Tsunami and wildfire. These protocols require a large number of message transmissions to reestablish the clusters and communications that is not energy efficient and result in packet loss. This paper introduces ODCR - an energy efficient and reliable opportunistic density clustered-based routing protocol for such emergency sensor applications. We perform simulation to measure the performance of ODCR protocol in terms of network energy consumptions, throughput and packet loss ratio. Simulation results demonstrate that the ODCR protocol is much better than the existing TEEN, LEACH and LORA protocols in term of these performance metrics.

The purpose of this paper is to provide insight into various swarm intelligence-based routing protocols for Internet of Things (IoT), which are currently available for the Mobile Ad-hoc networks (MANETs) and wireless sensor networks (WSNs). There are several issues which are limiting the growth of IoT. These include privacy, security, reliability, link failures, routing, heterogeneity, etc. The routing issues of MANETs and WSNs impose almost the same requirements for IoT routing mechanism. The recent work of worldwide researchers is focused on this area.

The paper provides the literature review for various standard routing protocols. The different comparative analysis of the routing protocols is done. The paper surveys various routing protocols available for the seamless connectivity of things in IoT. Various features, advantages and challenges of the said protocols are discussed. The protocols are based on the principles of swarm intelligence. Swarm intelligence is applied to achieve optimality and efficiency in solving the complex, multi-hop and dynamic requirements of the wireless networks. The application of the ant colony optimization technique tries to provide answers to many routing issues.

Using the swarm intelligence and ant colony optimization principles, it has been seen that the protocols’ efficiency definitely increases and also provides more scope for the development of more robust, reliable and efficient routing protocols for the IoT.

The existing protocols do not solve all reliability issues and efficient routing is still not achieved completely. As of now no techniques or protocols are efficient enough to cover all the issues and provide the solution. There is a need to develop new protocols for the communication which will cater to all these needs. Efficient and scalable routing protocols adaptable to different scenarios and network size variation capable to find optimal routes are required.

The various routing protocols are discussed and there is also an introduction to new parameters which can strengthen the protocols. This can lead to encouragement of readers, as well as researchers, to analyze and develop new routing algorithms.

The paper provides better understanding of the various routing protocols and provides better comparative analysis for the use of swarm-based research methodology in the development of routing algorithms exclusively for the IoT.

This is a review paper which discusses the various routing protocols available for MANETs and WSNs and provides the groundwork for the development of new intelligent routing protocols for IoT.

With the rapid growth of wireless sensor networks (WSNs), they have become an integral and substantial part of people's life. As such WSN stands as an assuring outlook, but because of sensor's resource limitations and other prerequisites, optimal dual route discovery becomes an issue of concern. WSN along with central sink node is capable of handling wireless transmission, thus optimizing the network's lifetime by selecting the dual path. The major problem confronted in the application of security mechanisms in WSNs is resolving the issues amid reducing consumption of resources and increases security.

According to the proposed system, two metrics, namely, path length and packets delivery ratio are incorporated for identifying dual routes amid the source and destination. Thereafter by making use of the distance metric, the optimal dual route is chosen and data transmission is carried out amid the nodes. With the usage of the recommended routing protocol high packet delivery ratio is achieved with reduced routing overhead and low average end to end delay. It is clearly portrayed in the simulation output that the proposed on demand dual path routing protocol surpasses the prevailing routing protocol. Moreover, security is achieved make use of in accord the data compression reduces the size of the data. With the help of dual path, mathematical model of Finite Automata Theory is derived to transmit data from source to destination. Finite Automata Theory comprises Deterministic Finite Automata (DFA) that is being utilized for Dual Path Selection. In addition, data transition functions are defined for each input stage. In this proposed work, another mathematical model is 10; introduced to efficiently choose an alternate path between a receiver and transmitter for data transfer with qualified node as relay node using RR Algorithm. It also includes Dynamic Mathematical Model for Node Localization to improve the precision in location estimation using Node Localization Algorithm. As a result a simulator is built and various scenarios are elaborated for comparing the performance of the recommended dual path routing protocol with respect to the prevailing ones.

Reliability and fault-tolerance: The actual motive in utilizing the approach of multipath routing in sensor network was to offer path resilience in case of a node or link failures thus ascertaining reliable transmission of data. Usually in a fault tolerant domain, when the sensor node is unable to forward the data packets to the sink, alternative paths can be utilized for recovering its data packets during the failure of any link/node. Load balancing: Load balancing involves equalizing energy consumption of all the existing nodes, thereby degrading them together. Load balancing via clustering improves network scalability. The network's lifetime as well as reliability can be extended if varied energy level's nodes exist in sensor node. Quality of service (QoS): Improvement backing of quality of service with respect to the data delivery ratio, network throughput and end-to-end latency stands very significant in building multipath routing protocols for various network types. Reduced delay: There is a reduced delay in multipath routing since the backup routes are determined at the time of route discovery. Bandwidth aggregation: By dividing the data toward the same destination into multiple streams (by routing all to a separate path) can aggregate the effective bandwidth. The benefit being that, in case a node possesses many links with low bandwidth, it can acquire a bandwidth which is more compared to the individual link.

Few more new algorithms can be used to compare the QoS parameters.

Proposed mechanism with feedback ascertains improvised delivery ratio compared to the single path protocol since in case of link failure, the protocol has alternative route. In case there are 50 nodes in the network, the detection mechanism yields packet delivery of 95% and in case there are 100 nodes, the packet delivery is lowered to 89%. It is observed that the packet rate in the network is more for small node range. When the node count is 200, the packet ratio is low, which is lowered to 85%. With a node count of 400, the curve depicts the value of 87%. Hence, even with a decrease in value, it is superior than the existing protocols. The average end-to-end delay represents the transmission delay of the data packets that have been successfully delivered as depicted in Figure 6 and Table 3. The recommended system presents the queue as well as the propagation delay from the source to destination. The figure depicts that when compared to the single path protocol, the end-to-end delay can be reduced via route switching. End-to-end delay signifies the time acquired for the delay in the receival of the the retransmitted packet by each node. The comparison reveals that the delay was lower compared to the existing ones in the WSN. Proposed protocol aids in reducing consumption of energy in transmitter, receiver and various sensors. Comparative analysis of energy consumptions of the sensor in regard to the recommended system must exhibit reduced energy than the prevailing systems.

On demand dual path routing protocol. Hence it is verified that the on demand routing protocol comprises DFA algorithms determines dual path. Here mathematical model for routing between two nodes with relay node is derived using RR algorithm to determine alternate path and thus reduce energy consumption. Another dynamic mathematical model for node localization is derived using localization algorithm. For transmitting data with a secure and promising QoS in the WSNs, the routing optimization technique has been introduced. The simulation software environment follows the DFA. The simulation yields in improvised performance with respect to packet delivery ratio, throughput, average end-to-end delay and routing overhead. So, it is proved that the DFA possesses the capability of optimizing the routing algorithms which facilitates the multimedia applications over WSNs.

The purpose of this paper is to explore grid‐based routing in wireless sensor networks and to compare the energy available in the network over time for different grid sizes.

The test area is divided into square‐shaped grids of certain length. Energized nodes are placed randomly in the terrain area with the sink node in a fixed position. One node per grid is elected as the leader node based on the highest energy level and the proximity to the centre of the grid. The sink node floods the network to identify a path from sink to source. The path from the sink to the source through the leader nodes are computed using three different methods: shortest path; leader nodes which have the highest energy; and leader nodes based on their received signal strength (RSS) indicator values. After the path is computed, transmission of data is continued until the leader nodes run out of energy. New leader nodes are then elected using the same mechanism to replace the depleted ones.

Identified the optimal grid size to minimize the energy consumption in sensor networks and to extend the network lifetime. Also proposed is a new routing protocol which identifies routes based on energy threshold and RSS threshold.

The use of RSS threshold is identified to be the good metric for path selection in routing the data between source and the sink.

Simulator software and the protocol developed can be used for in optimizing energy efficiency in sensor networks.

This work contributes to the discussion on uniform and non‐uniform grid sizes and emphasizes a new method for reducing the energy consumption by identifying an optimum grid size. It also utilizes bursty data for simulation.

The purpose of this paper is to design a hierarchical routing protocol. Wireless sensor network (WSN) consists of a set of miniature sensor nodes powered by a low-capacity energy battery. This limitation requires that energy is used in an efficient way and kept as long as possible to allow the WSN to accomplish its mission. Thus, energy conservation is a very important problem facing researchers in this context. Because sending and receiving messages is the activity that consumes the most energy in a WSN, so when designing routing protocols, this problem is targeted specifically. The aim of this paper is to propose a solution to this problem by designing a hierarchical routing protocol.

The authors started by designing a protocol called efficient energy-aware distributed clustering (EEADC). Simulation result showed EEADC might generate clusters with very small or very large size. To solve this problem, the authors designed a new algorithm called fixed efficient energy-aware distributed clustering (FEEADC). They concluded from the simulation result that cluster-heads (CHs) far away from the base station die faster than the ones closer to it. To remedy this problem, they propose multi-hop fixed efficient energy-aware distributed clustering (M-FEEADC). It is based on a new fixed clustering mechanism, which aims to create a balanced distribution of CHs. It uses data aggregation and sleep/wakeup techniques.

The simulation results show a significant improvement in terms of energy consumption and network lifetime over the well-known low-energy adaptive clustering hierarchy and threshold-sensitive energy-efficient protocols.

The authors propose M-FEEADC. It is based on a new fixed clustering mechanism, which aims to create a balanced distribution of CHs. It uses data aggregation and sleep/wakeup techniques.

In a mobile ad hoc network (MANET), design of energy‐efficient routing schemes is essential for prolonging the network lifetime. The purpose of this paper is to show that one way to achieve energy efficiency in routing is to utilize location information, which becomes practical due to the recent increasing availability of low‐cost and reliable positioning devices.

This paper proposes an eight‐direction forwarding virtual grid aided (VGA) routing scheme that uses location information to save energy. As a grid‐based scheme, VGA divides the whole network area into virtual grids.

By using eight‐direction forwarding, the proposed VGA scheme outperforms the previous four‐direction forwarding geographical adaptive fidelity (GAF) protocol. The proposed VGA scheme is motivated by the fact that, in the GAF protocol, forwarding to the four diagonal neighboring grids cannot be done in one single hop, although most nodes in these grids can hear the signal.

Theoretical analysis shows the eight‐direction forwarding protocol performs better than the four‐direction one unless the forwarding direction has an angle of less than 15^○ with the horizontal or vertical grid axis. Simulation supports the fact that the eight‐direction forwarding VGA scheme has better energy performance than the four‐direction forwarding GAF scheme without sacrificing any routing performance.