MANCL: a multi‐anchor nodes collaborative localization algorithm for underwater acoustic sensor networks

Localization is an essential and major issue for underwater acoustic sensor networks (UASNs). Almost all the applications in UASNs are closely related to the locations of sensors. In this paper, we propose a multi‐anchor nodes collaborative localization (MANCL) algorithm, a three‐dimensional (3D) localization scheme using anchor nodes and upgrade anchor nodes within two hops for UASNs. The MANCL algorithm divides the whole localization process into four sub‐processes: unknown node localization process, iterative location estimation process, improved 3D Euclidean distance estimation process, and 3D DV‐hop distance estimation process based on two‐hop anchor nodes. In the third sub‐process, we propose a communication mechanism and a vote mechanism to determine the temporary coordinates of unknown nodes. In the fourth sub‐process, we use two‐hop anchor nodes to help localize unknown nodes. We also evaluate and compare the proposed algorithm with a large‐scale localization algorithm through simulations. Results show that the proposed MANCL algorithm can perform better with regard to localization ratio, average localization error, and energy consumption in UASNs. Copyright © 2014 John Wiley & Sons, Ltd.     

Secure Connectivity Probability of Multi‐hop Clustered Randomize‐and‐Forward Networks

This work investigates secure cluster‐aided multi‐hop randomize‐and‐forward networks. We present a hop‐by‐hop multi‐hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability (SCP) of the hop‐by‐hop transmission scheme. For comparison, we also analyze SCPs of traditional end‐to‐end transmission schemes with two relay‐selection policies. We perform simulations, and our analytical results verify that the proposed hop‐by‐hop scheme is superior to end‐to‐end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop‐by‐hop scheme achieves near‐optimal performance in terms of the SCP.     

Reducing wireless multi‐hop delay via RSU re‐routing in vehicular wireless networks

Vehicular wireless networks offer wireless multi‐hop communications between vehicles and roadside units (RSUs). To reduce deployment cost, the distance between two RSUs could be long; that is, the communications between an RSU and a vehicle may be carried out through multi‐hops among intermediate vehicles. When a vehicle is driven from one RSU to another, the wireless multi‐hop delay becomes more serious as the number of multi‐hop relays increases. The wireless multi‐hop delay is critical for some emergency service. For instance, in a traffic accident, when a patient was sent to the hospital by ambulance, the life information of the patient must be transmitted to the hospital on time through the multi‐hop wireless network. If the ambulance is moved from one RSU to another, the wireless multi‐hop delay becomes more and more serious as the ambulance is closing to another RSU. In this paper, we propose an RSU re‐routing strategy that dynamically alters multi‐hop communications until the best RSU with the shortest path using location information is found. Moreover, we compare the proposed strategy with the existing strategy in terms of broadcasting costs, re‐routing delay, and wireless multi‐hop delay of data transmission. Performance results show that the proposed strategy can reduce the wireless multi‐hop delay significantly. Copyright © 2014 John Wiley & Sons, Ltd.     

Multiobjective optimization‐based DV‐hop localization using NSGA‐II algorithm for wireless sensor networks

Localization is one of the important requirements in wireless sensor networks for tracking and analyzing the sensor nodes. It helps in identifying the geographical area where an event occurred. The event information without its position information has no meaning. In range‐free localization techniques, DV‐hop is one of the main algorithm which estimates the position of nodes using distance vector algorithm. In this paper, a multiobjective DV‐hop localization based Non‐Sorting Genetic Algorithm‐II (NSGA‐II) is proposed in WSNs. Here, we consider six different single‐objective functions to make three multiobjective functions as the combination of two each. Localization techniques based on proposed multiobjective functions has been evaluated on the basis of average localization error and localization error variance. Simulation results demonstrate that the localization scheme based on proposed multiobjective functions can achieve good accuracy and efficiency as compared to state‐of‐the‐art single‐ and multiobjective GA DV‐hop localization scheme.     

