Designing robust routing protocols to protect base stations in wireless sensor networks

A base station is the controller and the data‐receiving center of a wireless sensor network. Hence, a reliable and secure base station is critical to the network. Once an attacker locates the base station, he or she can do many damages to the network. In this paper, we examine the base station location privacy problem from both the attack and defense sides. First, we present a new attack on base station: parent‐based attack scheme (PAS). PAS can locate a base station within one radio (wireless transmission) range of sensors in high‐density sensor networks. Different from existing methods, PAS determines the base station location on the basis of parent–child relationship of sensor nodes. Existing base station protection schemes cannot defend against PAS. Second, on the basis of PAS, we propose a two‐phase parent‐based attack scheme (TP‐PAS). Our simulation results demonstrate that TP‐PAS is able to determine the base station successfully in both low‐density and high‐density sensor networks. Then, to defend against PAS and TP‐PAS, we design a child‐based routing protocol and a parent‐free routing protocol for sensor networks. Our theory analysis and experiment results show that the parent‐free routing protocol has more communication cost and less end‐to‐end latency compared with the child‐based routing protocol. Copyright © 2012 John Wiley & Sons, Ltd.     

事件驱动的无线传感器网络MAC协议研究

在无线传感器网络中,MAC(medium access control)协议控制着无线信道使用方式和节点共享网络媒体接入,负责为节点的信道资源分配,是保证网络高效通信的重要协议,直接影响网络的整体性能。MAC协议是无线传感器网络领域中的一个广泛研究的问题,然而现有的协议较少是针对保证消息的实时性而设计的。文章结合事件驱动无线传感器网络的特性阐述了事件驱动的无线传感器网络的特点以及设计MAC协议将面临的挑战,对现有的无线传感器网络MAC协议进行了分类,并对现有的具有代表性的MAC协议做了简单的介绍,最后探讨了将来的研究方向。     

多基站数据聚合无线传感器网络中的最大生命期地理位置路由

将地理位置路由应用于多基站数据聚合无线传感器网络以最大化网络生命期.为减少传输开销并避免路由环路,提出了归属基站集合降势法,采用线性规划方法优化网络生命期.提出了基于地理位置的多基站剖分法,采用次梯度方法设计了分布式算法.通过仿真实验验证了所提算法的性能.     

无线自组网个体移动模型分析

应用Palm积分分析随机点模型、随机方向模型和随机游走模型的平稳速度分布,证明速度衰减问题源于各个移动周期内速度和持续时间的相关性.应用Palm积分和几何概率分析随机点模型和随机方向模型的平稳节点分布,证明这2种模型具有非均匀节点分布特征.应用中心极限定理证明无边界区域随机游走模型的轨迹端点成正态分布.结果表明时间型随机游走模型是最合理的个体移动模型.     

Adaptive mobility management in wireless networks

The first generation of communication protocols for wireless networks have recently been augmented by auxiliary protocols. These protocols are characterised by the open-loop nature of their control of network traffic. The authors propose a new generation of closed-loop protocols that are coupled with a real-time optimization framework. New itinerary caching is proposed and a genetic algorithm with seeding is used for optimisation. Simulation results show improvements of 20-50% in message traffic when using the proposed adaptive protocols     

飞蜂窝基站实现了家庭无线互连

可以想象有一种设备,它能够在家庭范围内提供高质量的电话服务,允许家庭成员之间不受限制地进行语音和数据交流,而每月只需要很低的费用.Femto基站通常是指飞蜂窝(Femtocell,也称为毫微微小区),它具有很多功能.这种小型无线设备放置在家庭或办公室内,可以提高本地无线覆盖.     

Analysis of hierarchical cellular networks with mobile base stations

In this paper, we develop and evaluate a hierarchical cellular architecture for totally mobile wireless networks (TMWNs). Extensive performance tests were conducted to evaluate the performance of a two‐tier system and compare its throughput, handoff blocking rate and new call success rate with those obtained by a one‐tier model. Our tests have shown that when the total number of channels is kept the same, the two‐tier system outperformed the one‐tier counterpart under all load conditions. Under the constraint of equal power consumption, the two‐tier system still achieved improvement over the one‐tier system, especially at light and medium load levels. The improvement of the two‐tier system over the one‐tier system was observed to diminish as the degree of randomness in the mobility model is reduced; scenarios where the one‐tier system outperforms the two‐tier system are given. Load balancing schemes based on the concept of reversible handoffs are introduced and their performance improvements are analyzed. Comparison results on the percentage of terminal coverage are presented. An analytical model to compute the new call and handoff blocking probabilities in TMWN is given and evaluated. The model extends the Markov chain approach previously used in hierarchical architectures with stationary base stations and uses a corrected derivation for the handoff blocking probability. Copyright © 2002 John Wiley & Sons, Ltd.     

Seamless session mobility scheme in heterogeneous wireless networks

