Reliable data delivery in low energy ad hoc sensor networks

Reliable delivery of data is a classical design goal for reliability-oriented collection routing protocols for ad hoc wireless sensor networks (WSNs). Guaranteed packet delivery performance can be ensured by careful selection of error free links, quick recovery from packet losses, and avoidance of overloaded relay sensor nodes. Due to limited resources of individual senor nodes, there is usually a trade-off between energy spending for packets transmissions and the appropriate level of reliability. Since link failures and packet losses are unavoidable, sensor networks may tolerate a certain level of reliability without significantly affecting packets delivery performance and data aggregation accuracy in favor of efficient energy consumption. However a certain degree of reliability is needed, especially when hop count increases between source sensor nodes and the base station as a single lost packet may result in loss of a large amount of aggregated data along longer hops. An effective solution is to jointly make a trade-off between energy, reliability, cost, and agility while improving packet delivery, maintaining low packet error ratio, minimizing unnecessary packets transmissions, and adaptively reducing control traffic in favor of high success reception ratios of representative data packets. Based on this approach, the proposed routing protocol can achieve moderate energy consumption and high packet delivery ratio even with high link failure rates. The proposed routing protocol was experimentally investigated on a testbed of Crossbow's TelosB motes and proven to be more robust and energy efficient than the current implementation of TinyOS2.x MultihopLQI

Reliable routing scheme for indoor sensor networks

Indoor Wireless sensor networks require a highly dynamic, adaptive routing scheme to deal with the high rate of topology changes due to fading of indoor wireless channels. Besides that, energy consumption rate needs to be consistently distributed among sensor nodes and efficient utilization of battery power is essential. If only the link reliability metric is considered in the routing scheme, it may create long hops routes, and the high quality paths will be frequently used. This leads to shorter lifetime of such paths; thereby the entire network's lifetime will be significantly minimized. This paper briefly presents a reliable load-balanced routing (RLBR) scheme for indoor ad hoc wireless sensor networks, which integrates routing information from different layers. The proposed scheme aims to redistribute the relaying workload and the energy usage among relay sensor nodes to achieve balanced energy dissipation; thereby maximizing the functional network lifetime. RLBR scheme was tested and benchmarked against the TinyOS-2.x implementation of MintRoute on an indoor testbed comprising 20 Mica2 motes and low power listening (LPL) link layer provided by CC1000 radio. RLBR scheme consumes less energy for communications while reducing topology repair latency and achieves better connectivity and communication reliability in terms of end-to-end packets delivery performance

Traffic eavesdropping based scheme to deliver time-sensitive data in sensor networks

Due to the broadcast nature of wireless channels, neighbouring sensor nodes may overhear packets transmissions from each other even if they are not the intended recipients of these transmissions. This redundant packet reception leads to unnecessary expenditure of battery energy of the recipients. Particularly in highly dense sensor networks, overhearing or eavesdropping overheads can constitute a significant fraction of the total energy consumption. Since overhearing of wireless traffic is unavoidable and sometimes essential, a new distributed energy efficient scheme is proposed in this paper. This new scheme exploits the inevitable overhearing effect as an effective approach in order to collect the required information to perform energy efficient delivery for data aggregation. Based on this approach, the proposed scheme achieves moderate energy consumption and high packet delivery rate notwithstanding the occurrence of high link failure rates. The performance of the proposed scheme is experimentally investigated a testbed of TelosB motes in addition to ns-2 simulations to validate the performed experiments on large-scale network

Coherent, automatic address resolution for vehicular ad hoc networks

