A routing protocol based on node density for ad hoc networks

Ad hoc networks are a type of mobile network that functions without any fixed infrastructure. One of the weaknesses of ad hoc networks is that a route used between a source and a destination is likely to break during communication. To solve this problem, one approach consists of selecting routes whose nodes have the most stable behavior. Another strategy aims at improving the route repair procedure. This paper proposes a method for improving the success rate of local route repairs in mobile ad hoc networks. This method is based on the density of the nodes in the neighborhood of a route and on the availability of nodes in this neighborhood. Theoretical computation and simulation results show that the data packet loss rate decreased significantly compared to other methods which are well-documented in the literature. In addition, the time required to complete a local route repair following a failure was significantly reduced.     

Energy-efficient neighbor discovery protocol for mobile wireless sensor networks

Low energy consumption is a critical design requirement for most wireless sensor network (WSN) applications. Due to minimal transmission power levels, time-varying environmental factors and mobility of nodes, network neighborhood changes frequently. In these conditions, the most critical issue for energy is to minimize the transactions and time consumed for neighbor discovery operations. In this paper, we present an energy-efficient neighbor discovery protocol targeted at synchronized low duty-cycle medium access control (MAC) schemes such as IEEE 802.15.4 and S-MAC. The protocol effectively reduces the need for costly network scans by proactively distributing node schedule information in MAC protocol beacons and by using this information for establishing new communication links. Energy consumption is further reduced by optimizing the beacon transmission rate. The protocol is validated by performance analysis and experimental measurements with physical WSN prototypes. Experimental results show that the protocol can reduce node energy consumption up to 80% at 1–3 m/s node mobility.     

An adaptive low-overhead resource discovery protocol for mobile ad-hoc networks

In this paper we propose a Distributed Hash Table (DHT)-based peer-to-peer resource discovery protocol designed for large-scale Mobile Ad-hoc NETwork (MANET). The proposed Mobile Resource Discovery Protocol (MRDP) uses a distributed dynamic clustering algorithm to adaptively and rapidly group nodes in a MANET for resource discovery purpose, and utilizes DHTs to efficiently cache resource information in a peer-to-peer manner. We provide a probabilistic lower bound on the performance of the MRDP. We also present simulation results under different scenarios to show that MRDP has low message overheads and its performance is highly insensitive to the size of the MANET. These characteristics make MRDP suitable for large-scale MANETs.     

Efficient reporting node selection-based MAC protocol for wireless sensor networks

Wireless sensor networks rely on the cooperative effort of the densely deployed sensor nodes to report the detected events. As a result, sensor observations are highly correlated in the space domain. Typically, multiple sensor nodes may report the same event. Consequently, redundant information may be transmitted by the different sensor nodes, leading thus to unnecessary energy wastage. In this paper, we investigate the relationship between the spatial correlation and the number of reporting nodes by developing a new analytical model based on the theoretical framework of the CC-MAC (correlation-based collaborative medium access control) protocol (Vuran and Akyildiz in IEEE/ACM Trans Netw 14(2): 316–32912006). We show that the reporting task can be delegated to a small subset of sensor nodes without transgressing the distortion constraint. Building on this result, a simple spatial correlation medium access control protocol is then proposed to achieve further energy conservation and faster reporting latency than CC-MAC.     

A reliable quality of service aware fault tolerant gateway discovery protocol for vehicular networks

A great interest in vehicular ad‐hoc networks has been noticed by the research community. General goals of vehicular networks are to enhance safety on the road and to ensure the convenience of passengers by continuously providing them, in real time, with information and entertainment options such as routes to destinations, traffic conditions, facilities' information, and multimedia/Internet access. Indeed, time efficient systems that have high connectivity and low bandwidth usage are most needed to cope with realistic traffic mobility conditions. One foundation of such a system is the design of an efficient gateway discovery protocol that guarantees robust connectivity between vehicles, while assuring Internet access. Little work has been performed on how to concurrently integrate load balancing, quality of service (QoS), and fault tolerant mechanisms into these protocols. In this paper, we propose a reliable QoS‐aware and location aided gateway discovery protocol for vehicular networks by the name of fault tolerant location‐based gateway advertisement and discovery. One of the features of this protocol is its ability to tolerate gateway routers and/or road vehicle failure. Moreover, this protocol takes into consideration the aspects of the QoS requirements specified by the gateway requesters; furthermore, the protocol insures load balancing on the gateways as well as on the routes between gateways and gateway clients. We discuss its implementation and report on its performance in contrast with similar protocols through extensive simulation experiments using the ns‐2 simulator. Copyright © 2013 John Wiley & Sons, Ltd.     

