A synchronous duty-cycled reservation based MAC protocol for underwater wireless sensor networks

To design an energy-efficient Medium Access Control (MAC) protocol for the Underwater Wireless Sensor Networks (UWSNs) is an urgent research issue since depleted batteries cannot be recharged or replaced in the underwater environment. Moreover, the underwater acoustic channels are affected by hindrances such as long propagation delay and limited bandwidth, which appear in the design of the MAC protocol for the UWSNs. The available MAC protocols for the terrestrial wireless sensor networks exhibit low performance in energy efficiency, throughput and reliability in the UWSNs, and cannot be used in the UWSNs directly because of their unique characteristics. This paper proposes a synchronous duty-cycled reservation-based MAC protocol named Ordered Contention MAC (OCMAC) protocol. The basic mechanism of this protocol is to schedule data transmission by transmitters through the scheduling of Ready To Send (RTS) frames. The protocol eliminates the possible collision during data transmission and improves communication efficiency. The paper analyzes the performance in energy efficiency, throughput and reliability of the protocol by modeling the queuing behavior of OCMAC with a Markov Chain process. Furthermore, the analytical model is validated through a simulation study. The analysis results demonstrated that while providing good throughput and reliability, OCMAC can achieve energy saving.     

A dual-mode energy efficient encryption protocol for wireless sensor networks

This paper presents a novel link-layer encryption protocol for wireless sensor networks. The protocol design aims to reduce energy consumption by reducing security related communication overhead. This is done by merging security related data of consecutive packets. The merging (or combining packets) based on simple mathematical operations helps to reduce energy consumption by eliminating the requirement to send security related fields in headers and trailers. We name our protocol as the Compact Security Protocol referred to as C-Sec. In addition to energy savings, the C-Sec protocol also includes a unique security feature of hiding the packet header information. This feature makes it more difficult to trace the flow of wireless communication, and helps to minimize the cost of defending against replay attacks. We performed rigorous testing of the C-Sec protocol and compared it with well-known protocols including TinySec, MiniSec, SNEP and Zigbee. Our performance evaluation demonstrates that the C-Sec protocol outperforms other protocols in terms of energy savings. We also evaluated our protocol with respect to other performance metrics including queuing delay and error probability.     

A power controlled interference aware routing protocol for dense multi-hop wireless networks

A key issue impacting the performance of multi-hop wireless networks is the interference among neighboring nodes. In this paper, we propose a novel and practical interference aware metric, termed as Network Allocation Vector Count (NAVC), to estimate the effects of the interference on the average delay and the available bandwidth. This metric can be easily applied to routing protocols designed for 802.11 based multi-hop networks with no modification to the current 802.11 protocol. The design of NAVC as a metric for the AODV [32] routing protocol, as well as a metric for transmit power control, are described in detail. Our simulation results reveal that the NAVC-driven AODV can greatly improve its performance compared to those protocols based on hop-count. For scenarios of densely deployed nodes, the throughput improvement is often a factor near two, indicating that NAVC is more useful as networks grow denser. Moreover, the network lifetime can be notably prolonged when the NAVC is employed to conduct transmit power control. Our approach is essential for emerging applications such as wireless sensor networks where the interference is heavy and the energy is severely constrained.     

Cross-layer congestion control in ad hoc wireless networks

The paper presents the problem of performance degradation of transport layer protocols due to congestion of wireless local area networks. Following the analysis of available solutions to this problem, a cross-layer congestion avoidance scheme (C³TCP) is presented, able to obtain higher performance by gathering capacity information such as bandwidth and delay at the link layer. The method requires the introduction of an additional module within the protocol stack of the mobile node, able to adjust the outgoing data stream based on capacity measurements. Moreover, a proposal to provide optional field support to existing IEEE 802.11 protocol, in order to support the presented congestion control solution as well as many other similar approaches, is presented. Achieved results underline good agreement with design considerations and high utilization of the available resources.     

Localized broadcast incremental power protocol for wireless ad hoc networks

