NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

Energy‐aware geographic routing in wireless sensor networks with anchor nodes

Energy efficiency has become an important design consideration in geographic routing protocols for wireless sensor networks because the sensor nodes are energy constrained and battery recharging is usually not feasible. However, numerous existing energy‐aware geographic routing protocols are energy‐inefficient when the detouring mode is involved in the routing. Furthermore, most of them rarely or at most implicitly take into account the energy efficiency in the advance. In this paper, we present a novel energy‐aware geographic routing (EAGR) protocol that attempts to minimize the energy consumption for end‐to‐end data delivery. EAGR adaptively uses an existing geographic routing protocol to find an anchor list based on the projection distance of nodes for guiding packet forwarding. Each node holding the message utilizes geographic information, the characteristics of energy consumption, and the metric of advanced energy cost to make forwarding decisions, and dynamically adjusts its transmission power to just reach the selected node. Simulation results demonstrate that our scheme exhibits higher energy efficiency, smaller end‐to‐end delay, and better packet delivery ratio compared to other geographic routing protocols. Copyright © 2011 John Wiley & Sons, Ltd.     

Improved channel‐aware MAC protocols for wireless local area networks

This paper studies the fading properties of the communication channel assumed in wireless local area networks (WLANs) and devises efficient channel‐aware protocols for the distributed coordination function (DCF) and the point coordination function (PCF), the two modes of communication defined in the IEEE standard for WLAN. Our simulations show that the proposed PCF protocol improves the channel capacity usage up to 14% and the proposed DCF protocol improves the channel capacity up to 90%, when compared with standard IEEE 802.11 implementations, depending on the loss rate and temporal characteristics of the wireless channel. The proposed protocols introduce minimum computational overhead. We also show that, compared with standard DCF protocol defined in IEEE 802.11, the proposed DCF protocol can lower the SNR requirements for a given packet error rate thus potentially extending the battery life of portable devices that use WLAN.. Copyright © 2004 John Wiley & Sons, Ltd.     

An efficient online‐battery aware geographic routing algorithm for wireless sensor networks

Wireless sensor networks (WSNs) are being used in a wide variety of critical applications such as military and health‐care applications. Such networks, which are composed of sensor nodes with limited memory capacity, limited processing capabilities, and most importantly limited energy supply, require routing protocols that take into consideration these constraints. The aim of this paper is to provide an efficient power aware routing algorithm for WSNs that guarantees QOS and at the same time minimizes energy consumption by calculating the remaining battery capacity of nodes and taking advantage of the battery recovery process. We present an online‐battery aware geographic routing algorithm. To show the effectiveness of our approach, we simulated our algorithm in ns2 and compared it with greedy perimeter stateless routing for wireless networks and battery‐aware routing for streaming data transmissions in WSNs. Copyright © 2009 John Wiley & Sons, Ltd.     

无线多媒体传感器网络中一种改进路由算法

随着网络负载增加,经典的TPGF( Two-Phase geographic Greedy Forwarding)算法难以找到节点分离路径,会导致网络吞吐量、投递率以及端到端时延性能下降。此外,当网络拓扑变动不大时, TPGF中每条路径所包含节点要消耗比其他节点更多的能量,会导致其过快死亡,从而影响网络性能。为此,将联合网络编码技术引入 TPGF,提出一种编码与能量感知的 TPGF 路由算法( NE-TPGF)。该算法综合考虑节点的地理位置、编码机会、剩余能量等因素,同时利用联合网络编码技术进一步扩展编码结构,充分利用网络编码优势来建立相对最优的传输路径。仿真结果表明, NE-TPGF能够增加编码机会,提高网络吞吐量和投递率,降低端到端时延,并且还有利于减少和平衡节点的能量消耗。     

编码感知多跳无线网络安全路由协议

分析了网络编码系统DCAR"编码+路由"发现过程存在的安全问题,提出了适用于编码感知安全路由协议的安全目标,设计了基于DCAR的编码感知安全路由协议DCASR,DCASR协议利用密码学机制保证可信路由建立和正确编码机会发现。为建模多跳无线网络特征和分析路由协议安全性,引入线程位置和线程位置相邻概念扩展安全系统逻辑LS2,提出了分析路由协议安全性的逻辑LS2-RP。LS2-RP用线程邻居集及邻居集的变化描述多跳无线网络的动态拓扑关系,用广播规则模型化多跳无线网络广播通信特征。最后,用LS2-RP协议编程语言描述了DCASR协议,用LS2-RP的谓词公式和模态公式描述DCASR协议的安全属性,用LS2-RP逻辑证明系统分析了DCASR协议的安全性,证明DCASR协议能够满足安全目标。     

