Improving assurance of a sustainable route-split MANET routing by adapting node battery exhaustion

Assurance networks are designed to realize trustable Internet-Of-Things including terminal devices/infrastructure service applications for new generation networks. To construct assurance networks, it is necessary to evaluate them quantitatively. In this paper, we provide one of case studies to evaluate them quantitatively. In mobile ad hoc networks (MANETs), the network environments change over time due to the movement of nodes, the battery level of nodes, and so on. Assurance networks must maintain high performance even when such diverse changes of the network environments occur in the widely applicable domain. And if their performance degrades, they must early recover from the changes. So far, we have proposed a routing method for MANETs, called Route-Split Routing (RSR). RSR can suppress escalation of control packets in large scale MANETs. However, with RSR, drawbacks occur when some nodes exhaust their batteries. In this paper, we propose a sustainable route-split routing scheme to improve assurance by adapting node faults due to battery exhaustion for MANETs. To evaluate the assurance of the proposed method, we have implemented it with a simulator and have conducted simulation experiments. The results indicate that the proposed method can maintain high throughput when some nodes experience various levels of battery power and power consumption and even when some nodes die simultaneously.     

The challenges of disconnected delay-tolerant MANETs

This article is concerned with the challenges associated with supporting communication in disconnected MANETs with such a sparse population of nodes and so little (or no) fixed infrastructure that the network graph is rarely, if ever, connected. The networks considered are autonomous and do not depend on established infrastructure. The disconnected nature and the lack of end-to-end connectivity between nodes mean that the communication must be delay-tolerant. We refer to such a networks as Disconnected Delay-Tolerant MANETs (DDTMs). In general the challenges associated with mobile computing are not new. However, issues in wireless communication such as low bandwidth, disconnections and high bandwidth variability are problematic and further exacerbated in DDTMs by little or no infrastructure, variable node population and lossy links. DDTMs additionally face challenges of mobility which is frequent and uncontrolled resulting in a highly dynamic topology and disconnected network graph. In addition, portability remains a challenge, where battery power, memory and processing power are limited. The challenges are presented using a two-tier classification scheme that allows their causes and inter-dependencies to be mapped.     

IIPP: integrated IP paging protocol with a power save mechanism

The advent of advanced mobile/wireless systems has been facilitating the battery‐powered mobile computing devices (nodes) to remain always connected to the internet. However, until now, the power‐drain rate of mobile nodes is very high in comparison with the available power of portable batteries. To reduce the energy consumption of mobile nodes, we present an integrated IP paging protocol (IIPP) by integrating the IP‐layer paging protocol based on Mobile IPv4 regional registration (MIPRR) with a power save mechanism. IIPP reduces the frequency of signaling messages between mobile nodes and networks. When not sending or receiving data for a certain time, mobile nodes enter power save mode (PSM), and consume very low power. We formulate analytical models and carry out simulations to evaluate the proposed IIPP. The results show that, compared to MIPRR, IIPP significantly reduces the average power consumption of the mobile node and signaling overheads in the network. Copyright © 2006 John Wiley & Sons, Ltd.     

QoS evaluation of energy-efficient ML-MAC protocol for wireless sensor networks

Power management is an important issue in wireless sensor networks (WSNs) because wireless sensor nodes are usually battery powered, and an efficient use of the available battery power becomes an important concern specially for those applications where the system is expected to operate for long durations. This necessity for energy efficient operation of a WSN has prompted the development of new protocols in all layers of the communication stack. If the radio transceiver is the most power consuming component of a typical sensor node, large gains can be achieved at the link layer where the medium access control (MAC) protocol controls the usage of the radio transceiver unit.     

Smart dual battery management system for expanding lifespan of wireless sensor node