Hidden node collision recovery protocol for low rate wireless personal area networks

Referring to most media access control (MAC) protocols in low rate personal area networks (LR‐WPANs), there is no hidden node collision avoidance mechanism utilized. Quantitative analysis in this paper based on the IEEE 802.15.4 specification shows a high probability of the continuous hidden node collisions (CHNCs), which seriously decreases network throughput. Based on this observation, we propose a cost‐efficient recovery mechanism to achieve fast self‐healing when LR‐WPANs suffer CHNCs, while introducing no overhead when there are no collisions. Simulation results demonstrate the efficiency of our proposed protocol in terms of network throughput and power saving. Copyright © 2011 John Wiley & Sons, Ltd.     

基于扩展邻居发现协议的嵌套移动网络路由优化方案

嵌套移动网络在扩大通信范围的同时会带来严重的路由优化问题。针对已有优化方案在可部署性和性能等方面的不足提出了一种新的嵌套移动网络路由优化方案（NMNRO）,通过扩展邻居发现协议,在嵌套移动网络内通告相同的外地前缀,并更新接入路由器的邻居缓存和移动路由器的路由表,然后通过向对端发送绑定更新来实现路由优化。性能分析表明,该方案为嵌套移动网络提供了较为完整的路由优化方案,在降低优化开销的同时,具有较好的可部署性和兼容性。仿真实验结果表明该方案具有较低的切换时延和较高的有效吞吐量,且这些性能优势会随嵌套层数的增加而更加明显。     

基于CANopen协议的延伸报警器研制

为了提高船舶机舱的延伸报警安全性和互联通信可靠性及实时控制性,文中提出基于LPC1768为核心采用CANopen通信协议的机舱延伸报警系统,可以进一步提高系统的可靠性、通信效率及灵活性.系统采用模块思想设计,实现了主站人工、自动切换,系统运行状态自我监测,运行状态显示和声光报警等功能,阐述了系统硬件设计、CANopen协议软件的实现过程(包括节点的对象字典和通信模型建立).结果表明该系统能够准确侦听报警信息,且结构简单.能够满足船舶延伸报警的要求、提高了延伸报警的可靠性和兼容性.     

一种能量平衡的无线体域网络AODV多播路由发现协议

在动态网络拓扑中,AODV协议通过数据源节点S泛洪广播RREQ消息请求到任意目标节点D的路由,而在无线体域网络中,只有一个sink目标节点,除最短跳数路由上的节点外,其他参与RREQ接收和转发的节点浪费了能量。提出了一种能量平衡的无线体域网络AODV多播路由发现协议,通过在节点广播的hello消息中增加到sink的最小跳数hops、到sink的下一跳节点next和节点本身是否具备转发能力isforward 3 个参数,只选择能到达sink节点的邻居节点参与转发RREQ消息,变广播为多播,有效地降低了路由发现的能量开销,并通过能量平衡延长了WBAN的使用寿命。性能分析与模拟实验表明,该协议在RREQ数量、数据传输率和能量消耗等方面优于相似协议EAAODV。     

PND: a p‐persistent neighbor discovery protocol in wireless networks

In wireless communications research, a number of literature assume that every node knows all of its neighbor nodes. To this end, neighbor discovery research has been conducted, but it still has room for improvement in terms of discovery delay. Furthermore, prior work has overlooked energy efficiency, which is considered as the critical factor in wireless devices or appliances. For better performance with respect to the discovery delay and energy efficiency, we proposed a novel p‐persistent‐based neighbor discovery protocol and devised a simple and light algorithm estimating the number of neighbor nodes to support the proposed protocol. Our protocol requires a lower delay and a smaller number of messages for the discovery process than the existing protocols. For extensive performance evaluation, we adopted extra comparison targets from other research areas within the same context. Copyright © 2011 John Wiley & Sons, Ltd.     

Neighbor initiated approach for avoiding deaf and hidden node problems in directional MAC protocol for ad-hoc networks

In this paper we propose a MAC called “Neighbor Initiated Approach for avoiding Deaf and Hidden node problems in directional MAC protocol for Ad Hoc networks”, which takes advantage of the multi beam smart antennas. Through the antenna, a node can simultaneously transmit/receive a packet to/from all the directions around it. Thus the antenna switches itself in transmission and reception mode. In our scheme all transmission and reception will be directional. We discussed the hidden and deaf node problems with directional MAC and proposed the scheme to overcome those shortcomings. Our scheme has been inspired by the IEEE 802.11, which includes a new scheme to inform its neighbors who was deaf due to other communication. Moreover, the simultaneous transmission of the RTS/CTS through it’s all beams prevent the hidden node problem. In our scheme the idle nodes stay in reception mode for sensing the channel through its M non overlapping beams, as a substitute of omnidirectional antenna. It prevents the hidden node problem due to asymmetry in gain. We have simulated our scheme by OPNET 16.0, and compared our results with CDR MAC, DMAC and IEEE 802.11 protocols. Our results show that NIADH performs better than that of the existing protocols in majority of the scenarios.     