认知无线多跳网中结合QoS查找的跨层多信道MAC协议

针对认知无线多跳网中频谱资源具有较大时变性及差异性的问题,设计了一种结合QoS查找的跨层多信道MAC协议。该协议将按需QoS查找与动态频谱分配跨层相结合,仅让参与传输的节点执行频谱分配并按QoS要求获取频谱资源。此外,协议使用频分双工收发机实现了对公共控制信道的不间断监听,并设计了一套支持不同数量收发机节点间混合通信的接入算法。大量仿真结果表明,该协议能有效保证对端到端传输的QoS要求的满足,并显著提高端到端吞吐量及时延。     

A dual reservation CDMA-based MAC protocol with power control for ad hoc networks

This paper proposes a new multi-channel Medium Access Control （MAC） protocol named as Dual Reservation Code Division Multiple Access （CDMA） based MAC protocol with Power Control （DRCPC）. The code channel is divided into common channel, broadcast channel and several data channels. And dynamic power control mechanism is implemented to reduce near-far interference. Compared with IEEE 802.11 Distributed Coordination Function （DCF） protocol, the results show that the proposed mechanism improves the average throughput and limits the transmission delay efficiently.     

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.     

a high-throughput path metric for multi-hop wireless routing

This paper presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the minimum hop-count metric chooses arbitrarily among the different paths of the same minimum length, regardless of the often large differences in throughput among those paths, and ignoring the possibility that a longer path might offer higher throughput.This paper describes the design and implementation of ETX as a metric for the DSDV and DSR routing protocols, as well as modifications to DSDV and DSR which allow them to use ETX. Measurements taken from a 29-node 802.11b test-bed demonstrate the poor performance of minimum hop-count, illustrate the causes of that poor performance, and confirm that ETX improves performance. For long paths the throughput improvement is often a factor of two or more, suggesting that ETX will become more useful as networks grow larger and paths become longer.This research was supported by grants from NTT Corporation under the NTT-MIT collaboration, and by MIT’s Project Oxygen.Douglas De Couto received his Ph.D. in Computer Science from MIT in June 2004 for work in multi-hop wireless routing. He was a member of MIT’s Computer Science and Artificial Laboratory. He also received his S.B. and M.Eng. degrees in Computer Science and Electrical Engineering from MIT, in 1998. His research interests include multi-hop wireless networks, sensor and embedded networks, and applications of GPS. E-mail: decouto@csail.mit.eduDaniel Aguayo is a graduate student in MIT’s EECS department and a member of MIT’s Computer Science and Artificial Intelligence Laboratory. He received an S.B. in Computer Science and Electrical Engineering from MIT in 2001, and an M.Eng. in 2002. His research interests are focused on multi-hop wireless networks. E-mail: aguayo@csail.mit.eduJohn Bicket is a graduate student in MIT’s EECS department and a member of MIT’s Computer Science and Artificial Intelligence Laboratory. He received a B.S. from Cornell University. His research interests include multi-hop rooftop 802.11 networks and device drivers. E-mail: jbicket@csail.mit.eduRobert Morris is an associate professor in MIT’s EECS department and a member of MIT’s Computer Science and Artificial Intelligence Laboratory. He received a Ph.D. from Harvard University for work on modeling and controlling data networks with large numbers of competing connections. He co-founded Viaweb, an e-commerce hosting service. His current interests include routing in multi-hop rooftop 802.11 networks, modular software-based routers, distributed hash tables, and peer-to-peer file storage. He has received a Sloan Fellowship, an NSF Career award, and the ITT Career Development Chair at MIT. E-mail: rtm@csail.mit.edu     

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.     

A fast and reliable routing technique for wireless mesh networks

In wireless mesh networks (WMNs), real time communications (e.g., Voice over IP (VoIP) and interactive video communications) may often be interrupted as packets are frequently lost or delayed excessively. This usually happens due to the unreliability of wireless links or buffer overflows along the routing paths. The mesh connectivity within the WMN enables the capability to enhance reliability and reduce delay for such applications by using multiple paths for routing their packets. The vital components in multi‐path routing for achieving this are the pre‐determined formation of paths and the technique that the paths are deployed for packet traversal. Therefore, we propose a novel multi‐path routing protocol by introducing a new multi‐path organization and a traffic assignment technique. The designed technique dubbed as FLASH (Fast and reLiAble meSH routing protocol) discovers one primary path between a pair of source and destination based on a new proposed metric, and thereafter selects mini‐paths, which connect pairs of intermediate nodes along the primary path. The primary path and mini‐paths are concurrently deployed, as multiple copies of packets are routed through. This technique compensates for possible outage at intermediate wireless nodes or their corresponding wireless links along the primary path. Routing along mini‐paths is performed in such a way that redundant copies do not cause an excessive congestion on the network. The effectiveness of the proposed scheme is evaluated analytically and through extensive simulations under various load conditions. The results demonstrate the superiority of the proposed multi‐path organization in terms of reliability and satisfactory achievements of the protocol in enhancing delay and throughput compared to the existing routing protocols, especially for long distances and in congested conditions. Copyright © 2010 John Wiley & Sons, Ltd.     