In‐band bootstrapping in database‐driven multi‐hop cognitive radio networks

Database‐driven approach has emerged recently as an alternative or supplement for spectrum sensing for cognitive radio networks (CRNs). Within database‐driven CRNs, master devices obtain spectrum information by direct connection to a spectrum database, while slave devices can only access spectrum information indirectly via masters. The in‐band approach completely based on primary spectrum channels can be used, which eliminates the need for out‐of‐band connections and eases the adoption of the database‐driven spectrum sharing. In this paper, we study the in‐band bootstrapping process for database‐driven multi‐hop CRNs, where master/slave devices form a multi‐hop networks, and slaves need multi‐hop communications to obtain spectrum information from the master during bootstrapping. We start with the basic design of in‐band bootstrap protocol, whose performance is unsatisfactory of protocol overhead and bootstrap time. Then we propose 2 enhancements: first, we incorporates the recursive fractional spectrum information query scheme to reduce protocol overhead; then we propose the prefetch scheme to reduce the bootstrap time. According to the analysis and simulation results, our proposed protocols can greatly improve the performance: the recursive fractional spectrum information query enhancement reduces up to 40% of the overhead, the prefetch enhancement reduces more than 20% of the bootstrap time.     

Goodput and throughput comparison of single‐hop and multi‐hop routing for IEEE 802.11 DCF‐based wireless networks under hidden terminal existence

We investigate how multi‐hop routing affects the goodput and throughput performances of IEEE 802.11 distributed coordination function‐based wireless networks compared with direct transmission (single hopping), when medium access control dynamics such as carrier sensing, collisions, retransmissions, and exponential backoff are taken into account under hidden terminal presence. We propose a semi‐Markov chain‐based goodput and throughput model for IEEE 802.11‐based wireless networks, which works accurately with both multi‐hopping and single hopping for different network topologies and over a large range of traffic loads. Results show that, under light traffic, there is little benefit of parallel transmissions and both single‐hop and multi‐hop routing achieve the same end‐to‐end goodput. Under moderate traffic, concurrent transmissions are favorable as multi‐hopping improves the goodput up to 730% with respect to single hopping for dense networks. At heavy traffic, multi‐hopping becomes unstable because of increased packet collisions and network congestion, and single‐hopping achieves higher network layer goodput compared with multi‐hop routing. As for the link layer throughput is concerned, multi‐hopping increases throughput 75 times for large networks, whereas single hopping may become advantageous for small networks. The results point out that the end‐to‐end goodput can be improved by adaptively switching between single hopping and multi‐hopping according to the traffic load and topology. Copyright © 2015 John Wiley & Sons, Ltd.     

A new range‐free PCA‐based localization algorithm in wireless sensor networks

Range‐free localization algorithms in wireless sensor networks have been an interesting field for researchers over the past few years. The combining of different requirements such as storage space, computational capacities, communication capabilities, and power efficiency is a challenging aspect of developing a localization algorithm. In this paper, a new range‐free localization algorithm, called PCAL, is proposed using soft computing techniques. The proposed method utilizes hop‐count distances as the data to train and build a neural network. Before feeding the data into the neural network for the purpose of training, the dimensionality of data is reduced by principal component analysis algorithm. The performance of the proposed algorithm is evaluated using simulation. The obtained results show that the proposed algorithm has a better performance in contrast to other algorithms based on storage space, communication overhead, and localization accuracy. Furthermore, the effect of various parameters on the PCAL algorithm is studied.     

基于跳距修正加权DV Hop的WSN定位算法

针对DV Hop算法在估算平均每跳距离时存在较大的误差,提出一种跳距修正的加权定位算法。改进后算法是通过引入平均每跳距离误差修正值,进行加权处理,从而减少了跳距误差,避免了后续计算过程中误差的累积。仿真结果表明,改进的DV Hop算法在不增加硬件开销的基础上,能有效提高定位精度,降低定位误差,具有较好的稳定性,是一种实用的无线传感器网络(WSN)节点定位方案。     

