DCR‐MAC: distributed cognitive radio MAC protocol for wireless ad hoc networks

The MAC protocol for a cognitive radio network should allow access to unused spectrum holes without (or with minimal) interference to incumbent system devices. To achieve this main goal, in this paper a distributed cognitive radio MAC (DCR‐MAC) protocol is proposed for wireless ad hoc networks that provides for the detection and protection of incumbent systems around the communication pair. DCR‐MAC operates over a separate common control channel and multiple data channels; hence, it is able to deal with dynamics of resource availability effectively in cognitive networks. A new type of hidden node problem is introduced that focuses on possible signal collisions between incumbent devices and cognitive radio ad hoc devices. To this end, a simple and efficient sensing information exchange mechanism between neighbor nodes with little overhead is proposed. In DCR‐MAC, each ad hoc node maintains a channel status table with explicit and implicit channel sensing methods. Before a data transmission, to select an optimal data channel, a reactive neighbor information exchange is carried out. Simulation results show that the proposed distributed cognitive radio MAC protocol can greatly reduce interference to the neighbor incumbent devices. A higher number of neighbor nodes leads to better protection of incumbent devices. Copyright © 2008 John Wiley & Sons, Ltd.     

CR-CEA: A collision- and energy-aware routing method for cognitive radio wireless sensor networks

Currently, working in the overcrowded shared unlicensed spectrum band, leads to a reduction in the quality of communications in wireless networks. This makes a considerable increase in packet loss caused by collisions that necessitates packets retransmissions. In the case of wireless sensor networks (WSN), a large amount of energy of sensor nodes will be wasted by these retransmissions. Cognitive radio technology makes it possible for sensor nodes, to opportunistically use licensed bands with better propagation characteristics and less congestion. In this paper a routing method for cognitive radio wireless sensor networks (CR-CEA) is presented, that is based on a cross-layer design that jointly considers route and spectrum selection. The CR-CEA method has two main phases: next hop selection and channel selection. The routing is performed hop-by-hop with local information and decisions, which are more compatible with sensor networks. Primary user activity and prevention from interference with them, is considered in all spectrum decisions. It uniformly distributes frequency channels between adjacent nodes, which lead to a local reduction in collision probability. This clearly affects energy consumption in all sensor nodes. In CR-CEA, route selection is energy-aware and a learning-based technique is used to reduce the packet delay in terms of hop-count. The simulation results reveal that by applying cognitive radio technology to WSNs and selecting a proper operating channel, we can consciously decrease collision probability. This saves energy of sensor nodes and improves the network lifetime.     

A gradient‐based multiple‐path routing protocol for low duty‐cycled wireless sensor networks

Routing in a low duty‐cycled wireless sensor network (WSN) has attracted much attention recently because of the challenge that low duty‐cycled sleep scheduling brings to the design of efficient distributed routing protocols for such networks. In a low duty‐cycled WSN, a big problem is how to design an efficient distributed routing protocol, which uses only local network state information while achieving low end‐to‐end (E2E) packet delivery delay and also high packet delivery efficiency. In this paper, we study low duty‐cycled WSNs wherein sensor nodes adopt pseudorandom sleep scheduling for energy saving. The objective of this paper is to design an efficient distributed routing protocol with low overhead. For this purpose, we design a simple but efficient hop‐by‐hop routing protocol, which integrates the ideas of multipath routing and gradient‐based routing for improved routing performance. We conduct extensive simulations, and the results demonstrate the high performance of the proposed protocol in terms of E2E packet delivery latency and packet delivery efficiency as compared with existing protocols. Copyright © 2014 John Wiley & Sons, Ltd.     

MUQAMI+: a scalable and locally distributed key management scheme for clustered sensor networks

Wireless sensor networks (WSN) are susceptible to node capture and many network levels attacks. In order to provide protection against such threats, WSNs require lightweight and scalable key management schemes because the nodes are resource-constrained and high in number. Also, the effect of node compromise should be minimized and node capture should not hamper the normal working of a network. In this paper, we present an exclusion basis system-based key management scheme called MUQAMI+ for large-scale clustered sensor networks. We have distributed the responsibility of key management to multiple nodes within clusters, avoiding single points of failure and getting rid of costly inter-cluster communication. Our scheme is scalable and highly efficient in terms of re-keying and compromised node revocation.     

异质节点分离CRSN中MAC协议设计与性能分析