Wireless sensor nodes have huge energy demand for their operations; they are deployed in remote locations for various applications like weather, industrial, satellite, construction, banking, and medical. Sensor nodes require continuous or uninterrupted power supply during their life cycles. When the available renewable power sources are not sufficient to run the system, the batteries are required to deliver a continuous and uninterrupted power supply. The main focus of proposed model is to design and develop a smart dual battery management system along with a hybrid energy harvesting model that can provide reliable and efficient power support to the sensor node. The problem under consideration also focuses on reducing the state of health degradation of batteries by applying a smart battery charging methodology using an ANFIS (adaptive neuro-fuzzy inference system) controller. The proposed power management system ensures and meets the expected objectives such as switching of power sources, smart battery charging methodology (constant current and constant voltage [CC-CV]), and dual battery power support using ANFIS controller. The result was obtained through the simulation and hardware prototype of the proposed system work flawlessly to meet the desired objective with partial charging and discharging of batteries for the prevention of battery degradation and also enhance the lifespan of the batteries.     

A Distributed Query Protocol in Wireless Sensor Networks

In wireless sensor networks, query execution over a specific geographical region is an essential function for collecting sensed data. However, sensor nodes deployed in sensor networks have limited battery power. Hence, the minimum number of connected sensor nodes that covers the queried region in a sensor network must be determined. This paper proposes an efficient distributed protocol to find a subset of connected sensor nodes to cover the queried region. Each node determines whether to be a sensing node to sense the queried region according to its priority. The proposed protocol can efficiently construct a subset of connected sensing nodes and respond the query request to the sink node. In addition, the proposed protocol is extended to solve the k-coverage request. Simulation results show that our protocol is more efficient and has a lower communication overhead than the existing protocol.     

Relaying in mobile ad hoc networks: The Brownian motion mobility model

Mobile ad hoc networks are characterized by a lack of a fixed infrastructure and by node mobility. In these networks data transfer can be improved by using mobile nodes as relay nodes. As a result, transmission power and the movement pattern of the nodes have a key impact on the performance. In this work we focus on the impact of node mobility through the analysis of a simple one-dimensional ad hoc network topology. Nodes move in adjacent segments with reflecting boundaries according to Brownian motions. Communications (or relays) between nodes can occur only when they are within transmission range of each other. We determine the expected time to relay a message and compute the probability density function of relaying locations. We also provide an approximation formula for the expected relay time between any pair of mobiles.     

Collaborative Polling based Routing Security Scheme to Mitigate the Colluding Misbehaving Nodes in Mobile Ad Hoc Networks

The recent advancements in the field of wireless communications makes the mobile devices to communicate with each other in a self organized manner without relying on stable infrastructure. It requires cooperation between the mobile devices in order to find routes between them when the nodes are not in the communication range of each other. The misbehaving node comes into existence due to scarcely available resources such as battery, bandwidth and computational power. When the nodes collude to misbehave then it further makes the routing process difficult due to frequent network partitioning and it also degrades the overall network throughput. This paper proposes a Collaborative Polling based Routing Security Scheme to detect and isolate the colluding misbehaving nodes in mobile ad hoc networks. The proposed system employs a timeout approach to detect the active neighbors in the neighborhood before monitoring the transmissions which involves it. It ensures that the false detection of a good node as a bad one has been greatly reduced which in turn decreases the send buffer drop because of the availability of alternate routes. The simulation result shows that the measured parameters such as packet drop ratio and malicious drop has been reduced due to the efficient detection and isolation of misbehaving nodes. This paper also presents an analytical and simulation results of the impact of node misbehavior.     

A distributed battery recovery aware topology control algorithm for wireless sensor networks

Battery recovery effect is a phenomenon that the available capacity of a battery could increase if the battery can sleep for a certain period of time since its last discharging. Accordingly, the battery can work for a longer time when it takes some rests between consecutive discharging processes than when it works all the time. However, this effect has not been considered in the design of energy‐efficient topology control algorithms for wireless sensor networks. In this paper, we propose a distributed battery recovery effect aware connected dominating set constructing algorithm (BRE‐CDS) for wireless sensor networks. In BRE‐CDS, each network node periodically decides to join the connected dominating set or not. Nodes that have slept in the preceding round have priority to join the connected dominating set in the current round while nodes that have worked in the preceding round are encouraged to take sleep in the current round for battery recovery. Detailed algorithm design is presented. The computational complexity of BRE‐CDS is deduced to be O(D²), where D is node degree. Simulation results show that BRE‐CDS can significantly prolong the network lifetime as compared with existing work. Copyright © 2016 John Wiley & Sons, Ltd.     