DiffServ‐based bandwidth‐constrained anycast routing in a mobile IPv6 network

This paper proposes a differentiated service (DiffServ)‐based bandwidth‐constrained network layer anycast routing for a mobile IPv6 network. The proposed algorithm comprises three steps: (1) When moving into a new foreign network, the mobile node (MN) chooses a feasible path to easily locate the nearest server that can serve it. To perform path selection, a multi‐level list structure (MLLS) is defined and used to store the available bandwidth and hop count of a path. (2) An ingress extended edge router (E‐ER) uses the multi‐level list algorithm (MLLA) to examine the MLLS for selecting the feasible path with the smallest number of hops that satisfies the MN bandwidth request. (3) The E‐ER uses a condition of path change (CPC) variable to determine whether it should optimize the route between itself and the server. Simulation results indicate that the proposed algorithm offers better performance than the existing related approaches in terms of the average running time, request blocking rate, and reducing the control overhead of the simulated network. Copyright © 2010 John Wiley & Sons, Ltd.     

Beacon-less geographic multicast routing in a real-world wireless sensor network testbed

We study the problem of geographic multicast routing (GMR) in a wireless sensor network. In particular, we are interested in geographic routing solutions with a very limited control overhead and overall bandwidth consumption. Existing GMR protocols require nodes to periodically exchange beacon messages to gather information about the position of their neighbors. These beacons represent a waste of resources, specially in areas of the network with no active communications. Beacons also induce significant problems in real deployments such as interferences and collisions that cause inconsistencies in neighboring tables. In this paper we propose a new beacon-less geographic multicast routing protocol called BRUMA. Unlike previous solutions, BRUMA uses the propagation of data packets to opportunistically select next hops among those that are reachable from the sending node. In addition, we contribute a novel next hop selection function by which candidate next hops schedule their responses based on their progress along each of the branches of the multicast tree. This allows the protocol to overcome most of the issues of beacon-based solutions in real deployments such as collisions, low-quality links, etc. The results of our empirical tests in a real testbed as well as in simulations show that BRUMA achieves a higher packet delivery ratio and a lower overall bandwidth consumption than GMR, which is the protocol performing best among existing geographic multicast solutions.     

一种新的无线传感器网络定位算法研究

针对传统无线传感器网络定位算法平均误差大、节点能耗过高、定位精度不够理想等缺陷,提出了一种新的无线传感器网络定位算法IMDV-Hop.该算法引进了局部跳数Si和修正因子δ-i,用修正因子-δi对局部跳数进行修正,使待定位节点到锚节点的平均跳数更加符合实际情况;通过权衡定位精度和能耗,分三种情况计算了平均每跳间距,使得平均每跳间距更接近于真实值.仿真实验结果表明IMDV-Hop算法平均定位误差低,具有较小的通信开销,在非规则网络中可达到较好的定位精度.     

改进的无线传感器网络DV-Hop 节点定位算法

DV-Hop 算法是解决无线传感器网络节点定位问题的一种经典算法。文中根据经典的DV-Hop 算法提出了一种改进算法,通过引入更优的误差矫正和双曲线定位算法,减少了经典算法中多跳过程中积累的定位误差。比较和分析了经典DV-Hop 算法和改进后算法的仿真结果可以看出,改进后的DV-Hop 算法定位精度提高显著,在给定条件下的定位误差下降了约50%。     

Improving MANET performance by a hop‐aware and energy‐based buffer management scheme

