A hybrid beaconless geographic routing for different packets in WSN

The localized operation and stateless features of geographic routing make it become an attractive routing scheme for wireless sensor network (WSN). In this paper, we proposed a novel routing protocol, hybrid beaconless geographic routing (HBGR), which provides different mechanisms for different packets. Based on the requirement of application on latency, we divide the packets of WSN into delay sensitive packets and normal packets. HBGR uses two kinds of Request-To-Send/Clear-To-Send handshaking mechanisms for delay sensitive packets and normal packets, and assigns them different priority to obtain the channel. The simplified analysis is given, which proves that delay sensitive packets have lower latency and higher priority to obtain the channel than normal packets. Moreover, forwarding area division scheme is proposed to optimize the forwarder selection. Simulation results show that HBGR achieves higher packet delivery ratio, lower End-to-End latency and lower energy consumption than existing protocols under different packet generation rates in stationary and mobility scenario. Besides, compared with normal packets, delay sensitive packets have at least 10 % (9 %) improvement in terms of End-to-End latency. The improvement increases with the increasing of packet generation rate, and achieves 58 % (73 %) when the packet generation rate is 24 packets per second in stationary (mobility) scenario.     

WSN中基于势能场的多策略路由协议

文章结合无线传感器网络（WSN）中流量分布的向心性特点,借鉴物理学中势能场的概念与机理,提出一种开放的路由协议实现框架。利用不同的网络参数构造不同的“虚拟势能场”,叠加后形成的复合势能场将驱动数据分组沿着势场梯度变化最快的方向移动,一方面可以最终将网络中的数据分组汇聚于目的节点,实现路由协议的基本功能;同时,在动态时变“虚拟势能场”的调节下,还可以为路由协议附加各种有利于实现其他优化目标的策略与属性,如能耗均衡、拥塞避免、支持服务质量保障和利于数据聚合等,在无线传感器网络中实现多策略路由。作为例子,文章提出了一个基于势能场的提供实时传输的路由协议,它能在严格保障实时分组获得最小化端到端延迟的前提下,有效缓解网络拥塞,提高全网吞吐量。     

QoS-aware routing based on bandwidth estimation for mobile ad hoc networks

Routing protocols for mobile ad hoc networks (MANETs) have been explored extensively in recent years. Much of this work is targeted at finding a feasible route from a source to a destination without considering current network traffic or application requirements. Therefore, the network may easily become overloaded with too much traffic and the application has no way to improve its performance under a given network traffic condition. While this may be acceptable for data transfer, many real-time applications require quality-of-service (QoS) support from the network. We believe that such QoS support can be achieved by either finding a route to satisfy the application requirements or offering network feedback to the application when the requirements cannot be met. We propose a QoS-aware routing protocol that incorporates an admission control scheme and a feedback scheme to meet the QoS requirements of real-time applications. The novel part of this QoS-aware routing protocol is the use of the approximate bandwidth estimation to react to network traffic. Our approach implements these schemes by using two bandwidth estimation methods to find the residual bandwidth available at each node to support new streams. We simulate our QoS-aware routing protocol for nodes running the IEEE 802.11 medium access control. Results of our experiments show that the packet delivery ratio increases greatly, and packet delay and energy dissipation decrease significantly, while the overall end-to-end throughput is not impacted, compared with routing protocols that do not provide QoS support.     

Q-MOHRA: QoS Assured Multi-objective Hybrid Routing Algorithm for Heterogeneous WSN

Quality of Service (QoS) assurance in Wireless Sensor Network (WSN) is a tough task, and it is more exciting due to the scarcity of resources. The requirement of different WSN applications running over has different constraints. In QoS, routing protocol the network has to balance the traffic. This paper presents a novel heuristic routing algorithm known as QoS assured Multi-objective Hybrid Routing Algorithm (Q-MOHRA) for Heterogeneous WSN. Q-MOHRA takes into account the link (energy, hop count, link quality indicator etc.) and path (jitter) metrics for optimal path selection. The performance of Q-MOHRA is evaluated through intensive simulation and equated with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-objective Routing Algorithm (DyMORA). The metrics such as average energy consumption, residual energy, packet delivery ratio, jitter, and normalized routing load are used for comparison. The performance of Q-MOHRA has been observed to outclass SHRP and DyMORA. It improves the packet delivery ratio by 24.31% as compared to SHRP and 11.86% as compared to DyMORA. Q-MOHRA outperforms DyMORA in terms of average energy consumption by a factor of 8.27%.     