Gateway load balancing using multiple QoS parameters in a hybrid MANET

A Mobile ad hoc network (MANET) is a self configurable wireless network in which mobile nodes communicate with each other in a multihop fashion without any pre-installed infrastructure. A MANET can be considered to be a standalone network. To enhance the connectivity of a MANET it can be connected to the fixed network, thus forming a heterogeneous network. The integration of MANET and the Internet is called a hybrid MANET which is facilitated by special nodes called Internet gateway nodes. Load balancing among gateways is a challenging task when a MANET is connected to Internet. Gateway nodes with higher loads will lead to disconnected networks and depletes the node’s resources which include their batteries, memory and bandwidth quickly. Gateway selection based on the shortest path may increase traffic concentration on one particular gateway which leads to congestion and increases delay in the network. In this paper a QoS based load balancing mechanism has been proposed among multiple gateway nodes that provide communication between mobile nodes and fixed nodes in the Internet to select lightly loaded gateways so that more packets will be delivered to the fixed host in the Internet. The proposed QoS based scheme selects four QoS parameters that are (1) connecting degree, (2) interface queue length, (3) routing table entries and (4) hop count. A weight based method is used to select the gateway which combines all four QoS metrics. Simulation results demonstrate that when compared with individual parameter, the average ETE delay, queue size and traffic load of gateway generated by proposed algorithm is decreased by 17, 25 and 15 % respectively and when compared with existing schemes, the average ETE delay, queue size and traffic load of gateway is decreased by 25, 25 and 16 % respectively.     

Evaluation of Clustering Algorithms in Ad Hoc Mobile Networks

Ad hoc mobile networks are free of any infrastructures and their nodes are not aware of the connections of the network locating in, since the structure of these networks is dynamic. To send data to other nodes, each node should detect the sending path and then save it. Due to their dynamic nature, these types of networks face design complexity and limitations such as a lack of specific infrastructure and the change of the infrastructure with passing the time, the limitation of energy, bandwidth, and the considerations of quality and security. Therefore, bandwidth optimization, power and energy control and an improvement in transmission quality are challenges of these types of networks in routing. To meet these challenges, the node clustering methods were welcomed for less energy consumption and longer network lifetime. In this paper, we deal with a systematic literature review of different clustering methods and propose a general categorization for them. Furthermore, we compare the performance the methods as well as the related algorithms and their strengths and weaknesses. Finally, we rank the algorithms regarding the four parameters of transmission range, mobility speed, battery, and connectivity degree using the multi-criterion decision-making and analytical hierarchical process techniques.

     

一种基于链路稳定的能量有效AODV路由协议

在移动自组网中,减少移动节点电池能量消耗,延长网络总的使用时间,成为路由协议性能优劣的一个很重要的指标.本文介绍了一种关于节点能量估价PCF(Power Cost Function)的计算方法,它动态地反映了节点能量的剩余和使用情况,能够成功找到一条路径上的能量瓶颈节点.并且基于移动预测思想,综合考虑路径的总能耗最小和能量瓶颈节点的PCF两种情况,提出了基于链路稳定的能量有效AODV路由协议E-AODV(An Energy-efficient AODV routing protocol based on link stability).模拟结果表明E-AODV协议比AODV路由协议具有更好的能量效率,它延长了节点的生存时间,提高了数据包的到达率.     

Voltage equaliser for Li–Fe battery

In this article, a voltage equaliser is proposed for a battery string with four Li–Fe batteries. The proposed voltage equaliser is developed from a flyback converter, which comprises a transformer, a power electronic switch and a resonant clamped circuit. The transformer contains a primary winding and four secondary windings with the same number of turns connected to each battery. The resonant clamped circuit is for recycling the energy of leakage inductance of the transformer and for performing zero-voltage switching (ZVS) of the power electronic switch. When the power electronic switch is switched on, the energy is stored in the transformer; and when the power electronic switch is switched off, the energy stored in the transformer will automatically charge the battery whose voltage is the lowest. In this way, the voltage of individual batteries in the battery string is balanced. The salient features of the proposed voltage equaliser are that only one switch is used, the energy stored in the leakage inductance of the transformer can be recycled and ZVS is obtained. A prototype is developed and tested to verify the performance of the proposed voltage equaliser. The experimental results show that the proposed voltage equaliser achieves the expected performance.     