We investigate broadcasting and energy preservation in ad hoc networks. One of the best known algorithm, the Broadcast Incremental Power (BIP) protocol, constructs an efficient spanning tree rooted at a given node. It offers very good results in terms of energy savings, but its computation is centralized and it is a real problem in ad hoc networks. Distributed versions have been proposed, but they require a huge transmission overhead for information exchange. Other localized protocols have been proposed, but none of them has ever reached the performances of BIP. In this paper, we propose and analyze an incremental localized version of this protocol. In our method, the packet is sent from node to node based on local BIP trees computed by each node in the broadcasting chain. Local trees are constructed within the k-hop neighborhood of nodes, based on information provided by previous nodes, so that a global broadcasting structure is incrementally built as the message is being propagated through the network. Only the source node computes an initially empty tree to initiate the process. Discussion and results are provided where we argue that k = 2 is the best compromise for efficiency. We also discuss potential conflicts that can arise from the incremental process. We finally provide experimental results showing that this new protocol obtains very good results for low densities, and is almost as efficient as BIP for higher densities.     

Combined spatial-temporal energy harvesting and relay selection for cognitive wireless powered networks

In order to improve the Energy Efficiency (EE) and spectrum utilization of Cognitive Wireless Powered Networks (CWPNs), a combined spatial-temporal Energy Harvesting (EH) and relay selection scheme is proposed. In the proposed scheme, for protecting the Primary User (PU), a two-layer guard zone is set outside the PU based on the outage probability threshold of the PU. Moreover, to increase the energy of the CWPNs, the EH zone in the two-layer guard zone allows the Secondary Users (SUs) to spatially harvest energy from the Radio Frequency (RF) signals of temporally active PUs. To improve the utilization of the PU spectrum, the guard zone outside the EH zone allows for the constrained power transmission of SUs. Moreover, the relay selection transmission is designed in the transmission zone of the SU to improve the EE of the CWPNs. In addition to the EE of the CWPNs, the outage probabilities of the SU and PU are derived. The results reveal that the setting of a two-layer guard zone can effectively reduce the outage probability of the PU and improve the EE of CWPNs. Furthermore, the relay selection transmission decreases the outage probabilities of the SUs.     

Framed slotted aloha based MAC protocol for low energy critical infrastructure monitoring networks

Recently, the IEEE TG4k has been formed to amend the IEEE 802.15 family to address the low energy critical infrastructure monitoring networks. The purpose is to facilitate point to multi‐thousands of point communication to collect the scheduled and event data from a large number of nonmains powered endpoints that are widely dispersed. It should support low energy operation, which is necessary for multiyear battery life. Other major features are application data rate up to 40 Kb/s, thousands of endpoints per mains powered infrastructure, asymmetric application data flow, small and infrequent messages, tolerant to data latency, etc. In this paper, we present a discussion on low energy critical infrastructure monitoring networks. We propose a medium access control protocol based on framed slotted aloha for these networks. We investigated probable packet sizes, energy consumptions, battery lifetime and the success rate for our protocol. The proposed protocol is simple to implement. Simulation results show that it is efficient in terms of packet success rate, energy consumption, and battery lifetime.Copyright © 2012 John Wiley & Sons, Ltd.     

Adaptive concentric chains protocol for energy efficient routing in wireless sensor networks

This paper addresses the energy efficiency of data collection based on a concentric chain clustering topology for wireless sensor networks (WSNs). To conserve the energy dissipation of nodes spent in data routing, the paper attempts to take advantage of the two opportunities: (a) the impact of the relative positions of wireless nodes to the base station on the energy efficiency of the routing chain within each cluster; (b) the effect of the varying‐sized chains on the selection rule of cluster heads (CHs). To establish an energy‐efficient chain to connect all the nodes in a cluster, the paper proposes a principal vector projection approach, which takes into account both the position of each node and that of the base station, to determine the order to which a node can be linked into the chain in order to reduce the energy requirement of the chain. Since the CH selection rules in the concentric chains are mutually independent, solely based on their self‐cluster sizes, the multi‐hop path passing through all the CHs will consist of longer links and thus consume a significant fraction of the total energy. Thus, in order to suppress the effect of the unequal cluster sizes on decreasing the energy efficiency of the multi‐hop path of CHs, the paper offers an average‐cluster‐size‐based rule (ACSB) for each cluster in order to adapt the CH selection with both the number of active nodes in the current cluster and the average value of all cluster sizes. With these two proposed schemes, an adaptive concentric chain‐based routing algorithm is proposed which enables nodes to collaboratively reduce the energy dissipation incurred in gathering sensory data. By computer simulation, the results demonstrate that the proposed algorithm performs better than other similar protocols in terms of energy saved and lifetime increased capabilities for WSNs which deploy random sensor nodes. Copyright © 2010 John Wiley & Sons, Ltd.     