Load balancing and resource reservation in mobile ad hoc networks

To ensure uninterrupted communication in a mobile ad hoc network, efficient route discovery is crucial when nodes move and/or fail. Hence, protocols such as Dynamic Source Routing (DSR) precompute alternate routes before a node moves and/or fails. In this paper, we modify the way these alternate routes are maintained and used in DSR, and show that these modifications permit more efficient route discovery when nodes move and/or fail. Our routing protocol also does load balancing among the number of alternate routes that are available. Our simulation results show that maintenance of these alternate routes (without affecting the route cache size at each router) increases the packet delivery ratio. We also show that our approach enables us to provide QoS guarantees by ensuring that appropriate bandwidth will be available for a flow even when nodes move. Towards this end, we show how reservations can be made on the alternate routes while maximizing the bandwidth usage in situations where nodes do not move. We also show how the load of the traffic generated due to node movement is shared among several alternate routes. In addition, we adaptively use Forward Error Correction techniques with our protocol and show how it can improve the packet delivery ratio.     

一种基于IEEE802.11支持QoS自适应调度器模型和算法

这篇文章提出了能够有效支持QoS的IEEE802．11自适应调度器模型。和以往的支持QoS的调度器模型相比，这里根据在主控接入点(MAP：Master Access Point)和用户终端(UT：User Termination)的各自延时需求对满足不同的传输机制的分组流进行自适应调度。这种机制不仅完全兼容当前支持QoS的IEEE802．11MAC协议标准，而且能够有效减少由于实时传输带来的分组延时，增加满足不同信道负载和带宽要求的数据流的吞吐率。实时测试得到的数据基本验证了这个要求。     

Optimized Congestion Management Protocol for Healthcare Wireless Sensor Networks

The application of Wireless Sensor Networks (WSNs) in healthcare is dominant and fast growing. In healthcare WSN applications (HWSNs) such as medical emergencies, the network may encounter an unpredictable load which leads to congestion. Congestion problem which is common in any data network including WSN, leads to packet loss, increasing end-to-end delay and excessive energy consumption due to retransmission. In modern wireless biomedical sensor networks, increasing these two parameters for the packets that carry EKG signals may even result in the death of the patient. Furthermore, when congestion occurs, because of the packet loss, packet retransmission increases accordingly. The retransmission directly affects the lifetime of the nodes. In this paper, an Optimized Congestion management protocol is proposed for HWSNs when the patients are stationary. This protocol consists of two stages. In the first stage, a novel Active Queue Management (AQM) scheme is proposed to avoid congestion and provide quality of service (QoS). This scheme uses separate virtual queues on a single physical queue to store the input packets from each child node based on importance and priority of the source’s traffic. If the incoming packet is accepted, in the second stage, three mechanisms are used to control congestion. The proposed protocol detects congestion by a three-state machine and virtual queue status; it adjusts the child’s sending rate by an optimization function. We compare our proposed protocol with CCF, PCCP and backpressure algorithms using the OPNET simulator. Simulation results show that the proposed protocol is more efficient than CCF, PCCP and backpressure algorithms in terms of packet loss, energy efficiency, end-to-end delay and fairness.     

Block Reservation Time Division Multiple Access (BRTDMA) Protocol for a High Capacity Wireless Network

Next generation high capacity wireless networks need to support various types of traffic, including voice, video and data, each of which have different Quality of Service (QoS) requirements for successful transmission. This paper presents an advanced reservation packet access protocol BRTDMA (Block Reservation Time Division Multiple Access) that can accommodate voice and data traffic with equal efficiency in a wireless network. The proposed BRTDMA protocol has been designed to operate in a dynamic fashion by allocating resources according to the QoS criteria of voice and data traffic. Most of the existing reservation protocols offers reservation to voice traffic while data packets are transmitted using contention mode. In this paper we propose a block reservation technique to reserve transmission slots for data traffic for a short duration, which minimizes the speech packet loss and reduce the end-to-end delay for wireless data traffic. The optimum block reservation length for data traffic has been studied in a cellular mobile radio environment using a simulation model. Simulation results show that the BRTDMA protocol offers higher traffic capacity than standard PRMA protocol for integrated voice and data traffic and offers flexibility in accommodating multimedia traffic.     