The next generation wireless communication system will likely be heterogeneous networks, as various technologies can be integrated on heterogeneous networks. A mobile multiple‐mode device can easily access the Internet through different wireless interfaces. The mobile multiple‐mode device thus could switch to different access points to maintain the robustness of the connection when it can acquire more resources from other heterogeneous wireless networks. The mobile multiple‐mode device therefore needs to face the handover problem in such environment. This work introduces Session Initiation Protocol (SIP)‐based cross‐layer scheme to support seamless handover scheme over heterogeneous networks. The proposed scheme consists of a battery lifetime‐based handover policy and cross‐layer fast handover scheme, called the SIP‐based mobile stream control transmission protocol (SmSCTP). This work describes the major idea of the proposed scheme and infrastructure. The proposed scheme has been implemented in Linux system. The simulation and numerical results demonstrate that the proposed SmSCTP scheme yields better signaling cost, hand‐off delay time, packet loss and delay jitter than SIP and mSCTP protocols. Copyright © 2010 John Wiley & Sons, Ltd.     

Zone-based routing protocol with mobility consideration for wireless sensor networks

Hierarchical routing and clustering mechanisms in Wireless Sensor Networks (WSN) help to reduce the energy consumptions and the overhead created when all the sensor nodes in the network are sending information to the central data collection point. Most of the routing and clustering protocols proposed for WSN assume that the nodes are stationary. However, in applications like habitat monitoring or search and rescue, that assumption makes those clustering mechanisms invalid, since the static nature of sensors is not real. In this paper, we propose Zone-based Routing Protocol for Mobile Sensor Networks (ZoroMSN) that considers the design aspects such as mobility of sensors, zones and routes maintenance, information update and communication between sensor nodes. Simulation results show the effectiveness and strengths of the ZoroMSN protocol such as a low routing and mobility overhead, while achieving a good performance in WSN using small zone sizes and sensors with low speed. Simulation results also show that ZoroMSN outperforms existing LEACH-ME and LEACH-M protocols in terms of network lifetime and energy consumptions.     

Secure group communication in wireless mesh networks

Wireless mesh networks (WMNs) have emerged as a promising technology that offers low-cost community wireless services. The community-oriented nature of WMNs facilitates group applications, such as webcast, distance learning, online gaming, video conferencing, and multimedia broadcasting. Security is critical for the deployment of these services. Previous work focused primarily on MAC and routing protocol security, while application-level security has received relatively little attention. In this paper we focus on providing data confidentiality for group communication in WMNs. Compared to other network environments, WMNs present new challenges and opportunities in designing such protocols. We propose a new protocol framework, Secure Group Overlay Multicast (SeGrOM), that employs decentralized group membership, promotes localized communication, and leverages the wireless broadcast nature to achieve efficient and secure group communication. We analyze the performance and discuss the security properties of our protocols. We demonstrate through simulations that our protocols provide good performance and incur a significantly smaller overhead than a baseline centralized protocol optimized for WMNs.     

Intelligent actor mobility in wireless sensor and actor networks

In wireless sensor and actor network research, the commonly used mobility models for a mobile actor are random walk model, random waypoint mobility model, or variants thereof. For a fully connected network, the choice of mobility model for the actor is not critical because, there is at least one assured path from the sensor nodes to the actor node. But, for a sparsely connected network where information cannot propagate beyond a cluster, random movement of the actor may not be the best choice to maximize event detection and subsequent action. This paper presents static and dynamic intelligent mobility models that are based on the inherent clusters’ information of a sparsely connected network. Simulation results validate the idea behind the intelligent mobility models and provide insights into the applicability of these mobility models in different application scenarios.     

On the mobility/capacity conversion in wireless networks

Given a quality-of-service constraint, a wireless network has to sacrifice its capacity in order to support an increase in mobility. In other words, the network needs to convert some of its capacity into mobility. We develop an analytical model to evaluate the efficiency of the mobility/capacity conversion processes of several wireless networks. One practical implication of our results is that a network, if designed correctly, should have a free convertibility between the two.     

Impact of mobility on energy consumption in wireless networks

Wireless Networks - In this paper, we investigate the impacts of mobility on the characterization of energy consumption in wireless networks. Considering a linear wireless network deployed for an...     

Schemes for mobility management of wireless ATM networks

The growing fields of wireless networks and asynchronous transfer mode (ATM) are merging to form wireless ATM networks. This paper addresses dynamic bandwidth allocation, connection admission procedures, routing, and location management strategies in wireless ATM. More precisely, we investigate the issue of extending the private Network to Network Interface, PNNI, and protocols to support mobility. PNNI‐based hierarchical routing, hand‐off, location management and routing schemes are proposed to integrate wireless capabilities into ATM networks. These schemes provide fast and efficient hand‐off connection processing mechanism and a reduction in the connection disruption time during a connection hand‐off session. They also provide a predictable resource requirement of the mobile system during its connection. During a connection hand‐off, misrouted cells can be re‐routed to their destinations. This substantially reduces the overhead due to end‐to‐end re‐transmissions invoked at higher layers. An analytical model is developed to illustrate the hand‐off algorithm. Copyright © 1999 John Wiley & Sons, Ltd.     