Cooperative and Reliable ARQ Protocols for Energy Harvesting Wireless Sensor Nodes

One class of wireless sensor networks makes use of sensor nodes that recharge their batteries by harvesting energy from the surrounding environment. Being continuously recharged, the battery does not need to be replaced regularly and the sensor node is maintenance-free. A key module in such sensor network solutions is the data link automatic repeat request (ARQ) protocol, which must be designed to reliably deliver sensor nodes data at the minimum energy cost. With this objective in mind, two ARQ protocol classes are compared. In one class, each sensor node operates individually. In the other, the concept of cooperative communications is adopted, whereby neighboring sensor nodes help each other during the retransmission process. It is shown that the use of cooperative ARQ protocols in energy harvesting sensor networks enables sensor nodes to balance their energy consumption to match their own battery recharge rate. In turn, a balanced energy consumption-to-recharge rate ratio has the potential to improve the network throughput. Both classes of ARQ protocols are analyzed and compared. Estimated throughput gains are discussed under various network scenarios.     

Simple,secure, and lightweight mechanism for mutual authentication of nodes in tiny wireless sensor networks

Wireless sensor networks (WSNs) are widely used in large areas of applications; due to advancements in technology, very tiny sensors are readily available, and their usage reduces the cost. The mechanisms designed for wireless networks cannot be implied on networks with tiny nodes due to battery and computational constraints. Understanding the significance of security in WSNs and resource constraintness of tiny WSNs, we propose a node authentication mechanism for nodes in wireless sensor networks to avoid security attacks and establish secure communication between them. In the proposed mechanism, a base station (BS) generates a secret value and random value for each sensor node and stores at the node. The sensor node authenticates using secret value and random number. Random nonce ensures freshness, efficiency, and robustness. The proposed mechanism is lightweight cryptographic, hence requires very less computational, communication, and storage resources. Security analysis of the proposed mechanism could not detect any security attack on it, and the mechanism was found to incur less storage, communication, and computation overheads. Hence, the proposed mechanism is best suitable for wireless sensor networks with tiny nodes.     

Power-aware routing protocols in ad hoc wireless networks

An ad hoc wireless network has no fixed networking infrastructure. It consists of multiple, possibly mobile, nodes that maintain network connectivity through wireless communications. Such a network has practical applications in areas where it may not be economically practical or physically possible to provide a conventional networking infrastructure. The nodes in an ad hoc wireless network are typically powered by batteries with a limited energy supply. One of the most important and challenging issues in ad hoc wireless networks is how to conserve energy, maximizing the lifetime of its nodes and thus of the network itself. Since routing is an essential function in these networks, developing power-aware routing protocols for ad hoc wireless networks has been an intensive research area in recent years. As a result, many power-aware routing protocols have been proposed from a variety of perspectives. This article surveys the current state of power-aware routing protocols in ad hoc wireless networks.     

Minimum-energy all-to-all multicasting in wireless ad hoc networks

A wireless ad hoc network consists of mobile nodes that are powered by batteries. The limited battery lifetime imposes a severe constraint on the network performance, energy conservation in such a network thus is of paramount importance, and energy efficient operations are critical to prolong the lifetime of the network. All-to-all multicasting is one fundamental operation in wireless ad hoc networks, in this paper we focus on the design of energy efficient routing algorithms for this operation. Specifically, we consider the following minimum-energy all-to-all multicasting problem. Given an all-to-all multicast session consisting of a set of terminal nodes in a wireless ad hoc network, where the transmission power of each node is either fixed or adjustable, assume that each terminal node has a message to share with each other, the problem is to build a shared multicast tree spanning all terminal nodes such that the total energy consumption of realizing the all-to-all multicast session by the tree is minimized. We first show that this problem is NP-Complete. We then devise approximation algorithms with guaranteed approximation ratios. We also provide a distributed implementation of the proposed algorithm. We finally conduct experiments by simulations to evaluate the performance of the proposed algorithm. The experimental results demonstrate that the proposed algorithm significantly outperforms all the other known algorithms.     