Published in: Int. J. of Ad Hoc and Ubiquitous Computing, 2017 Vol.25, No.3, pp.163 - 179. DOI: 10.1504/IJAHUC.2017.10001935The interest in vehicular communications has increased notably. In this paper, the use of the address resolution (AR) procedures is studied for vehicular ad hoc networks (VANETs). We analyse the poor performance of AR transactions in such networks and we present a new proposal called coherent, automatic address resolution (CAAR). Our approach inhibits the use of AR transactions and instead increases the usefulness of routing signalling to automatically match the IP and MAC addresses. Through extensive simulations in realistic VANET scenarios using the Estinet simulator, we compare our proposal CAAR to classical AR and to another of our proposals that enhances AR for mobile wireless networks, called AR+. In addition, we present a performance evaluation of the behaviour of CAAR, AR and AR+ with unicast traffic of a reporting service for VANETs. Results show that CAAR outperforms the other two solutions in terms of packet losses and furthermore, it does not introduce additional overhead.Postprint (published version

Hop-limited routing for multihop cellular networks

In recent years, conventional cellular systems have experienced evolution in fields of data oriented services. During this period, the requirement for high data-rate stimulated new research proposals, which resulted in a new architecture: Multihop Cellular Networks (MCN), where multihop structure enables mobile stations to forward packets from other mobile stations to the base station on the uplink, and in turn, forward packets to other mobile stations from the base station on the downlink. In this thesis, a new routing algorithm is introduced for MCNs in order to limit the number of hops between the base station and the mobile stations with given delay constraints. The capacity of MCNs is restricted due to intensive traffic in the network since all nodes has the capability of sending packets simultaneously. The analysis of average end-to-end delay in high bitrate data transmission reveals that minimizing end-to-end delay with a proper scheduling scheme guarantees the aim of limiting number of hops in MCNs. The proposed algorithm showed that the intensive traffic can be absorbed by the base station by limiting the number of hops between the base station and the mobile stations

Route discovery based on energy-distance aware routing scheme for MANET

Route discovery proses in a Mobile Ad hoc Network (MANET) is challenging due to the limitation of energy at each network node. The energy constraint limits network connection lifetime thus affecting the routing process. Therefore, it is necessary for each node in the network to calculate routing factor in terms of energy and distance in deciding optimal candidate relay nodes needed to forward packets. This study proposes a new route discovery mechanism called the Energy-Distance Routing Aware (EDRA) that determines the selection of nodes during route discovery process to improve the network connection lifetime. This mechanism comprises of three schemes namely the Energy-Distance Factor Aware (EDFA), the Energy-Distance Forward Strategy (EDFS), and the Energy-Aware Route Selection (EARS). The EDFA scheme begins by calculating each nodes energy level (ei) and the distance (di) to the neighbouring nodes to produce the energy-distance factor value used in selecting the relay nodes. Next, the EDFS scheme forwards route request packets within discovery area of relay nodes based on the number of nodes. Then, the EARS scheme selects stable routing path utilising updated status information from EDFA and EDFS. The evaluation of EDRA mechanism is performed using network simulator Ns2 based on a defined set of performance metrics, scenarios and network scalability. The experimental results show that the EDRA gains significant improvement in the network connection lifetime when compared to those of the similar mechanisms, namely the AODV and the DREAM. EDRA also optimises energy consumption by utilising efficient forwarding decisions on varying scale of network nodes. Moreover, EDRA maximizes network connection lifetime while preserving throughput and packet drop ratio. This study contributes toward developing an efficient energy-aware routing to sustain longer network connection lifetime in MANET environment. The contribution is significant in promoting the use of green and sustainable next generation network technology

Identifying Design Requirements for Wireless Routing Link Metrics

In this paper, we identify and analyze the requirements to design a new routing link metric for wireless multihop networks. Considering these requirements, when a link metric is proposed, then both the design and implementation of the link metric with a routing protocol become easy. Secondly, the underlying network issues can easily be tackled. Thirdly, an appreciable performance of the network is guaranteed. Along with the existing implementation of three link metrics Expected Transmission Count (ETX), Minimum Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with Optimized Link State Routing (OLSR) using NS-2.34. The simulation results show that how the computational burden of a metric degrades the performance of the respective protocol and how a metric has to trade-off between different performance parameters