Controlling with CANopen [industrial control networks]

Fieldbus systems have become an important factor in communication between industrial control devices. In this paper, the authors report how, since originating as an Esprit project, CANopen has evolved to become an increasingly popular real-time networking system     

New spray and wait protocol with node activity in heterogeneous delay tolerant networks

The spray and wait protocol is a classic copy-limited spraying protocol in delay tolerant networks, in which, the binary spray mode can be improved for heterogeneous delay tolerant networks. In this article, a new conception of node activity was defined to weigh the importance of nodes in aspect of message dissemination in the whole network. A new spray and wait protocol with node activity was proposed to improve the performance in heterogeneous delay tolerant networks. A mathematical model used under varieties of the spraying protocols was also proposed to analyze the expected delay of the protocol. Simulations show that the spray token proportion with node activity is optimal and the new protocol is of better performance than other related protocols. Therefore, this protocol has high efficiency and good scalability.     

AIRMAIL: A link-layer protocol for wireless networks

This paper describes the design and performance of a link-layer protocol for indoor and outdoor wireless networks. The protocol is asymmetric to reduce the processing load at the mobile, reliability is established by a combination of automatic repeat request and forward error correction, and link-layer packets are transferred appropriately during handoffs. The protocol is namedAIRMAIL (AsymmetrIc Reliable Mobile Access In Link-layer). The asymmetry is needed in the design because the mobile terminals have limited power and smaller processing capability than the base stations. The key ideas in the asymmetric protocol design consist of placing bulk of the intelligence in the base station as opposed to placing it symmetrically, in requiring the mobile terminal to combine several acknowledgments into a single acknowledgment to conserve power, and in designing the base stations to send periodic status messages, while making the acknowledgment from the mobile terminal eventdriven. The asymmetry in the protocol design results in a one-third reduction of compiled code. The forward error correction technique incorporates three levels of channel coding which interact adaptively. The motivation for using a combination of forward error correction and link-layer retransmissions is to obtain better performance in terms of end-to-end throughput and latency by correcting errors in an unreliable wireless channel in addition to end-to-end correction rather than by correcting errors only by end-to-end retransmissions. The coding overhead is changed adaptively so that bandwidth expansion due to forward error correction is minimized. Integrity of the link during handoffs (in the face of mobility) is handled by window management and state transfer. The protocol has been implemented. Experimental performance results based on the implementation are presented.     

A lightweight identity authentication protocol for vehicular networks

In vehicular ad-hoc networks (VANETs), vehicles perform a handover procedure in order to connect to the next RSU. In general, the handover procedure comprises two stages, namely searching for an appropriate road side unit (RSU) to connect to and performing an authentication procedure with the selected RSU. Since the vehicles in a VANET typically have a high mobility, frequent handover operations are required, and thus the transmission delay is inevitably increased. Accordingly, this paper proposes an authentication method designated as LIAP (Lightweight Identity Authentication Protocol) to reduce the handover authentication delay. LIAP employs a DSSP (Dynamic Session Secret Process) method to improve the speed and computational efficiency of the authentication process whilst simultaneously concealing the sensitive information of the vehicle. The security analysis results and performance evaluations show that LIAP not only provides an efficient and confidential authentication capability, but also preserves the robustness of the VANET toward malicious attacks.     

时间依赖的混合型网络的分布式路由协议

提出了时间依赖的混合型网络模型(HTDN 模型),有效地描述了网络中链路权值随时间变化的特性,并且网络中的节点可以采用不同的等待策略;并给出了 HTDN 模型的路径优化理论。在此基础上设计了有效的分布式路由协议 DMDRP,能计算出 HTDN 模型中所有节点对之间的最短延时路径,并证明了协议的正确性。最后通过仿真试验,给出了 DMDRP 协议与传统路由方案的性能对比分析。     

A cooperative protocol for pervasive underwater acoustic networks

Wireless Networks - The novel Underwater Wireless Sensor Network (UWSN) can contribute to monitor and explore aquatic environments. But, communicating in these environments is still hard and has...