认知无线传感器网络(CRSN)是一种将认知无线电(CR)技术引入传统WSN中的新型网络,具有一定的应用价值和发展前景.然而,CRSN中的认知功能带来的额外能耗和处理要求及其高成本实现,阻碍了它的进一步发展及应用.基于此,提出将认知功能迁移到另外一类节点——认知节点,并使其拥有较强的处理能力和能量收集能力.认知节点与普通传感器节点按照一定比例进行部署,组成另外一种新型网络——异质节点CRSN (HT-CRSN),这种新型网络能够提高网络性能并降低部署成本.并提出了一种能够适用于这种异质节点传感器网络的工作时序及其一系列可行性的MAC协议(FBP等).通过对所提MAC协议的能耗分析,说明可以通过调整两类异质节点的部署比例和能量收集速率均衡两类异质节点的能耗,进而提高网络生命周期.     

Wireless distributed computing in cognitive radio networks

Individual cognitive radio nodes in an ad-hoc cognitive radio network (CRN) have to perform complex data processing operations for several purposes, such as situational awareness and cognitive engine (CE) decision making. In an implementation point of view, each cognitive radio (CR) may not have the computational and power resources to perform these tasks by itself. In this paper, wireless distributed computing (WDC) is presented as a technology that enables multiple resource-constrained nodes to collaborate in computing complex tasks in a distributed manner. This approach has several benefits over the traditional approach of local computing, such as reduced energy and power consumption, reduced burden on the resources of individual nodes, and improved robustness. However, the benefits are negated by the communication overhead involved in WDC. This paper demonstrates the application of WDC to CRNs with the help of an example CE processing task. In addition, the paper analyzes the impact of the wireless environment on WDC scalability in homogeneous and heterogeneous environments. The paper also proposes a workload allocation scheme that utilizes a combination of stochastic optimization and decision-tree search approaches. The results show limitations in the scalability of WDC networks, mainly due to the communication overhead involved in sharing raw data pertaining to delegated computational tasks.     

Survey on Wireless Sensor Network Applications and Energy Efficient Routing Protocols

Wireless sensor network (WSN) is a group of small power-constrained nodes that sense data and communicate it to the base station (BS). These nodes cover a vast region of interest (ROI) for several purposes according to the application need. The first challenge encountered in WSNs is how to cover the ROI perfectly and send the monitored data to the BS. Although the energy introduced during setup phase and the violation of energy fairness constraint of dynamic routing topologies, they achieve high network performance in terms of coverage and connectivity. In this paper, we categorize the applications of WSN based on different aspects to show the major protocol design issues. Thus, the energy efficiency of the recent proactive routing protocols is studied from different angles. The energy overhead and energy fairness of each protocol were carefully analyzed. The most energy efficient routing protocols for homogeneous proactive networks were studied and compared to highlight the research challenges and existing problems in this area. The results proved that energy overhead and route selection are the most effective aspects of network lifetime and network efficiency.

     

Diffusing-CRN k-means: an improved k-means clustering algorithm applied in cognitive radio ad hoc networks

With increasing demand of new wireless applications and increasing number of wireless user’s, problem of spectrum scarcity arises. In this context, cognitive radio supports dynamic spectrum access to address spectrum scarcity problem. Cognitive radio defined the cognitive radio nodes by their ability to intelligently adapt the environment to achieve specific objectives through advanced techniques. The variance of channel availability for cognitive radio nodes degrades connectivity and robustness of this type of network; in this case the use of clustering is an effective approach to meet this challenge. Indeed, the geographical areas are homogeneous in terms of type of radio spectrum, radio resources are better allocated by grouping cognitive radio nodes per cluster. Clustering is interesting to effectively manage the spectrum or routing in cognitive radio ad hoc networks. In this paper, we aim to improve connectivity and cooperativeness of cognitive radio nodes based on the improvement of the k-means algorithm. Our proposed algorithm is applied in cognitive radio ad hoc networks. The obtained results in terms of exchange messages and execution time show the feasibility of our algorithm to form clusters in order to improve connectivity and cooperativeness of cognitive radio nodes in the context of cognitive radio ad hoc networks.     

A Distributed MAC Protocol Using Virtual Control Channels for CRSNs