An adaptive‐aware energy and queue improvement of AOMDV

Because the node energy and network resources in the wireless sensor network (WSN) are very finite, it is necessary to distribute data traffic reasonably and achieve network load balancing. Ad hoc on‐demand multipath distance vector (AOMDV) is a widely used routing protocol in WSN, but it has some deficiencies: establishes the route by only using hop counts as the routing criterion without considering other factors such as energy consumption and network load; forwards route request in fixed delay resulting in building the nonoptimal path; and cannot update the path status after built paths. For the deficiency of AOMDV, this paper proposes a multipath routing protocol adaptive energy and queue AOMDV (AEQAOMDV) based on adaptively sensing node residual energy and buffer queue length. When sending a routing request, the forwarding delay of the routing request is adaptively adjusted by both the residual energy and the queue length of the intermediate node; when establishing routes, a fitness is defined as a routing criterion according to the link energy and the queue load, predicting the available duration of the node based on the energy consumption rate and adjusting the weight of the routing criterion by the available duration of the node; after the routes are established, the path information status are updated via periodically broadcasting Hello that carries the path information with the minimum fitness, making the source node update the path information periodically. By using NS‐2, simulations demonstrate that compared with AOMDV, AEQAOMDV has obvious improvements in increasing packet delivery ratio, reducing network routing overhead, reducing route discovery frequency, and decreasing the network delay. And AEQAOMDV is more suitable for WSN.     

移动Ad Hoc网络中一种分布式QoS保证的多址接入协议

基于随机竞争和冲突解决的思想,本文为多跳移动Ad Hoc网络提出了一种分布式服务质量(QoS)保证的多址接入(QMA)协议.该协议中,节点在发送业务分组前利用预报突发进行竞争接入,节点根据业务分组时延情况和最早失效优先原则确定预报突发的长度,所发预报突发能持续到最后的节点优先获得接入.同时,具有实时业务的节点可以按照其优先级在更早的竞争微时隙中开始发送预报突发,而有非实时业务的节点只能在前面竞争微时隙空闲的情况下,才能在后面的微时隙开始发送预报突发,因此发送实时业务的节点可以比发送非实时业务的节点更优先接入信道,从而在移动Ad Hoc网络中实现了对多媒体业务的QoS保证.最后利用OPNET仿真评估了QMA协议的多址性能,并与IEEE 802.11e协议的性能做了比较,结果表明QMA协议可以提供较高的吞吐量和较低的实时业务时延.     

Perceptive admission control for wireless network quality of service

As wireless networks become more widely used, there is a growing need to support advanced services, such as multimedia streaming and voice over IP. Traditional approaches to guarantee quality of service (QoS) work well only with predictable channel and network access. In wireless mobile networks, where conditions dynamically change as nodes move about the network, a stateless, high level approach is required. Since shared wireless resources are easily over-utilized, the load in the network must be controlled so that an acceptable QoS for real-time applications can be maintained. If minimum real-time requirements are not met, these unusable packets waste scarce bandwidth and hinder other traffic, compounding the problem. To enable high QoS for all admitted traffic, we propose the Perceptive Admission Control (PAC) protocol. PAC monitors the wireless channel and dynamically adapts admission control decisions to enable high network utilization while preventing congestion. Through discussion, simulations and testbed experiments, we demonstrate that PAC ensures low packet loss and delay for all admitted flows.     

Energy efficient and perceived QoS aware video routing over Wireless Multimedia Sensor Networks