A hop‐aware and energy‐based buffer management scheme (HEB) is proposed in this paper. HEB can provide better quality of service to packets with real‐time requirements and improve MANET power efficiency. In our algorithm, the buffer is divided into real‐time and non‐real‐time partitions. We consider the number of hops passed, the power levels of the transmitting node, the predicted number of remaining hops, and waiting time in the buffer to determine packet transmission priority. In addition, specialized queue management and a probabilistic scheduling algorithm are proposed to decrease retransmissions caused by packet losses. Mathematical derivations of loss rates and end‐to‐end delays are also proposed. Coincidence between mathematical and simulation results is also shown. Finally, the HEB is compared with first in first out, random early detection, and hop‐aware buffering scheme. Simulation results show that the proposed algorithm reduces loss rates, power consumption, and end‐to‐end delays for real‐time traffic, considerably improving the efficiency of queue management in MANET. Copyright © 2012 John Wiley & Sons, Ltd.     

Performance analysis of channel estimation in amplify‐and‐forward multi‐hop direct forwarding wireless networks

In this paper, we study the performance of a training‐based least square (LS) and linear minimum mean‐square‐error (LMMSE) channel estimation for both hop‐by‐hop and multi‐hop direct forwarding wireless sensor networks over frequency‐selective fading channels. Specifically, to investigate the properties of the channel estimation, we accomplish a theoretical analysis of MSE in terms of various link parameters. From the performance evaluation, we analytically present the effects of the number of hops on the MSE performance for channel estimations in both multi‐hop networks. Interesting observations of MSE behaviors under various conditions are discussed, and the receiver complexity and channel equalization performance are also analyzed. Finally, through the computer simulations, the analytical results and detection performance are demonstrated. Copyright © 2014 John Wiley & Sons, Ltd.     

Adaptive frequency‐hopping schemes for CR‐based multi‐link satellite networks

In this paper, we study two dynamic frequency hopping (DFH)–based interference mitigation approaches for satellite communications. These techniques exploit the sensing capabilities of a cognitive radio to predict future interference on the upcoming frequency hops. We consider a topology where multiple low Earth orbit satellites transmit packets to a common geostationary equatorial orbit satellite. The FH sequence of each low Earth orbit–geostationary equatorial orbit link is adjusted according to the outcome of out‐of‐band proactive sensing scheme, performed by a cognitive radio module in the geostationary equatorial orbit satellite. On the basis of sensing results, new frequency assignments are made for the upcoming slots, taking into account the transmit powers, achievable rates, and overhead of modifying the FH sequences. In addition, we ensure that all satellite links are assigned channels such that their minimum signal‐to‐interference‐plus‐noise ratio requirements are met, if such an assignment is possible. We formulate two multi‐objective optimization problems: DFH‐Power and DFH‐Rate. Discrete‐time Markov chain analysis is used to predict future channel conditions, where the number of states are inferred using k‐means clustering, and the state transition probabilities are computed using maximum likelihood estimation. Finally, simulation results are presented to evaluate the effects of different system parameters on the performance of the proposed designs.     

一种高效低时延的宽带电力线通信网多跳MAC协议

针对IEEE1901.1宽带电力线通信媒体接入控制(Medium Access Control,MAC)协议涉及到信标时隙利用不充分和控制开销过大等问题,提出了一种高效低时延的宽带电力线通信网多跳MAC协议(Efficient and Low Delay Multi-hop MAC,ELDM-MAC).采用基于节点层级号的信标时隙分配机制,根据邻居表和时隙分配信息计算能够提前进入到载波监听多路访问时隙(Carrier Sense Multiple Access,CSMA)的时间,减少了信标时隙的浪费,提高了信道利用率;同时采用基于拓扑信息的信标帧高效广播机制,删除不大于自身层级号的节点和大于且在两跳范围内的非子孙节点的时隙分配信息,降低了网络控制开销.仿真结果表明,ELDM-MAC协议在信道利用率、平均时延和控制开销等方面都优于IEEE1901.1 MAC协议,更适用于宽带电力线通信网络的实际应用场景.     

Autonomic self‐organization architecture for wireless sensor communications

