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.     

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.     

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

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

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.     

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     

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

提出了时间依赖的混合型网络模型(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...     

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.     

基于虚拟仪器的CANopen协议监控面板设计

针对工业现场分布式总线网络的在线监控问题,提出将具有可视化编程环境的虚拟仪器软件与现场总线高层通信协议CANopen相结合,开发出具有智能化、高效化的同步实时监控界面。在分析CANopen协议标识符的基础上,使用虚拟仪器对CANopen数据报文进行打包与解析,并使用VISA接口通过自行设计的RS 232-CAN协议转换器完成数据收发,最终完成监控面板的开发,为现场总线与虚拟仪器技术相融合的发展趋势起到了一定推动作用。     

A mail and protocol conversion node for ISDN facsimile application

An adapter for conventional G3 facsimiles for communicating over an ISDN network (INS NET-64) is presented. Its external functions, architecture, and control structure are described. The adapter is targeted for a transitional market and is intended to provide reduced communication costs     

一种适用于非对称链路的Ad Hoc网络路由协议

提出了一种适用于非对称链路的Ad Hoc网络路由协议。该协议是一种基于路由池的反应式路由协议，当源节点与目标节点有数据交换时，通过路由发现过程分别在源节点和目标节点构建数据路由池和应答路由池，数据的发送和应答路径随机地从相应路由池中选取，并在数据的交换的过程中动态地更新和维护路由池。仿真结果表明该协议适用于普遍存在非对称链路的无线移动Ad Hoc网络。     

A centralized energy-efficient routing protocol for wireless sensor networks

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Several network layer protocols have been proposed to improve the effective lifetime of a network with a limited energy supply. In this article we propose a centralized routing protocol called base-station controlled dynamic clustering protocol (BCDCP), which distributes the energy dissipation evenly among all sensor nodes to improve network lifetime and average energy savings. The performance of BCDCP is then compared to clustering-based schemes such as low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), and power-efficient gathering in sensor information systems (PEGASIS). Simulation results show that BCDCP reduces overall energy consumption and improves network lifetime over its comparatives.     

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

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

A randomized energy-conservation protocol for resilient sensor networks*

In this paper we present PEAS, a randomized energy-conservation protocol that seeks to build resilient sensor networks in the presence of frequent, unexpected node failures. PEAS extends the network lifetime by maintaining a necessary set of working nodes and turning off redundant ones, which wake up after randomized sleeping times and replace failed ones when needed. The fully localized operations of PEAS are based on each individual node's observation of its local environment but do not require per neighbor state at any node; this allows PEAS to scale to very dense node deployment. PEAS is highly robust against node failures due to its simple operations and randomized design; it also ensures asymptotic connectivity. Our simulations and analysis show that PEAS can maintain an adequate working node density in presence of as high as 38% node failures, and a roughly constant overhead of less than 1% of the total energy consumption under various deployment densities. It extends a sensor network's functioning time in linear proportional to the deployed sensor population. Fan Ye received his B.E. in Automatic Control in 1996 and M.S. in Computer Science in 1999, both from Tsinghua University, Beijing, China. He received his Ph.D. in Computer Science in 2004 from UCLA. He is currently with IBM Research. His research interests are in wireless networks, sensor networks and security. Honghai Zhang received his BS in Computer Science in 1998 from University of Science and Technology of China. He received his MS and Ph.D. in Computer Science from University of Illinois at Urbana-Champaign. He is currently with the Wireless Advanced Technology Lab of Lucent Technologies. His research interests are wireless networks, WiMAX, and VoIP over wireless networks. Songwu Lu received both his M.S. and Ph.D. from University of Illinois at Urbana-Champaign. He is currently an associate professor at UCLA Computer Science. He received NSF CAREER award in 2001. His research interests include wireless networking, mobile computing, wireless security, and computer networks. Lixia Zhang received her Ph.D in computer science from the Massachusetts Institute of Technology. She was a member of the research staff at the Xerox Palo Alto Research Center before joining the faculty of UCLA’s Computer Science Department in 1995. In the past she has served on the Internet Architecture Board, Co-Chair of IEEE Communication Society Internet Technical Committee, the editorial board for the IEEE/ACM Transactions on Networking, and technical program committees for many networking-related conferences including SIGCOMM and INFOCOM. Zhang is currently serving as the vice chair of ACM SIGCOMM. Jennifer C. Hou received the Ph.D. degree in Electrical Engineering and Computer Science from The University of Michigan, Ann Arbor in 1993 and is currently a professor in the Department of Computer Science at University of Illinois at Urbana Champaign (UIUC). Prior to joining UIUC, she has taught at Ohio State University and University of Wisconsin - Madison. Dr. Hou has worked in the the areas of network modeling and simualtion, wireless-enabled software infrastructure for assisted living, and capacity optimization in wireless networks. She was a recipient of an ACM Recognition of Service, a Cisco University Research Award, a Lumley Research Award from Ohio State University, and a NSF CAREER award. ^*A Shorter version of this paper appeared in ICDCS 2003.     

A reservation-based multicast protocol for WDM optical star networks

In this paper, we present a reservation-based medium access control (MAC) protocol with multicast support for wavelength-division multiplexing networks. Our system is based on the single-hop, passive optical star architecture. Of the available wavelengths (channels), one channel is designated as a control channel, and the remaining channels are used for data transmission. Each node is equipped with a pair of fixed transceiver to access the control channel, and a fixed transmitter and a tunable receiver to access data channels. For easy implementation of the protocol in hardware and for precisely computing the protocol's processing overhead, we give a register-transfer model of the protocol. We simulate the protocol to study its throughput behavior, and present its analytic model. For a node to be able to send data packets in successive data slots with no time gap between them, in spite of the situation that the protocol's execution time may be longer than data transmission time, we propose the idea of multiple MAC units at each node. Unicast throughput of our protocol reaches the theoretically possible maximum throughput for MAC protocols with distributed control, and the multicast throughput is at least as good as, and even better than, those delivered by existing MAC protocols with distributed control.     

A novel signaling nested reservation protocol for all-optical networks

This work proposes a new reservation protocol for enhancing the performance of wavelength-routed networks. To be more robust and reliable, the proposed approach employs distributed control mechanisms. The new method particularly focuses on wavelength-division multiplexed (WDM) core networks with distant end-nodes. It takes into account the considerable amount of data that can be transferred by high-speed WDM networks within limited reservation periods. To increase the throughput, the protocol consumes the unoccupied bandwidth of reservation phases by transferring nonreal-time data packets during these intervals. This scheme is implemented by applying a modified form of backward reservation protocol. To initiate a multihop reservation call, this protocol labels a path as reserved instead of locking it. Meanwhile, labeled nodes with single-hop requests will receive permission signals to send predetermined packet sizes. The length of packets transmitted is defined by the round-trip propagation delay between the current and the upcoming nodes along the path. In case a reservation fails, already labeled nodes will be notified by receiving a prevention signal, which will block them from transferring data packets.