Wireless Sensor Networks (WSNs) have an ever increasing variety of multimedia based applications. Ιn these types of applications, network nodes should ideally maximize QoS and minimize energy expenditures in video communication. This article presents PEMuR, a novel dual scheme for efficient video communication, which aims at both energy saving and high QoS attainment. To achieve its objectives, PEMuR proposes the combined use of an energy aware hierarchical routing protocol with an intelligent video packet scheduling algorithm. The adopted routing protocol enables the selection of the most energy efficient routing paths, manages the network load according to the energy residues of the nodes and prevents useless data transmissions through the proposed use of an energy threshold. In this way, an outstanding level of energy efficiency is achieved. Additionally, the proposed packet scheduling algorithm enables the reduction of the video transmission rate with the minimum possible increase of distortion. In order to do so, it makes use of an analytical distortion prediction model that can accurately predict the resulted video distortion due to any error pattern. Thus, the algorithm may cope with limited available channel bandwidth by selectively dropping less significant packets prior to their transmission. Simulation results demonstrate the effectiveness of the proposed scheme.     

Ad Hoc网络中一种随机化分布式QoS路由算法

针对无线移动Ad Hoc网络(Mobile Ad Hoc Network,MANET),采用一种基于随机化分布式QoS路由算法RBAD(Random-Based Distributed QoS Routing Algorithm),该算法依据信道条件和业务量优化分组在多条路径上的路由,及寻找路由和存储路由表的代价,通过对结点排序,达到实现网络平均时延和平均消息复杂度最小的目标。仿真结果表明该算法能够以较小的路由消息开销获得较高的路由成功率,此外,算法具有可扩展性,可以应用于较大规模的Ad Hoc网络。     

A Shoelace-Based QoS Routing Protocol for Mobile Ad Hoc Networks Using Directional Antenna

In this paper, we propose a new quality-of-service (QoS) routing protocol for mobile ad hoc network (MANET) using directional antennas. The proposed scheme offers a bandwidth-based routing protocol for QoS support in MANET using the concept of multi-path. Our MAC sub-layer adopts the CDMA-over-TDMA channel model. The on-demand QoS routing protocol calculates the end-to-end bandwidth and allocates bandwidth from the source node to the destination node. The paths are combined with multiple cross links, called shoelace, when the network bandwidth is strictly limited. Due to the property of the directional antenna, these cross links can transmit data simultaneously without any data interference. We develop a shoelace-based on-demand QoS routing protocol by identifying shoelaces in a MANET so as to construct a QoS route, which satisfied the bandwidth requirement, more easily. The shoelace-based route from the source to the destination is a route whose sub-path is constructed by shoelace structure. With the identified shoelaces, our shoelace-based scheme offers a higher success rate to construct a QoS route. Finally, simulation results demonstrate that the proposed routing protocol outperform existing QoS routing protocols in terms of success rate, throughput, and average latency.     

Route Stability Based QoS Routing in Mobile Ad Hoc Networks

To provide high quality communications service among mobile wireless devices is basically a challenging task in wireless ad hoc networks. In this paper, we propose a Route Stability based QoS Routing (RSQR) protocol in Mobile Ad Hoc Networks (MANETs) which is an extension of QoS routing with throughput and delay constraints. Ensuring a data path to be valid for sufficiently longer period of time is a very difficult problem in MANET due to its highly dynamic nature. We propose a simple model for computing link stability and route stability based on received signal strengths. By including some extra fields in route request/reply packets, the route stability information can be utilized to select a route with higher stability among all the feasible routes between a given source destination pair. Further, inclusion of a signal strength based admission control enhances the performance of the routing. Results of our experiments show performance improvements in terms of packet delivery ratio, control overhead and average end-to-end delay in comparison with a QoS routing protocol proposed by Q. Xue and A. Ganz.     

A distributed laxity-based priority scheduling scheme for time-sensitive traffic in mobile ad hoc networks