SMDP-based sleep policy for base stations in heterogeneous cellular networks

A dense heterogeneous cellular network can effectively increase the system capacity and enhance the network coverage. It is a key technology for the new generation of the mobile communication system. The dense deployment of small base stations not only improves the quality of network service, but also brings about a significant increase in network energy consumption. This paper mainly studies the energy efficiency optimization of the Macro-Femto heterogeneous cellular network. Considering the dynamic random changes of the access users in the network, the sleep process of the Femto Base Stations (FBSs) is modeled as a Semi-Markov Decision Process (SMDP) model in order to save the network energy consumption. And further, this paper gives the dynamic sleep algorithm of the FBS based on the value iteration. The simulation results show that the proposed SMDP-based adaptive sleep strategy of the FBS can effectively reduce the network energy consumption.     

On the connectivity of wireless multi-hop networks with arbitrary wireless channel models

Considering a wireless multi-hop network where a total of n nodes are randomly, independently and uniformly distributed in a unit square in R² and each node has a uniform transmission power, a fundamental problem is to investigate the connectivity of such networks. In this letter, we prove that the probability of having a connected network and the probability of having no isolated node asymptotically converges to the same value as n goes to infinity for an arbitrary wireless channel model satisfying certain intuitively reasonable conditions.     

Energy efficient transmission scheduling for delay constrained wireless networks

In this paper, we address the problem of energy efficient packet scheduling in a wireless environment. We consider a wireless transmitter which is limited by its finite battery resource. Our objective is to design a transmission schedule that maximizes battery lifetime subject to some delay constraints. To achieve this, we exploit two previously unconnected ideas: (i) channel coding can be used to conserve energy by transmitting at reduced power levels over longer durations; (ii) electro-chemical mechanisms in batteries allow them to recover energy during idle periods. While the first idea favors extending transmission durations, the second idea requires the transmitter to be idle to allow for recovery. In other words, bursty packet transmissions interspersed with idle periods extend battery life. Therefore, a strategy which is based entirely on either one or the other idea is not optimal. We provide a framework to merge the two ideas. We consider two kinds of delay constraints, one a deadline constraint and the other an average delay constraint and show that energy aware scheduling strategies for both these scenarios can result in significant energy savings.     

Link optimization for energy‐constrained wireless networks with packet retransmissions

With the objective to minimize the energy consumption for packet based communications in energy‐constrained wireless networks, this paper establishes a theoretical model for the joint optimization of the parameters at the physical layer and data link layer. Multilevel quadrature amplitude modulation (MQAM) and automatic repeat request (ARQ) techniques are considered in the system model. The optimization problem is formulated into a three dimensional nonlinear integer programming (NIP) problem with the modulation order, packet size, and retransmission limit as variables. For the retransmission limit, a simple search method is applied to degenerate the three dimensional problem into a two dimensional NIP problem, for which two optimization algorithms are proposed. One is the successive quadratic programming (SQP) algorithm, combining with the continuous relaxation based branch‐and‐bound method, which can obtain the global optimal solution since the continuous relaxation problem is proved to be hidden convex. The other is a low‐complexity sub‐optimal iterative algorithm, combining with the nearest‐neighboring method, which can be implemented with a polynomial complexity. Numerical examples are given to illustrate the optimization solution, which suggests that the joint optimization of the physical/data link layer parameters contributes noticeably to the energy saving in energy‐constrained wireless networks. Copyright © 2010 John Wiley & Sons, Ltd.     

Traffic models for wireless communication networks

Introduces a deterministic fluid model and two stochastic traffic models for wireless networks. The setting is a highway with multiple entrances and exits. Vehicles are classified as calling or noncalling, depending upon whether or not they have calls in progress. The main interest is in the calling vehicles; but noncalling vehicles are important because they can become calling vehicles if they initiate (place or receive) a call. The deterministic model ignores the behavior of individual vehicles and treats them as a continuous fluid, whereas the stochastic traffic models consider the random behavior of each vehicle. However, all three models use the same two coupled partial differential equations (PDEs) or ordinary differential equations (ODEs) to describe the evolution of the system. The call density and call handoff rate (or their expected values in the stochastic models) are readily computable by solving these equations. Since no capacity constraints are imposed in the models, these computed quantities can be regarded as offered traffic loads. The models complement each other, because the fluid model can be extended to include additional features such as capacity constraints and the interdependence between velocity and vehicular density, while the stochastic traffic model can provide probability distributions. Numerical examples are presented to illustrate how the models can be used to investigate various aspects of time and space dynamics in wireless networks