Wireless sensor nodes may be spread over large areas and long distances, and require multi‐hop communications between nodes, making direct management numerous wireless sensor nodes inefficient. Hierarchical management can be adopted to control several nodes. Effectively controlling the top‐level nodes can decrease the costs of managing nodes and of the communication among them. The lower‐level nodes are controlled and organized with the higher‐level nodes. This study presents an algorithm for self‐organization mechanism of higher‐level nodes, contesting member nodes by multi‐hop to form hierarchical clusters, and applying the ‘20/80 rule’ to determine the ratio of headers to member nodes. Furthermore, the broadcast tree is constructed with the minimum number of hops. Simulation results indicate that the mechanism has a 6–22% lower cover loss than other approaches. The average delay of the minimum hop count approach is 0.22–1.57ms less than that of free hop count approach. The simulation also reveals the influence of 20/80 rule on cluster formation between sensor nodes. Copyright © 2006 John Wiley & Sons, Ltd.     

Optical wireless localization

In this paper, we explore the possibility of using directionality of free-space-optical (a.k.a. optical wireless) communications for solving the 3-D localization problem in ad-hoc networking environments. Range-based localization methods either require a higher node density (i.e., at least three other localized neighbors must exist) than required for assuring connectedness or a high-accuracy power-intensive ranging device such as a sonar or laser range finder which exceeds the form factor and power capabilities of a typical ad-hoc node. Our approach exploits the readily available directionality information provided by a physical layer using optical wireless and uses a limited number of GPS-enabled nodes, requiring a very low node density (2-connectedness, independent of the dimension of space) and no ranging technique. We investigate the extent and accuracy of localization with respect to varying node designs (e.g., increased number of transceivers with better directionality) and density of GPS-enabled and ordinary nodes as well as messaging overhead per re-localization. Although denser deployments are desirable for higher accuracy, our method still works well with sparse networks with little message overhead and small number of anchor nodes (as little as 2). We also present a proof-of-concept prototype of our FSO-based localization techniques and show the validity of our approach even with three transceivers per node.     

WCDS‐DCR: an energy‐efficient data‐centric routing scheme for wireless sensor networks

Wireless sensor networks (WSNs) typically consist of a large number of battery‐constrained sensors often deployed in harsh environments with little to no human control, thereby necessitating scalable and energy‐efficient techniques. This paper proposes a scalable and energy‐efficient routing scheme, called WCDS‐DCR, suitable for these WSNs. WCDS‐DCR is a fully distributed, data‐centric, routing technique that makes use of an underlying clustering structure induced by the construction of WCDS (Weakly Connected Dominating Set) to prolong network lifetime. It aims at extending network lifetime through the use of data aggregation (based on the elimination of redundant data packets) by some particular nodes. It also utilizes both the energy availability information and the distances (in number of hops) from sensors to the sink in order to make hop‐by‐hop, energy‐aware, routing decisions. Simulation results show that our solution is scalable, and outperforms existing schemes in terms of network lifetime. Copyright © 2010 John Wiley & Sons, Ltd.     

Defending against wormhole attacks in mobile ad hoc networks

In ad hoc networks, malicious nodes can deploy wormhole attacks to fabricate a false scenario on the proximity relationship among mobile nodes. A classification of the attacks according to the format of the wormholes is proposed. This forms a basis to identify the detection capability of various approaches. An analysis shows that earlier approaches focus on the prevention of wormholes among neighbors that trust each other. As a more generic approach, we present an end‐to‐end scheme that can detect wormholes on a multi‐hop route. Only the trust between the source and the destination is assumed. The mechanism uses geographic information to detect anomalies in neighbor relations and node movements. To reduce the computation and storage overhead, we present a scheme called cell‐based open tunnel avoidance (COTA) to manage the information. COTA requires a constant space for every node on the path and the computation overhead increases linearly to the number of detection packets. We prove that the savings do not deteriorate the detection capability. Various schemes to control communication overhead are studied. The simulation and experiments on real devices show that the proposed mechanism can be combined with existent routing protocols to defend against wormhole attacks. Copyright © 2006 John Wiley & Sons, Ltd.