A cognitive radio sensor network (CRSN) is a promising fusion network that combines conventional wireless sensor network (WSN) with cognitive radio (CR) functionalities. With abilities to sense for available channels and to adapt to the radio environment, a CRSN is able to be more opportunistic in accessing spectrums than a WSN, but it also has problems due to hardware constraints and energy limitations. In many studies on distributed CR MAC protocols, establishing dedicated control channels (DCCs) has been considered as an important problem because it is essentially used for coordination and negotiation of spectrum assignments. However, directly applying DCCs into CRSNs is impractical, due to its high-cost complexity in hardware and deployment. To solve it, in this paper we propose a distributed MAC protocol using virtual control channels for CRSNs, in which CR sensor nodes called secondary users are grouped into clusters, and commonly shared available channels are utilized as virtual DCCs. In addition, a channel selection scheme is developed, based on an approximated partially observable Markov decision process. Our numerical simulation results indicate that the proposed MAC protocol can not only improve the throughput rate but also reduce the energy consumption under no DCCs.     

Distributed Borrowing Addressing Scheme for ZigBee/IEEE 802.15.4 Wireless Sensor Networks

This paper proposes a distributed borrowing addressing (DIBA) scheme to solve problems of failure in address assignments resulting from limited tree depth and width when the distributed address assignment mechanism is used in a ZigBee/IEEE 802.15.4 wireless sensor network. DIBA is a method of borrowing addresses from neighbor nodes for newly entering nodes and assigning the borrowed addresses. Its network or sensing coverage can increase with almost the same overhead as the existing method. DIBA is a simple and lightweight means of addressing and routing, making it suitable for wireless sensor networks. Simulations showed that DIBA is a distributed addressing scheme with consistently excellent performance.     

WLAN throughput improvement via distributed queuing MAC

This paper analyzes the performance of a MAC scheme for wireless local area networks (WLANs) that makes use of distributed queues to improve radio channel utilization. Analytical values for the maximum throughput performance are derived as a function of the system parameters. The obtained results show that the proposed scheme outperforms the legacy 802.11 MAC protocol in terms of maximum stable throughput. This benefit is obtained from eliminating back-off periods and collisions in data packet transmissions while minimizing the needed control overhead. The proposal also makes performance to be independent of the number of nodes transmitting in the system and provides stability for high load conditions.     

Optimized in-band control channel with channel selection scheduling and network coding in distributed cognitive radio networks