Channelization for dynamic multi-frequency, multi-hop wireless cellular networks

Multi-hop relaying in cellular networks can greatly increase capacity and performance by exploiting the best available links to a base station. We envision an environment in which relay networks are dynamically formed when performance on the radio access network is degraded and then dissolved when the performance improves or the radio spectrum on which the relay network is operating is reclaimed. Each relay network operates on a different frequency band. Likewise, a relay network may channelize its frequency band to offer non-interfering links among the mobile nodes within a single relay network. We propose a set of algorithms used to form such relay networks on-demand. Each algorithm provides a simple and distributed frequency assignment scheme. We also propose two enhancements to improve network throughput of resulting relay networks. We evaluate these algorithms in terms of the overhead of the relay network formation. The evaluation results show that having nodes outmost from the BS initiate route discovery first is the best approach for reducing the formation overhead. The results also show that there is a large increase in throughput when using multiple frequencies in a relay network. Further, the performance of the network using multiple frequencies based on our simple frequency assignment is very close to that of a network using optimal frequency assignment.     

Trust-aware secure routing protocol for wireless sensor networks

A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.     

Multi‐cost routing for energy and capacity constrained wireless mesh networks

We propose a class of novel energy‐efficient multi‐cost routing algorithms for wireless mesh networks, and evaluate their performance. In multi‐cost routing, a vector of cost parameters is assigned to each network link, from which the cost vectors of candidate paths are calculated using appropriate operators. In the end these parameters are combined in various optimization functions, corresponding to different routing algorithms, for selecting the optimal path. We evaluate the performance of the proposed energy‐aware multi‐cost routing algorithms under two models. In the network evacuation model, the network starts with a number of packets that have to be transmitted and an amount of energy per node, and the objective is to serve the packets in the smallest number of steps, or serve as many packets as possible before the energy is depleted. In the dynamic one‐to‐one communication model, new data packets are generated continuously and nodes are capable of recharging their energy periodically, over an infinite time horizon, and we are interested in the maximum achievable steady‐state throughput, the packet delay, and the energy consumption. Our results show that energy‐aware multi‐cost routing increases the lifetime of the network and achieves better overall network performance than other approaches. Copyright © 2011 John Wiley & Sons, Ltd.     

新型随机多址接入无线传感器网络MAC控制协议与能量有效性分析

提出了一种新的随机多址接入无线传感器网络的MAC控制协议,在发送分组的时间1+a中,采用P概率检测与1-坚持的联合控制策略,并对多通道的随机多址接入无线传感器网络进行了分析,理论分析了系统的吞吐量和多通道中不同业务的吞吐量,以及信息分组的发送时延等参数,理论分析与仿真实验结果相一致.还结合无线传感器网络的能量有效性,通过对概率P值的选取,控制忙周期侦听信道的节点数和空闲期的休眠站点数,采用休眠技术实现了系统的节能效果.通过对2种无线传感器网络控制协议的能量有效性分析,证明了改进的控制协议其节点具有更长的生命周期,更适合作为无线传感器网络的MAC控制协议.     

An enhanced and energy efficient communication architecture for Bluetooth wireless PANs

Bluetooth is a radio technology for Wireless Personal Area Networking (WPAN) operating in the 2.4 GHz ISM frequency band, and allows devices to be connected into short-range ad hoc networks. The Bluetooth medium access control protocol is based on the Master/Slave paradigm wherein any communication between slave devices has to go through the Master. While this model provides for simplicity, it incurs a longer delay between any two slave devices due to far from optimal packet forwarding, the use of double the bandwidth, and also additional energy wastage at the Master. Moreover, if more than two devices want to communicate as a group, this can only be achieved by either multiple unicast transmissions or a piconet-wide broadcast, clearly resulting in inefficiency. In this paper, we propose a novel Dynamic Slot Assignment (DSA) scheme whereby the Master device dynamically assigns slots to Slaves so as to allow them to communicate directly with each other without any Master intervention. This proposed communication architecture also provides for Quality of Service (QoS) requests, admission control, and multi-device conversation by which a multicast-like communication is implemented within a piconet. Through extensive simulation, we observe that DSA drastically enhances Bluetooth performance in terms of delay and throughput, while significantly reducing power consumption at the master and the overall piconet.     