EMRP: Evolutionary-based multi-hop routing protocol for wireless body area networks

Routing is one of the main challenges in designing wireless body area networks. Existing routing protocols exhibit some drawbacks for practical networks: First, insufficient criteria (e.g., only energy or distance) are used to select the forwarder nodes. Second, controllable parameters of the protocol are determined manually and no automatic tuning is used. Third, the protocol is not adjusted and optimized based on application specifications. In order to overcome the mentioned drawbacks, an adaptive Evolutionary Multi-hop Routing Protocol (named EMRP) is proposed in this paper. We introduce a multi-objective function based on energy level, distance, estimated path loss and estimated energy consumption for selecting optimal forwarder nodes. The proposed objective function aims to select forwarder nodes with high energy, low communication distance, low path loss and low energy consumption. The controllable parameters of EMRP can be adaptively optimized based on application specifications via genetic algorithm. Simulation results show a significant improvement than the existing technologies in terms of lifetime, path loss, throughput, and energy consumption.     

A reliable and energy‐efficient routing protocol for underwater wireless sensor networks

Recently, underwater wireless sensor networks (UWSNs) have attracted much research attention to support various applications for pollution monitoring, tsunami warnings, offshore exploration, tactical surveillance, etc. However, because of the peculiar characteristics of UWSNs, designing communication protocols for UWSNs is a challenging task. Particularly, designing a routing protocol is of the most importance for successful data transmissions between sensors and the sink. In this paper, we propose a reliable and energy‐efficient routing protocol, named R‐ERP²R (Reliable Energy‐efficient Routing Protocol based on physical distance and residual energy). The main idea behind R‐ERP²R is to utilize physical distance as a routing metric and to balance energy consumption among sensors. Furthermore, during the selection of forwarding nodes, link quality towards the forwarding nodes is also considered to provide reliability and the residual energy of the forwarding nodes to prolong network lifetime. Using the NS‐2 simulator, R‐ERP²R is compared against a well‐known routing protocol (i.e. depth‐based routing) in terms of network lifetime, energy consumption, end‐to‐end delay and delivery ratio. The simulation results proved that R‐ERP²R performs better in UWSNs.Copyright © 2012 John Wiley & Sons, Ltd.     

Joint optimization of energy allocation and routing problems in wireless sensor networks

Energy allocation problems and routing problems are both important research issues in the wireless sensor network (WSN) field. The former usually aims at considering how to allocate a certain number of sensor devices in a sensing region to form a WSN so that the objective function value (e.g., the network connectivity or the network lifetime) of the constructed network is optimized. For the message routing problem in WSNs, researchers tend to consider how to find an energy conservable message transmission routing scheme for notifying the supervisor of the WSN when an event occurs. Till now, many solutions have been proposed for the above two categories of optimization problems. However, unifying the above two network optimization problems to maximize the network lifetime, to the best of our knowledge, still lacks related research. This paper considers a joint optimization problem for energy allocation and energy‐aware routing called the joint optimization of energy allocation and routing problem (JOEARP) for a hierarchical cluster‐based WSN. We propose an exact algorithm to provide the optimum solution for the JOEARP. The simulation results show that this solution performed better in prolonging the network lifetime of a WSN in a real situation, compared to other compositions of conventional energy allocation schemes with some known routing algorithms. Copyright © 2009 John Wiley & Sons, Ltd.     

A rendezvous reservation protocol for energy constrained wireless infrastructure networks