This article proposes an optimized in-band control channel scheme with channel selection scheduling algorithm and network coding based transmission paradigm in the distributed cognitive radio network (...     

Delay-sensitive and multimedia communication in cognitive radio sensor networks

Multimedia and delay-sensitive data applications in cognitive radio sensor networks (CRSN) require efficient real-time communication and dynamic spectrum access (DSA) capabilities. This requirement poses emerging problems to be addressed in inherently resource-constrained sensor networks, and needs investigation of CRSN challenges with real-time communication requirements. In this paper, the main design challenges and principles for multimedia and delay-sensitive data transport in CRSN are introduced. The existing transport protocols and algorithms devised for cognitive radio ad hoc networks and wireless sensor networks (WSN) are explored from the perspective of CRSN paradigm. Specifically, the challenges for real-time transport in CRSN are investigated in different spectrum environments of smart grid, e.g., 500 kV substation, main power room and underground network transformer vaults. Open research issues for the realization of energy-efficient and real-time transport in CRSN are also presented. Overall, the performance evaluations provide valuable insights about real-time transport in CRSN and guide design decisions and trade-offs for CRSN applications in smart electric power grid.     

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.     

Reliable and energy aware query-driven routing protocol for wireless sensor networks

Wireless sensor networks become very attractive in the research community, due to their applications in diverse fields such as military tracking, civilian applications and medical research, and more generally in systems of systems. Routing is an important issue in wireless sensor networks due to the use of computationally and resource limited sensor nodes. Any routing protocol designed for use in wireless sensor networks should be energy efficient and should increase the network lifetime. In this paper, we propose an efficient and highly reliable query-driven routing protocol for wireless sensor networks. Our protocol provides the best theoretical energy aware routes to reach any node in the network and routes the request and reply packets with a lightweight overhead. We perform an overall evaluation of our protocol through simulations with comparison to other routing protocols. The results demonstrate the efficiency of our protocol in terms of energy consumption, load balancing of routes, and network lifetime.     

Capsule network‐based data pruning in wireless sensor networks

The development of the wireless sensor networks (WSN) being deployed among numerous application for its sensing capabilities is increasing at a very fast tread. Its distributed nature and ability to extend communication even to the inaccessible areas beyond communication range that lacks human intervention has made it even more attractive in a wide space of applications. Confined with numerous sensing nodes distributed over a wide area, the WSN incurs certain limitations as it is battery powered. Many developed routing enhancements with power and energy efficiency lacked in achieving the significant improvement in the performance. So, the paper proposes a machine learning system (capsule network) and technique (data pruning) for WSN involved in the real world observations to have knowledge‐based learning from the experience for an intelligent way of handling the dynamic and real environment without the intervention of the humans. The WSN cluster‐based routing aided with capsule network and data pruning proffered in paper enables the WSN to have a prolonged network lifetime, energy efficiency, minimized delay, and enhanced throughput by reducing the energy usage and extending communication within the limited battery availability. The proposed system is validated in the network simulator and compared with the WSN without ML to check for the performance enhancements of the WSN with ML inclusions in terms of quality of service enhancements, network lifetime, packet delivery ratio, and energy to evince the efficacy of the WSN with capsule network‐based data pruning.     

Efficient broadcasting protocols for regular wireless sensor networks

The wireless sensor network (WSN) has attracted lots of attention recently. Broadcast is a fundamental operation for all kinds of networks and it has not been addressed seriously in the WSN. Therefore, we propose two types of power and time efficient broadcasting protocols, namely one‐to‐all and all‐to‐all broadcasting protocols, for five different WSN topologies. Our one‐to‐all broadcasting protocols conserve power and time by choosing as few relay nodes as possible to scatter packets to the whole network. Besides, collisions are carefully handled such that our one‐to‐all broadcasting protocols can achieve 100% reachability. By assigning each node a proper channel, our all‐to‐all broadcasting protocols are collision free and efficient. Numerical evaluation results compare the performance of the five topologies and show that our broadcasting protocols are power and time efficient. Copyright © 2005 John Wiley & Sons, Ltd.     

IDRA: A flexible system architecture for next generation wireless sensor networks

Wireless sensor networks consist of embedded devices (sensor nodes), equipped with a low-power radio. They are used for many applications: from wireless building automation to e-health applications. However, due to the limited capabilities of sensor nodes, designing network protocols for these constrained devices is currently very challenging. Therefore, this paper presents the IDRA platform: an information driven architecture designed to support next-generation applications on resource constrained networked objects. IDRA supports simple but useful optimizations at an architectural level. These include support for cross-protocol interactions, energy efficiency optimizations, QoS optimizations (packet priorities, dynamic protocol selection), mobility support and heterogeneous network support. The paper shows how the development of protocols is improved by using an architecture which delegates specific tasks to a central system, decreasing the memory requirements of associated network protocols. A thorough experimental performance analysis demonstrates that IDRA is much more scalable in terms of memory requirements, energy requirements and processing overhead than traditional system architectures. Finally, the paper discusses how the optimizations presented in this paper can be used for the clean-slate design of architectures for other wireless or wired network types.     

Zone-based routing protocol with mobility consideration for wireless sensor networks

Hierarchical routing and clustering mechanisms in Wireless Sensor Networks (WSN) help to reduce the energy consumptions and the overhead created when all the sensor nodes in the network are sending information to the central data collection point. Most of the routing and clustering protocols proposed for WSN assume that the nodes are stationary. However, in applications like habitat monitoring or search and rescue, that assumption makes those clustering mechanisms invalid, since the static nature of sensors is not real. In this paper, we propose Zone-based Routing Protocol for Mobile Sensor Networks (ZoroMSN) that considers the design aspects such as mobility of sensors, zones and routes maintenance, information update and communication between sensor nodes. Simulation results show the effectiveness and strengths of the ZoroMSN protocol such as a low routing and mobility overhead, while achieving a good performance in WSN using small zone sizes and sensors with low speed. Simulation results also show that ZoroMSN outperforms existing LEACH-ME and LEACH-M protocols in terms of network lifetime and energy consumptions.     

基于簇结构的无线传感器网络路由研究综述

介绍了典型分簇无线传感器网络路由协议的分类,总结了分簇路由协议的研究进展。针对无线传感器网络从同构型网络向异构型网络发展的趋势和特点,指出了路由协议向节点间相互协作的发展方向,并且在设计路由协作算法时可采用与无线传感器网络极为相似的多Agent系统模型。