Characteristics of Mobile Ad hoc Networks such as shared broadcast channel, bandwidth and battery power limitations, highly dynamic topology, and location dependent errors, make provisioning of quality of service (QoS) in such networks very difficult. The Medium Access Control (MAC) layer plays a very important role as far as QoS is concerned. The MAC layer is responsible for selecting the next packet to be transmitted and the timing of its transmission. We have proposed a new MAC layer protocol that includes a laxity-based priority scheduling scheme and an associated back-off scheme, for supporting time-sensitive traffic. In the proposed scheduling scheme, we select the next packet to be transmitted, based on its priority value which takes into consideration the uniform laxity budget of the packet, the current packet delivery ratio of the flow to which the packet belongs, and the packet delivery ratio desired by the user. The back-off mechanism devised by us grants a node access to the channel, based on the rank of its highest priority packet in comparison to other such packets queued at nodes in the neighborhood of the current node. We have studied the performance of our protocol that combines a packet scheduling scheme and a channel access scheme through simulation experiments, and the simulation results show that our protocol exhibits a significant improvement in packet delivery ratio under bounded end-to-end delay requirements, compared to the existing 802.11 DCF and the Distributed Priority Scheduling scheme proposed recently in [ACM Wireless Networks Journal 8 (5) (2002) 455–466; Proceedings of ACM MOBICOM '01, July 2001, pp. 200–209].     

一种基于路径信息的WSN路由协议

AODV是一种广泛应用于MANET的按需路由协议,但是它并不完全适用于WSN。本文通过改进AODV协议基于洪泛的路由机制,提出了一种适用于WSN的低开销、低时延的路由协议IAODV。仿真结果表明:与AODV协议相比,IAODV协议可以在保持较高的分组投递率的同时有效降低数据分组的平均端到端时延和路由开销,达到了低开销、低时延的设计目标。     

An Application Oriented Power Saving MAC Protocol for Wireless Sensor Networks

Energy efficiency has been an important concern in wireless sensor networks where Medium Access Control (MAC) protocol plays an important role. However, current MAC protocols designed for energy saving have seldom considered multiple applications coexisting in WSN with variation of traffic load dynamics. In this paper, we propose an adaptive control algorithm at MAC layer to promote energy efficiency. We focus on the tradeoff relation between collisions and control overhead as a reflection of traffic load and propose to balance the tradeoff under the constraints of QoS options. We integrate the algorithm into S-MAC and verify it through NS-2 platform. The simulation results demonstrate that our algorithm achieves observable improvement in energy performance while meeting QoS requirement for different coexisting applications in comparison with S-MAC.     

An efficient demand-assignment multiple access protocol for wireless packet (ATM) networks

In a wireless packet (ATM) network that supports an integrated mix of multimedia traffic, the channel access protocol needs to be designed such that mobiles share the limited communications bandwidth in an efficient manner: maximizing the utilization of the frequency spectrum and minimizing the delay experienced by mobiles. In this paper, we propose and study an efficient demand-assignment channel access protocol, which we call Distributed-Queueing Request Update Multiple Access (DQRUMA). The protocol can be used for a wide range of applications and geographic distances. Mobiles need to send requests to the base station only for packets that arrive to an empty buffer. For packets that arrive to a non-empty buffer, transmission requests are placed collision-free by piggybacking the requests with packet transmissions. The simulation results show that even with the worst possible traffic characteristics, the delay-throughput performance of DQRUMA is close to the best possible with any access protocol. In addition, explicit slot-by-slot announcement of the transmit permissions gives the base station complete control over the order in which mobiles transmit their packets. This important feature helps the base station satisfy diverse Quality-of-Service (QoS) requirements in a wireless ATM network.     

ETPS-MAC: Energy Traffic Priority Scheduling-based QoS-aware MAC protocol for hierarchical WSNs

The evolution of the wireless sensor network (WSN) in recent years has reached its greatest heights and applications are increasing day by day, one such application is Smart Monitoring Systems (SMSs) which is in vision of implementation in every urban and rural areas. The implementation of WSN architecture in SMS needs an intelligent scheduling mechanism that efficiently handles the dynamic traffic load without sacrificing the energy efficiency of network. This paper presents a centralized TDMA scheduling based medium access control (MAC) protocol, called Energy Traffic Priority Scheduling MAC (ETPS-MAC) that accommodates variable traffic load while maintaining Quality-of-Service (QoS) assurance in hierarchical WSNs. The ETPS-MAC protocol employs priority scheduling algorithm which considers two factors for assigning priority, the energy factor and the traffic load factor to avoid packet buffering and maintains minimum data packet delay in case of high traffic load. Moreover, a novel rank-based clustering mechanism in FPS-QMAC protocol prolongs the network lifetime by minimizing the distance between the cluster head (CH) and the base station (BS). Both analytical and simulation models demonstrate the superiority of the ETPS-MAC protocol in terms of energy consumption, transmission delay, data throughput and message complexity when compared with the existing TDMA based MAC protocols.