This paper considers a low power wireless infrastructure network that uses multi-hop communications to provide end user connectivity. A generalized Rendezvous Reservation Protocol (RRP) is proposed which permits multi-hop infrastructure nodes to adapt their power consumption in a dynamic fashion. When nodes have a long-term association, power consumption can be reduced by having them periodically rendezvous for the purpose of exchanging data packets. In order to support certain applications, the system invokes a connection set up process to establish the end-to-end path and selects node rendezvous rates along the intermediate nodes to meet the application’s quality of service (QoS) needs. Thus, the design challenge is to dynamically determine rendezvous intervals based on incoming applications’ QoS needs, while conserving battery power. In this paper, we present the basic RRP mechanism and an enhanced mechanism called Rendezvous Reservation Protocol with Battery Management (RRP-BM) that incorporates node battery level information. The performance of the system is studied using discrete-event simulation based experiments for different network topologies. The chief metrics considered are average power consumption and system lifetime (that is to be maximized). The QoS metrics specified are packet latency and end-to-end setup latency. It is shown that the use of the RRP-BM can increase the lifetime up to 48% as compared to basic RRP by efficiently reducing the energy consumption. This work was supported by a grant from the Natural Sciences and Engineering Research Council of Canada and Communications and Information Technology Ontario (CITO). Part of the research was supported by Air Force Office of Scientific Research grants F-49620-97-1-0471 and F-49620-99-1-0125; Laboratory for Telecommunications Sciences, Adelphi, Maryland; and Intel Corporation. The authors may be reached via e-mail at todd@mcmaster. ca, krishna@umbc. edu. The basic RRP mechanism was presented at the IASTED International Conference on Wireless and Optical Communications, Banff, Canada, July 2002. Subalakshmi Venugopal received her Bachelors in Computer Science from R.V. College of Engineering, Bangalore, India and her M.S. degree in Computer Science from Washington State University. She interned as a student researcher at the Indian Institute of Science, Bangalore, India. Ms. Venugopal is currently employed with Microsoft Corporation in Redmond, WA and is part of the “Kids and Education Group”. Her research interests include low power wireless ad hoc networks. Zhengwei (Wesley) Chen received the M.E. in Electrical & Computer Engineering Dept from McMaster University in Canada in 2002. He joined Motorola Inc. as a CDMA2000 system engineer in 2000. In 2002, he joined UTStarcom as a manager of the Global Service Solution Department. He is currently in charge of R&D for Advanced Services related to the TVoIP and Softswitch products. Terry Todd received the B.A.Sc, M.A.Sc and Ph.D degrees in Electrical Engineering from the University of Waterloo in Waterloo, Ontario, Canada. While at Waterloo he also spent 3 years as a Research Associate with the Computer Communications Networks Group (CCNG). During that time he worked on the Waterloo Experimental Local Area Network, which was an early local area network testbed. In 1991 Dr. Todd was on research leave in the Distributed Systems Research Department at AT&T Bell Laboratories in Murray Hill, NJ. He also spent 1998 as a visiting researcher at The Olivetti and Oracle Research Laboratory (ORL) in Cambridge, England. While at ORL he worked on the piconet project, which was an embedded low power wireless network testbed. Dr. Todd is currently a Professor of Electrical and Computer Engineering at McMaster University in Hamilton, Ontario, Canada. At McMaster he has been the Principal Investigator on a number of major research projects in the optical and wireless networking areas. He currently directs a large group working on wireless mesh networks and wireless VoIP. Professor Todd holds the NSERC/RIM/CITO Chair on Pico-Cellular Wireless Internet Access Networks. Dr. Todd’s research interests include metropolitan/local area networks, wireless communications and the performance analysis of computer communication networks and systems. Professor Todd is a Professional Engineer in the province of Ontario. Krishna M. Sivalingam is an Associate Professor in the Dept. of CSEE at University of Maryland, Baltimore County. Previously, he was with the School of EECS at Washington State University, Pullman from 1997 until 2002; and with the University of North Carolina Greensboro from 1994 until 1997. He has also conducted research at Lucent Technologies’ Bell Labs in Murray Hill, NJ, and at AT&T Labs in Whippany, NJ. He received his Ph.D. and M.S. degrees in Computer Science from State University of New York at Buffalo in 1994 and 1990 respectively; and his B.E. degree in Computer Science and Engineering in 1988 from Anna University, Chennai (Madras), India. While at SUNY Buffalo, he was a Presidential Fellow from 1988 to 1991. His research interests include wireless networks, optical wavelength division multiplexed networks, and performance evaluation. He holds three patents in wireless networks and has published several research articles including more than thirty journal publications. He has published an edited book on Wireless Sensor Networks in 2004 and edited books on optical WDM networks in 2000 and 2004. He served as a Guest Co-Editor for special issues of the ACM MONET journal on “Wireless Sensor Networks” in 2003 and 2004; and an issue of the IEEE Journal on Selected Areas in Communications on optical WDM networks (2000). He is co-recipient of the Best Paper Award at the IEEE International Conference on Networks 2000 held in Singapore. His work has been supported by several sources including AFOSR, NSF, Cisco, Intel and Laboratory for Telecommunication Sciences. He is a member of the Editorial Board for ACM Wireless Networks Journal, IEEE Transactions on Mobile Computing, Ad Hoc and Sensor Wireless Networks Journal, and KICS Journal of Computer Networks. He serves as Steering Committee Co-Chair for IEEE/CreateNet International Conference on Broadband Networks (BroadNets) that was created in 2004. He is currently serving as General Co-Vice-Chair for the Second Annual International Mobiquitous conference to be held in San Diego in 2005 and as General Co-Chair for the First IEEE/CreateNet International Conference on Security and Privacy for Emerging Areas in Communication Networks (SecureComm) to be held in Athens, Greece in Sep. 2005. He served as Technical Program Co-Chair for the First IEEE Conference on Sensor and Ad Hoc Communications and Networks (SECON) held at Santa Clara, CA in 2004; as General Co-Chair for SPIE Opticomm 2003 (Dallas, TX) and for ACM Intl. Workshop on Wireless Sensor Networks and Applications (WSNA) 2003 held in conjunction with ACM MobiCom 2003 at San Diego, CA; as Technical Program Co-Chair of SPIE/IEEE/ACM OptiComm conference at Boston, MA in July 2002; and as Workshop Co-Chair for WSNA 2002 held in conjunction with ACM MobiCom 2002 at Atlanta, GA in Sep 2002. He is a Senior Member of IEEE and a member of ACM.     

