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     

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     

无线传感器网络分簇路由协议研究

在无线传感器网络中,分簇型路由在路由协议中占据重要的地位,该协议方便拓扑结构管理,能源利用率高,数据融合简单。文章从簇头生成、簇形成和簇路由3个角度对典型的分簇路由算法LEACH,HEED,EEUC,PEGASIS进行了系统描述,从网络生命周期和节点存活数量等方面,对比了其优缺点,结合该领域的研究现状,指出了未来研究的方向。     

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.     

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

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

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.     

移动Ad Hoc网络中的一种功率控制MAC协议

本文提出了一种应用于移动Ad Hoc网络中的功率控制MAC（medium access contr01）协议，通过两个通信节点之间的控制包中的信息交换来决定数据包的发送功率以及其它邻节点下一次发送RTS控制包的功率。通过仿真与IEEE 802．11 MAC协议进行比较，由仿真结果可以看出，该协议能大大减少移动节点消耗的功率，提高节点的能量利用效率，并保持系统的吞吐量性能。     

Quasi-FIFO back-off scheme for collision resolution in wireless networks

This paper proposes a quasi-FIFO (QFIFO) back-off scheme for collision resolution in wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) schemes. Since the maximum throughput is achieved when the back-off window size equals the number of users, the average number of users involved in each collision slot is derived to estimate the number of simultaneously competing users. In the QFIFO scheme, service time is divided into a series of cycles. Packets arrive in the current cycle are guaranteed to be serviced prior to any packet generated in the next cycle and the first-in-first-out (FIFO) principle can thus be semi-accomplished. Simulation results demonstrate that the unfairness of bandwidth utilization in the BEB is significantly mitigated and the throughput can be maintained at 0.368 when the number of users approaches infinity. The capture effect even further improves system performance.     

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.     

Load-balanced broadcast routing in wireless Ad-hoc networks

In wireless Ad-hoc networks, where mobile hosts are powered by batteries, the entire network may be partitioned because of the drainage of a small set of batteries.Therefore, the crucial issue is to improve the energy efficiency, with an objective of balancing energy consumption.A greedy algorithm called weighted minimum spanning tree (WMST) has been proposed, in which time complexity is O(n2).This algorithm takes into account the initial energy of each node and energy consumption of each communication.Simulation has demonstrated that the performance of the proposed algorithm improves the load balance and prolongs the lifetime.     

光无线混合接入网中风险感知节能路由算法

研究了光无线混合接入网中具有抗毁能力的节能路由问题,结合光网络单元( ONU)休眠控制和风险备用路由表维护机制,提出一种有效的可靠绿色路由算法.该算法为每个无线路由器维护一个风险表,以记录网络中路径是否可用以及ONU活跃与否的状态信息,通过鼓励选择ONU活跃的可用路径来传榆数据,可降低全网丢包率和能耗.仿真结果表明:该算法能够在稳定丢包率的同时更好地节省能量.     

WSN中能量有效分簇多跳路由算法

针对现有无线传感器网络(WSN)分簇路由算法存在的能耗不均衡问题,提出一种能量有效分簇多跳路由算法,该算法包括两个方面:一是选举簇首时引入簇内平均剩余能量因子,根据上一轮结束后簇内各节点剩余能量和簇内节点的平均剩余能量的比值更新簇首在所有节点中所占的百分比;二是要求簇首根据MTE多跳路由协议与基站通信,从而均衡WSN整...     

Novel MAC protocol for terahertz ultra-high data-rate wireless networks

Due to having a large bandwidth to support Gbps-level data rate, terahertz communication attracts more and more attention in recent years. However, there are few medium access control （MAC） protocols for terahertz ultra-high data-rate wireless networks, which affects the research and application of terahertz communications. To address this problem and to achieve ultra-high data-rate wireless access with terahertz communication, a novel MAC protocol, called medium access control for terahertz communication （MAC-TC）, is proposed. Through designing a new channel access scheme, a new superframe structure, and related key parameters, MAC-TC can support a maximum data rate up to 10 Gbit/s even higher. Theoretical analysis and simulation results show that our proposed MAC protocol realizes the function of medium access control and attains a maximum data rate of 18.3 Gbit/s, which is 2 times higher than 5.78 Gbit/s, the theoretical maximum data rate of IEEE 802.15.3c standard.     

一种能量均衡的无线传感器网络协议

提出了一种能量均衡的无线传感器网络协议。在此协议中,用以基站为圆心一定距离为半径的环状带将目标网络覆盖区域分为三部分,靠近圆心的节点和环状带内节点采用单跳方式直接跟基站通信,环状带以外的节点采用多跳方式跟环状带内节点通信;节点保存多条到基站的最短路由,采用轮循机制选择一条路由传输数据,从而将数据传输任务均衡的分配到多条线路上;当环状带内节点的能量值达到一个阀值时修改环状带的半径和宽度,重新组网,从而将即将形成的"热区"转移到其他区域,达到延长无线传感器网络的生命周期。     

多跳无线网络中一种基于博弈理论的拓扑控制算法

根据博弈论思想为多跳无线网络中的拓扑控制问题设计了一种新颖的收益函数,该收益函数不仅考虑了网络的连接性,而且还考虑了网络的干扰特性和路由性能。理论分析表明,根据此收益函数,网络行为将收敛于一个理想的稳定状态(纳什均衡点),通过最佳响应算法可以求得此稳定状态。     

一种基于功率控制的无线传感器网络MAC协议

提出了一种基于功率控制机制的无线传感器网络MAC协议 Distance Prediction Power Control MAC (DPPC-MAC).DPPC-MAC协议基于目前十分成熟的SMAC协议[1-2],引入了功率控制机制以降低数据包发送时的能耗,并且提出了一种新的通过功率预测距离来解决暴露终端和隐藏终端的方法.仿真结果表明,DPPC-MAC能有效降低网络能耗,同时吞吐量性能也得到了一定的改善.     

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

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

有/无线ATM网的组播选路算法

本文提出一种组播选路算法,在组播连接路由树的代价函数中计入了移动成员的越区切换发生概率,使为移动成员服务的接入节点（ＡＰ）尽可能成为组播路由树的树叶节点。当移动成员发生越区切换以后,可减去原来为之服务的ＡＰ和相应的树枝通道链路,从而保证了网络资源得以有效地利用。数值模拟分析的结果表明,我们提出的算法达到了这一目的。