一种基于预约的无线传感器网络MAC协议

无线传感器网络要求的能量高效,低延时,使得MAC协议的设计充满挑战。近来已经提出了很多基于簇的MAC协议,为减少冲突在簇内部采用TDMA方式来协调簇内各个节点的传输。提出了一种在采用簇结构的基础上,使用预约方式来发送数据的R-MAC（Reservation-MAC）协议。当争用节点少的时候,采用随机争用方式来预约数据的发送;在争用节点多的时候,采用时隙争用方式来预约数据的发送。分析表明,R-MAC能够有效地降低能耗和减少延迟。     

一种新型的能量受限无线体域网路由协议

针对无线体域网这种新型的应用场景,设计了一种新型的能量受限无线体域网路由协议EE-DSR。该协议在DSR路由基础上,综合考虑了无线体域网中信道变化、节点业务类型和节点服务时间等特殊应用,有效地节省了网络传输的能量消耗,从而较好地延长了网络生存期。     

Prediction-based energy map for wireless sensor networks

A fundamental issue in the design of a wireless sensor network is to devise mechanisms to make efficient use of its energy, and thus, extend its lifetime. The information about the amount of available energy in each part of the network is called the energy map and can be useful to increase the lifetime of the network. In this paper, we address the problem of constructing the energy map of a wireless sensor network using prediction-based approach. Simulation results compare the performance of a prediction-based approach with a naive one in which no prediction is used. Results show that the prediction-based approach outperforms the naive in a variety of parameters. We also investigate the possibility of sampling the energy information in some nodes in the network in order to diminish the number of energy information packets. Results show that the use of sampling techniques produce more constant error curves.     

无线传感器网络中匿名的聚合节点选举协议

提出一种分簇无线传感器网络中匿名的簇头选举协议。给出了匿名簇头选举的判定规则及成簇模式,并采用基于双线性对的匿名否决协议对选举结果进行验证以保证存在节点成功当选。设计了相应的匿名数据聚合方案,无需泄露节点身份信息即可完成聚合。分析及仿真结果表明,协议同时实现了簇头选举的匿名性、高效性及安全性,可有效抵抗窃听攻击、节点妥协攻击及合谋攻击等恶意行为。     

Energy-balanced unequal clustering protocol for wireless sensor networks

Clustering provides an effective way to prolong the lifetime of wireless sensor networks.One of the major issues of a clustering protocol is selecting an optimal group of sensor nodes as the cluster heads to divide the network.Another is the mode of inter-cluster communication.In this paper,an energy-balanced unequal clustering(EBUC)protocol is proposed and evaluated.By using the particle swarm optimization(PSO)algorithm,EBUC partitions all nodes into clusters of unequal size,in which the clusters closer to the base station have smaller size.The cluster heads of these clusters can preserve some more energy for the inter-cluster relay traffic and the 'hot-spots' problem can be avoided.For inter-cluster communication,EBUC adopts an energy-aware multihop routing to reduce the energy consumption of the cluster heads.Simulation results demonstrate that the protocol can efficiently decrease the dead speed of the nodes and prolong the network lifetime.     

MIMO ARIMA models for handoff resource reservation in multimedia wireless networks

This paper presents a new approach to prediction of resource demand for future handoff calls in multimedia wireless IP networks. Our approach is based on application of multi‐input‐multi‐output (MIMO) multiplicative autoregressive‐integrated‐moving average (ARIMA) (p,d,q)x(P,D,Q)_S models fitted to the traffic data measured in the considered cell itself and on the new call admission control (CAC) algorithm that simultaneously maximizes the system throughput while keeping the handoff call dropping probability (CDP) below the targeted value. The main advantages of the proposed approach are the following: first, the proposed multi‐variable prediction method gives on average better predictions (i.e. narrower prediction confidence interval) for realistic traffic situations, which results in lower new call blocking probability (CBP) at the targeted handoff CDP and second, the model is simple to implement since it does not require communication among the adjacent cells. Simulation results show the superiority of the proposed MIMO prediction approach combined with the proposed call admission control algorithm for some typical nonstationary situations in comparison with univariate models. Copyright © 2004 John Wiley & Sons, Ltd.