A Power-Aware Multicast Routing Protocol for Mobile Ad Hoc Networks With Mobility Prediction

A mobile ad hoc network (MANET) is a dynamically reconfigurable wireless network that does not have a fixed infrastructure. Due to the high mobility of nodes, the network topology of MANETs changes very fast, making it more difficult to find the routes that message packets use. Because mobile nodes have limited battery power, it is therefore very important to use energy in a MANET efficiently. In this paper, we propose a power-aware multicast routing protocol (PMRP) with mobility prediction for MANETs. In order to select a subset of paths that provide increased stability and reliability of routes, in routing discovery, each node receives the RREQ packet and uses the power-aware metric to get in advance the power consumption of transmitted data packets. If the node has enough remaining power to transmit data packets, it uses the global positioning system (GPS) to get the location information (i.e., position, velocity and direction) of the mobile nodes and utilizes this information to calculate the link expiration time (LET) between two connected mobile nodes. During route discovery, each destination node selects the routing path with the smallest LET and uses this smallest link expiration time as the route expiration time (RET). Each destination node collects several feasible routes and then selects the path with the longest RET value as the primary routing path. Then the source node uses these routes between the source node and each destination node to create a multicast tree. In the multicast tree, the source node will be the root node and the destination nodes will be the leaf nodes. Simulation results show that the proposed PMRP outperforms MAODV (Royer, E. M. & Perkins, C. E. (1999). In Proceedings of the ACM MOBICOM, pp. 207–218, August 1999.) and RMAODV (Baolin, S. & Layuan, L. (2005). In Proceeding of the 2005 IEEE International symposium on microwave antenna, propagation and EMC technologies for wireless communications, Vol. 2, pp. 1514–1517, August 2005.).     

Reliability modeling and planning of energy harvesting based on uncertainty theory

Energy harvesting network is a new form of computer networks.It can convert the environmental energy into usable electric energy,and supply the electrical energy as a primary or secondary power source to the electronic device for network communication.However,the energy harvesting process has great volatility and uncertainty,the traditional analytical method based on probability distribution function to describe the energy collection process can not accurately simulate the actual situation,resulting in higher depletion probability of nodes,then the reliability cannot be guaranteed as a result.For this,the energy harvesting reliability of energy harvesting nodes was defined,represented with the degree of normal operation,respectively set up the node reliability models with no battery and infinite battery.As an example for maximum node achievable rate,the uncertain multilevel programming model based on node reliability was put forward,then the network efficiency was improved under the premise of ensuring node reliability.An energy average allocation (EAA) algorithm was proposed and the upper bound of competitive ratio of the algorithm was proved theoretically.Finally,the actual wind power data was taken as an example to verify the feasibility and effectiveness of the proposed model and method.     

ARDEN: Anonymous networking in delay tolerant networks

Delay Tolerant Networks (DTNs) provide a communications infrastructure for environments lacking continuous connectivity. Such networks rely on the mobility of nodes and the resulting opportunistic connections to carry messages from source to destination. Unfortunately, exchanging packets with an arbitrary intermediary node makes privacy difficult to achieve in these systems as any adversary can easily act as an intermediary and determine the sender and receiver of a message. In this paper, we present ARDEN, an anonymous communication mechanism for DTNs based on a modified onion routing architecture. Instead of selecting specific nodes through which messages must pass as is traditionally done in onion routing, ARDEN uses Attribute-Based Encryption (ABE) to specify and manage groups that may decrypt and forward messages. Through simulation, we show that this approach not only increases throughput and reduces end-to-end latency over traditional onion routing techniques, but also adds minimal overhead when compared to DTN routing protocols that do not provide anonymity guarantees. Through this, we show that ARDEN is an effective solution for anonymous communication in intermittently connected networks such as DTNs.