Localized power‐aware alternate routing for wireless ad hoc networks

In this paper, we design a localized power‐aware alternate routing (LPAR) protocol for dynamic wireless ad hoc networks. The design objective is to prolong the lifetime of wireless ad hoc networks wherein nodes can adaptively adjust their transmission power based on communication ranges. LPAR achieves this goal via two phases. In the first phase, energy draining balancing is achieved by identifying end‐to‐end paths with high residual energy. The second phase is designed to effectively reduce the power consumed for packet forwarding. This is achieved by iteratively performing adaptive localized power‐aware alternate rerouting to bypass each (potentially) high‐power link along the end‐to‐end path identified in the first phase. Further, the design of LPAR enables nodes to collect their neighborhood information ‘on‐demand’, which can effectively reduce the overhead for gathering such information. LPAR is suitable for both homogeneous and non‐homogeneous networks. Simulation results demonstrate that LPAR achieves improved performance in reducing protocol overhead and also in prolonging network lifetime as compared with existing work. Copyright © 2008 John Wiley & Sons, Ltd.     

A framework for post-disaster communication using wireless ad hoc networks

Disaster management system requires timely delivery of large volumes of accurate messages so that an appropriate decision can be made to minimize the severity. When a disaster strikes, most of the infrastructure for communication gets uprooted. As a result, communication gets hampered. A well designed Internet of things (IoT) can play a significant role in the post-disaster scenario to minimize the losses, and save the precious lives of animals and human beings. In this paper, we have proposed a framework for post-disaster communication using wireless ad hoc networks. The framework includes: (i) a multi-channel MAC protocol to improve the network throughput, (ii) an energy aware multi-path routing to overcome the higher energy depletion rate at nodes associated with single shortest path routing, and (iii) a distributed topology aware scheme to minimize the transmission power. Above proposals, taken together intend to increase the network throughput, reduce the end-to-end delay, and enhance the network lifetime of an ad hoc network deployed for disaster response. A multi-channel MAC protocol permits the transmission from hidden and exposed nodes without interfering with the on-going transmission. We have compared the proposed framework with an existing scheme called Distressnet [1]. Simulation results show that the proposed framework achieves higher throughput, lower end-to-end delay, and an increased network longevity.     

Power control strategies for multichannel cognitive wireless networks with Opportunistic Interference Cancellation

In this letter, an Opportunistic Interference Cancellation （OIC） is first introduced as a rate control strategy for secondary user in cognitive wireless networks. Based on the OIC rate control method, an optimal power control strategy for multichannel cognitive wireless networks is proposed. The algorithm aims to maximize the total transmit rate of cognitive user through appropriately controlling the transmit power of each subchannel under the constraint that the interference temperature at the primary receiver is below a certain threshold. Three suboptimal power control methods, namely Equal Power Transmission （EPT）, Equal Rate Transmission （ERT） and Equal Interference Transmission （EIT）, are also proposed. The performances of the proposed power control methods are compared through numerical simulations.