WorldWideScience

Sample records for wireless multi-hop networks

  1. Wireless Multi Hop Access Networks and Protocols

    OpenAIRE

    Nilsson Plymoth, Anders

    2007-01-01

    As more and more applications and services in our society now depend on the Internet, it is important that dynamically deployed wireless multi hop networks are able to gain access to the Internet and other infrastructure networks and services. This thesis proposes and evaluates solutions for providing multi hop Internet Access. It investigates how ad hoc networks can be combined with wireless and mesh networks in order to create wireless multi hop access networks. When several access points t...

  2. Connectivity model for Inter-working multi-hop wireless networks

    CSIR Research Space (South Africa)

    Salami, O

    2009-08-01

    Full Text Available pairs in inter-working multi-hop wireless networks can be evaluated based on the availability of radio links and communication routes. This paper presents an analytical study of the link and route availability in inter-working multi-hop wireless networks....

  3. Performance analysis of multi-hop wireless packet networks

    Directory of Open Access Journals (Sweden)

    Lim J.-T.

    1997-01-01

    Full Text Available In this paper, a unified analytical framework for performance analysis of multi-hop wireless packet networks is developed. The effect of coupling between the hops on the degradation of the delay-throughput characteristics and the probability of blocking is investigated. The issue of hop decoupling is addressed.

  4. Adjusting Sensing Range to Maximize Throughput on Ad-Hoc Multi-Hop Wireless Networks

    National Research Council Canada - National Science Library

    Roberts, Christopher

    2003-01-01

    .... Such a network is referred to as a multi-hop ad-hoc network, or simply a multi-hop network. Most multi-hop network protocols use some form of carrier sensing to determine if the wireless channel is in use...

  5. Cross-layer optimization of wireless multi-hop networks

    OpenAIRE

    Soldati, Pablo

    2007-01-01

    The interest in wireless communications has grown constantly for the past decades, leading to an enormous number of applications and services embraced by billions of users. In order to meet the increasing demand for mobile Internet access, several high data-rate radio networking technologies have been proposed to offer wide area high-speed wireless communications, eventually replacing fixed (wired) networks for many applications. This thesis considers cross-layer optimization of multi-hop rad...

  6. Security for multi-hop wireless networks

    CERN Document Server

    Mahmoud, Mohamed M E A

    2014-01-01

    This Springer Brief discusses efficient security protocols and schemes for multi-hop wireless networks. It presents an overview of security requirements for these networks, explores challenges in securing networks and presents system models. The authors introduce mechanisms to reduce the overhead and identify malicious nodes that drop packets intentionally. Also included is a new, efficient cooperation incentive scheme to stimulate the selfish nodes to relay information packets and enforce fairness. Many examples are provided, along with predictions for future directions of the field. Security

  7. Spatial reuse of wireless medium in multi-hop wireless sensor networks

    NARCIS (Netherlands)

    Geerlings, J.; Geerlings, J.; van Hoesel, L.F.W.; Hoeksema, F.W.; Slump, Cornelis H.; Havinga, Paul J.M.

    2007-01-01

    The idea of multi-hop communication originates from the 1990’s and is eagerly incorporated in the wireless sensor network research field, since a tremendous amount of energy can be saved by letting —often battery powered– nodes in the network assist each other in forwarding packets. In such systems

  8. Wireless multi-hop networks with stealing : large buffer asymptotics

    NARCIS (Netherlands)

    Guillemin, F.; Knessl, C.; Leeuwaarden, van J.S.H.

    2010-01-01

    Wireless networks equipped with CSMA are scheduled in a fully distributed manner. A disadvantage of such distributed control in multi-hop networks is the hidden node problem that causes the effect of stealing, in which a downstream node steals the channel from an upstream node with probability p.

  9. Routing protocol for wireless quantum multi-hop mesh backbone network based on partially entangled GHZ state

    Science.gov (United States)

    Xiong, Pei-Ying; Yu, Xu-Tao; Zhang, Zai-Chen; Zhan, Hai-Tao; Hua, Jing-Yu

    2017-08-01

    Quantum multi-hop teleportation is important in the field of quantum communication. In this study, we propose a quantum multi-hop communication model and a quantum routing protocol with multihop teleportation for wireless mesh backbone networks. Based on an analysis of quantum multi-hop protocols, a partially entangled Greenberger-Horne-Zeilinger (GHZ) state is selected as the quantum channel for the proposed protocol. Both quantum and classical wireless channels exist between two neighboring nodes along the route. With the proposed routing protocol, quantum information can be transmitted hop by hop from the source node to the destination node. Based on multi-hop teleportation based on the partially entangled GHZ state, a quantum route established with the minimum number of hops. The difference between our routing protocol and the classical one is that in the former, the processes used to find a quantum route and establish quantum channel entanglement occur simultaneously. The Bell state measurement results of each hop are piggybacked to quantum route finding information. This method reduces the total number of packets and the magnitude of air interface delay. The deduction of the establishment of a quantum channel between source and destination is also presented here. The final success probability of quantum multi-hop teleportation in wireless mesh backbone networks was simulated and analyzed. Our research shows that quantum multi-hop teleportation in wireless mesh backbone networks through a partially entangled GHZ state is feasible.

  10. Backoff-stage synchronization in three-hop string-topology wireless networks with hidden nodes

    Science.gov (United States)

    Sanada, Kosuke; Sekiya, Hiroo; Komuro, Nobuyoshi; Sakata, Shiro

    In IEEE 802.11 wireless multi-hop networks, each node works individually and their individual operations generate entire network dynamics. It is important to clarify the network dynamics in wireless multi-hop networks for designing and constructing multi-hop communication networks. This paper presents the network-dynamics investigations for three-hop string-topology wireless network in detail. From the investigations, a “backoff-stage synchronization” phenomenon, which is mutuality between hidden nodes, is found. The mechanism of the backoff-stage synchronization is expressed and the sufficient conditions for the synchronization occurrence are given. This phenomenon gives some impacts on the IEEE 802.11 multi-hop-network communications.

  11. Dynamic Task Allocation in Multi-Hop Multimedia Wireless Sensor Networks with Low Mobility

    Directory of Open Access Journals (Sweden)

    Klaus Moessner

    2013-10-01

    Full Text Available This paper presents a task allocation-oriented framework to enable efficient in-network processing and cost-effective multi-hop resource sharing for dynamic multi-hop multimedia wireless sensor networks with low node mobility, e.g., pedestrian speeds. The proposed system incorporates a fast task reallocation algorithm to quickly recover from possible network service disruptions, such as node or link failures. An evolutional self-learning mechanism based on a genetic algorithm continuously adapts the system parameters in order to meet the desired application delay requirements, while also achieving a sufficiently long network lifetime. Since the algorithm runtime incurs considerable time delay while updating task assignments, we introduce an adaptive window size to limit the delay periods and ensure an up-to-date solution based on node mobility patterns and device processing capabilities. To the best of our knowledge, this is the first study that yields multi-objective task allocation in a mobile multi-hop wireless environment under dynamic conditions. Simulations are performed in various settings, and the results show considerable performance improvement in extending network lifetime compared to heuristic mechanisms. Furthermore, the proposed framework provides noticeable reduction in the frequency of missing application deadlines.

  12. Multi-hop localization algorithm based on grid-scanning for wireless sensor networks.

    Science.gov (United States)

    Wan, Jiangwen; Guo, Xiaolei; Yu, Ning; Wu, Yinfeng; Feng, Renjian

    2011-01-01

    For large-scale wireless sensor networks (WSNs) with a minority of anchor nodes, multi-hop localization is a popular scheme for determining the geographical positions of the normal nodes. However, in practice existing multi-hop localization methods suffer from various kinds of problems, such as poor adaptability to irregular topology, high computational complexity, low positioning accuracy, etc. To address these issues in this paper, we propose a novel Multi-hop Localization algorithm based on Grid-Scanning (MLGS). First, the factors that influence the multi-hop distance estimation are studied and a more realistic multi-hop localization model is constructed. Then, the feasible regions of the normal nodes are determined according to the intersection of bounding square rings. Finally, a verifiably good approximation scheme based on grid-scanning is developed to estimate the coordinates of the normal nodes. Additionally, the positioning accuracy of the normal nodes can be improved through neighbors' collaboration. Extensive simulations are performed in isotropic and anisotropic networks. The comparisons with some typical algorithms of node localization confirm the effectiveness and efficiency of our algorithm.

  13. Link and route availability for Inter-working multi-hop wireless networks

    CSIR Research Space (South Africa)

    Salami, O

    2009-09-01

    Full Text Available pairs in inter-working multi-hop wireless networks can be evaluated based on the availability and reliability of radio links that form the communication path linking the nodes. This paper presents an analytical study of the link and route availability...

  14. Analysis of route availability in inter-working multi-hop wireless networks

    CSIR Research Space (South Africa)

    Salami, O

    2009-07-01

    Full Text Available In order to link a source-destination node pair in inter-working multi-hop wireless networks, links or routes must first be available. It is only after establishing the availability of links and routes between nodes that factors which affect...

  15. Low Power Multi-Hop Networking Analysis in Intelligent Environments.

    Science.gov (United States)

    Etxaniz, Josu; Aranguren, Gerardo

    2017-05-19

    Intelligent systems are driven by the latest technological advances in many different areas such as sensing, embedded systems, wireless communications or context recognition. This paper focuses on some of those areas. Concretely, the paper deals with wireless communications issues in embedded systems. More precisely, the paper combines the multi-hop networking with Bluetooth technology and a quality of service (QoS) metric, the latency. Bluetooth is a radio license-free worldwide communication standard that makes low power multi-hop wireless networking available. It establishes piconets (point-to-point and point-to-multipoint links) and scatternets (multi-hop networks). As a result, many Bluetooth nodes can be interconnected to set up ambient intelligent networks. Then, this paper presents the results of the investigation on multi-hop latency with park and sniff Bluetooth low power modes conducted over the hardware test bench previously implemented. In addition, the empirical models to estimate the latency of multi-hop communications over Bluetooth Asynchronous Connectionless Links (ACL) in park and sniff mode are given. The designers of devices and networks for intelligent systems will benefit from the estimation of the latency in Bluetooth multi-hop communications that the models provide.

  16. Adaptive Demand-Driven Multicast Routing in Multi-Hop Wireless Ad Hoc Networks

    National Research Council Canada - National Science Library

    Jetcheva, Jorjeta G

    2004-01-01

    ...) nodes that wish to communicate. Each node in the ad hoc network acts as a router and forwards packets on behalf of other nodes, allowing nodes that are not within wireless range of each other to communicate over multi-hop paths...

  17. Multi-hop routing in wireless sensor networks an overview, taxonomy, and research challenges

    CERN Document Server

    Rani, Shalli

    2016-01-01

    This brief provides an overview of recent developments in multi-hop routing protocols for Wireless Sensor Networks (WSNs). It introduces the various classifications of routing protocols and lists the pros and cons of each category, going beyond the conceptual overview of routing classifications offered in other books. Recently many researchers have proposed numerous multi-hop routing protocols and thereby created a need for a book that provides its readers with an up-to-date road map of this research paradigm.   The authors present some of the most relevant results achieved by applying an algorithmic approach to the research on multi-hop routing protocols. The book covers measurements, experiences and lessons learned from the implementation of multi-hop communication prototypes. Furthermore, it describes future research challenges and as such serves as a useful guide for students and researchers alike.

  18. Multi-Hop Link Capacity of Multi-Route Multi-Hop MRC Diversity for a Virtual Cellular Network

    Science.gov (United States)

    Daou, Imane; Kudoh, Eisuke; Adachi, Fumiyuki

    In virtual cellular network (VCN), proposed for high-speed mobile communications, the signal transmitted from a mobile terminal is received by some wireless ports distributed in each virtual cell and relayed to the central port that acts as a gateway to the core network. In this paper, we apply the multi-route MHMRC diversity in order to decrease the transmit power and increase the multi-hop link capacity. The transmit power, the interference power and the link capacity are evaluated for DS-CDMA multi-hop VCN by computer simulation. The multi-route MHMRC diversity can be applied to not only DS-CDMA but also other access schemes (i. e. MC-CDMA, OFDM, etc.).

  19. To overhear or not to overhear: a dilemma between network coding gain and energy consumption in multi-hop wireless networks

    OpenAIRE

    Javan, Nastooh Taheri; Sabaei, Masoud; Dehghan, Mehdi

    2018-01-01

    Any properly designed network coding technique can result in increased throughput and reliability of multi-hop wireless networks by taking advantage of the broadcast nature of wireless medium. In many inter-flow network coding schemes nodes are encouraged to overhear neighbours traffic in order to improve coding opportunities at the transmitter nodes. A study of these schemes reveal that some of the overheard packets are not useful for coding operation and thus this forced overhearing increas...

  20. A Routing Strategy for Non-Cooperation Wireless Multi-Hop Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Dung T. Tran

    2012-01-01

    Full Text Available Choosing routes such that the network lifetime is maximized in a wireless network with limited energy resources is a major routing problem in wireless multi-hop ad hoc networks. In this paper, we study the problem where participants are rationally selfish and non-cooperative. By selfish we designate the users who are ready to tamper with their source-routing (senders could choose intermediate nodes in the routing paths or next hop selection strategies in order to increase the total number of packets transmitted, but do not try to harm or drop packets of the other nodes. The problem therefore amounts to a non-cooperative game. In the works [2,6,19,23], the authors show that the game admits Nash equilibria [1]. Along this line, we first show that if the cost function is linear, this game has pure-strategy equilibrium flow even though participants have different demands. However, finding a Nash equilibrium for a normal game is computationally hard [9]. In this work, inspired by mixed-strategy equilibrium, we propose a simple local routing algorithm called MIxed Path Routing protocol (MiPR. Using analysis and simulations, we show that MiPR drives the system to an equilibrium state where selfish participants do not have incentive to deviate. Moreover, MiPR significantly improves the network lifetime as compared to original routing protocols.

  1. A Multi-Hop Energy Neutral Clustering Algorithm for Maximizing Network Information Gathering in Energy Harvesting Wireless Sensor Networks.

    Science.gov (United States)

    Yang, Liu; Lu, Yinzhi; Zhong, Yuanchang; Wu, Xuegang; Yang, Simon X

    2015-12-26

    Energy resource limitation is a severe problem in traditional wireless sensor networks (WSNs) because it restricts the lifetime of network. Recently, the emergence of energy harvesting techniques has brought with them the expectation to overcome this problem. In particular, it is possible for a sensor node with energy harvesting abilities to work perpetually in an Energy Neutral state. In this paper, a Multi-hop Energy Neutral Clustering (MENC) algorithm is proposed to construct the optimal multi-hop clustering architecture in energy harvesting WSNs, with the goal of achieving perpetual network operation. All cluster heads (CHs) in the network act as routers to transmit data to base station (BS) cooperatively by a multi-hop communication method. In addition, by analyzing the energy consumption of intra- and inter-cluster data transmission, we give the energy neutrality constraints. Under these constraints, every sensor node can work in an energy neutral state, which in turn provides perpetual network operation. Furthermore, the minimum network data transmission cycle is mathematically derived using convex optimization techniques while the network information gathering is maximal. Simulation results show that our protocol can achieve perpetual network operation, so that the consistent data delivery is guaranteed. In addition, substantial improvements on the performance of network throughput are also achieved as compared to the famous traditional clustering protocol LEACH and recent energy harvesting aware clustering protocols.

  2. A Multi-Hop Energy Neutral Clustering Algorithm for Maximizing Network Information Gathering in Energy Harvesting Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Liu Yang

    2015-12-01

    Full Text Available Energy resource limitation is a severe problem in traditional wireless sensor networks (WSNs because it restricts the lifetime of network. Recently, the emergence of energy harvesting techniques has brought with them the expectation to overcome this problem. In particular, it is possible for a sensor node with energy harvesting abilities to work perpetually in an Energy Neutral state. In this paper, a Multi-hop Energy Neutral Clustering (MENC algorithm is proposed to construct the optimal multi-hop clustering architecture in energy harvesting WSNs, with the goal of achieving perpetual network operation. All cluster heads (CHs in the network act as routers to transmit data to base station (BS cooperatively by a multi-hop communication method. In addition, by analyzing the energy consumption of intra- and inter-cluster data transmission, we give the energy neutrality constraints. Under these constraints, every sensor node can work in an energy neutral state, which in turn provides perpetual network operation. Furthermore, the minimum network data transmission cycle is mathematically derived using convex optimization techniques while the network information gathering is maximal. Simulation results show that our protocol can achieve perpetual network operation, so that the consistent data delivery is guaranteed. In addition, substantial improvements on the performance of network throughput are also achieved as compared to the famous traditional clustering protocol LEACH and recent energy harvesting aware clustering protocols.

  3. IMHRP: Improved Multi-Hop Routing Protocol for Wireless Sensor Networks

    Science.gov (United States)

    Huang, Jianhua; Ruan, Danwei; Hong, Yadong; Zhao, Ziming; Zheng, Hong

    2017-10-01

    Wireless sensor network (WSN) is a self-organizing system formed by a large number of low-cost sensor nodes through wireless communication. Sensor nodes collect environmental information and transmit it to the base station (BS). Sensor nodes usually have very limited battery energy. The batteries cannot be charged or replaced. Therefore, it is necessary to design an energy efficient routing protocol to maximize the network lifetime. This paper presents an improved multi-hop routing protocol (IMHRP) for homogeneous networks. In the IMHRP protocol, based on the distances to the BS, the CH nodes are divided into internal CH nodes and external CH nodes. The set-up phase of the protocol is based on the LEACH protocol and the minimum distance between CH nodes are limited to a special constant distance, so a more uniform distribution of CH nodes is achieved. In the steady-state phase, the routes of different CH nodes are created on the basis of the distances between the CH nodes. The energy efficiency of communication can be maximized. The simulation results show that the proposed algorithm can more effectively reduce the energy consumption of each round and prolong the network lifetime compared with LEACH protocol and MHT protocol.

  4. Power and delay optimisation in multi-hop wireless networks

    KAUST Repository

    Xia, Li

    2014-02-05

    In this paper, we study the optimisation problem of transmission power and delay in a multi-hop wireless network consisting of multiple nodes. The goal is to determine the optimal policy of transmission rates at various buffer and channel states in order to minimise the power consumption and the queueing delay of the whole network. With the assumptions of interference-free links and independently and identically distributed (i.i.d.) channel states, we formulate this problem using a semi-open Jackson network model for data transmission and a Markov model for channel states transition. We derive a difference equation of the system performance under any two different policies. The necessary and sufficient condition of optimal policy is obtained. We also prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate and the optimal transmission rate can be either maximal or minimal. That is, the ‘bang-bang’ control is an optimal control. This optimality structure greatly reduces the problem complexity. Furthermore, we develop an iterative algorithm to find the optimal solution. Finally, we conduct the simulation experiments to demonstrate the effectiveness of our approach. We hope our work can shed some insights on solving this complicated optimisation problem.

  5. System optimization for peer-to-peer multi hop video broadcasting in wireless ad hoc networks

    NARCIS (Netherlands)

    Dedeoglu, V.; Atici, C.; Salman, F.S.; Sunay, M.O.

    2008-01-01

    We consider peer-to-peer video broadcasting using cooperation among peers in an ad hoc wireless network. As opposed to the traditional single hop broadcasting, multiple hops cause an increase in broadcast video quality while creating interference and increasing transmission delay. We develop

  6. Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks

    OpenAIRE

    Madani Sajjad; Nazir Babar; Hasbullah Halabi

    2011-01-01

    Abstract We present a sleep/wake schedule protocol for minimizing end-to-end delay for event driven multi-hop wireless sensor networks. In contrast to generic sleep/wake scheduling schemes, our proposed algorithm performs scheduling that is dependent on traffic loads. Nodes adapt their sleep/wake schedule based on traffic loads in response to three important factors, (a) the distance of the node from the sink node, (b) the importance of the node's location from connectivity's perspective, and...

  7. Distributed Detection with Collisions in a Random, Single-Hop Wireless Sensor Network

    Science.gov (United States)

    2013-05-26

    public release; distribution is unlimited. Distributed detection with collisions in a random, single-hop wireless sensor network The views, opinions...1274 2 ABSTRACT Distributed detection with collisions in a random, single-hop wireless sensor network Report Title We consider the problem of... WIRELESS SENSOR NETWORK Gene T. Whipps?† Emre Ertin† Randolph L. Moses† ?U.S. Army Research Laboratory, Adelphi, MD 20783 †The Ohio State University

  8. A Hybrid DV-Hop Algorithm Using RSSI for Localization in Large-Scale Wireless Sensor Networks.

    Science.gov (United States)

    Cheikhrouhou, Omar; M Bhatti, Ghulam; Alroobaea, Roobaea

    2018-05-08

    With the increasing realization of the Internet-of-Things (IoT) and rapid proliferation of wireless sensor networks (WSN), estimating the location of wireless sensor nodes is emerging as an important issue. Traditional ranging based localization algorithms use triangulation for estimating the physical location of only those wireless nodes that are within one-hop distance from the anchor nodes. Multi-hop localization algorithms, on the other hand, aim at localizing the wireless nodes that can physically be residing at multiple hops away from anchor nodes. These latter algorithms have attracted a growing interest from research community due to the smaller number of required anchor nodes. One such algorithm, known as DV-Hop (Distance Vector Hop), has gained popularity due to its simplicity and lower cost. However, DV-Hop suffers from reduced accuracy due to the fact that it exploits only the network topology (i.e., number of hops to anchors) rather than the distances between pairs of nodes. In this paper, we propose an enhanced DV-Hop localization algorithm that also uses the RSSI values associated with links between one-hop neighbors. Moreover, we exploit already localized nodes by promoting them to become additional anchor nodes. Our simulations have shown that the proposed algorithm significantly outperforms the original DV-Hop localization algorithm and two of its recently published variants, namely RSSI Auxiliary Ranging and the Selective 3-Anchor DV-hop algorithm. More precisely, in some scenarios, the proposed algorithm improves the localization accuracy by almost 95%, 90% and 70% as compared to the basic DV-Hop, Selective 3-Anchor, and RSSI DV-Hop algorithms, respectively.

  9. An implementation of traffic light system using multi-hop Ad hoc networks

    KAUST Repository

    Ansari, Imran Shafique

    2009-08-01

    In ad hoc networks nodes cooperate with each other to form a temporary network without the aid of any centralized administration. No wired base station or infrastructure is supported, and each host communicates via radio packets. Each host must act as a router, since routes are mostly multi-hop, due to the limited power transmission set by government agencies, (e.g. the Federal Communication Commission (FCC), which is 1 Watt in Industrial Scientific and Medical (ISM) band. The natures of wireless mobile ad hoc networks depend on batteries or other fatiguing means for their energy. A limited energy capacity may be the most significant performance constraint. Therefore, radio resource and power management is an important issue of any wireless network. In this paper, a design for traffic light system employing ad hoc networks is proposed. The traffic light system runs automatically based on signals sent through a multi-hop ad hoc network of \\'n\\' number of nodes utilizing the Token Ring protocol, which is efficient for this application from the energy prospective. The experiment consists of a graphical user interface that simulates the traffic lights and laptops (which have wireless network adapters) are used to run the graphical user interface and are responsible for setting up the ad hoc network between them. The traffic light system has been implemented utilizing A Mesh Driver (which allows for more than one wireless device to be connected simultaneously) and Java-based client-server programs. © 2009 IEEE.

  10. Performance Analysis of Millimeter-Wave Multi-hop Machine-to-Machine Networks Based on Hop Distance Statistics

    Directory of Open Access Journals (Sweden)

    Haejoon Jung

    2018-01-01

    Full Text Available As an intrinsic part of the Internet of Things (IoT ecosystem, machine-to-machine (M2M communications are expected to provide ubiquitous connectivity between machines. Millimeter-wave (mmWave communication is another promising technology for the future communication systems to alleviate the pressure of scarce spectrum resources. For this reason, in this paper, we consider multi-hop M2M communications, where a machine-type communication (MTC device with the limited transmit power relays to help other devices using mmWave. To be specific, we focus on hop distance statistics and their impacts on system performances in multi-hop wireless networks (MWNs with directional antenna arrays in mmWave for M2M communications. Different from microwave systems, in mmWave communications, wireless channel suffers from blockage by obstacles that heavily attenuate line-of-sight signals, which may result in limited per-hop progress in MWNs. We consider two routing strategies aiming at different types of applications and derive the probability distributions of their hop distances. Moreover, we provide their baseline statistics assuming the blockage-free scenario to quantify the impact of blockages. Based on the hop distance analysis, we propose a method to estimate the end-to-end performances (e.g., outage probability, hop count, and transmit energy of the mmWave MWNs, which provides important insights into mmWave MWN design without time-consuming and repetitive end-to-end simulation.

  11. Performance Analysis of Millimeter-Wave Multi-hop Machine-to-Machine Networks Based on Hop Distance Statistics.

    Science.gov (United States)

    Jung, Haejoon; Lee, In-Ho

    2018-01-12

    As an intrinsic part of the Internet of Things (IoT) ecosystem, machine-to-machine (M2M) communications are expected to provide ubiquitous connectivity between machines. Millimeter-wave (mmWave) communication is another promising technology for the future communication systems to alleviate the pressure of scarce spectrum resources. For this reason, in this paper, we consider multi-hop M2M communications, where a machine-type communication (MTC) device with the limited transmit power relays to help other devices using mmWave. To be specific, we focus on hop distance statistics and their impacts on system performances in multi-hop wireless networks (MWNs) with directional antenna arrays in mmWave for M2M communications. Different from microwave systems, in mmWave communications, wireless channel suffers from blockage by obstacles that heavily attenuate line-of-sight signals, which may result in limited per-hop progress in MWNs. We consider two routing strategies aiming at different types of applications and derive the probability distributions of their hop distances. Moreover, we provide their baseline statistics assuming the blockage-free scenario to quantify the impact of blockages. Based on the hop distance analysis, we propose a method to estimate the end-to-end performances (e.g., outage probability, hop count, and transmit energy) of the mmWave MWNs, which provides important insights into mmWave MWN design without time-consuming and repetitive end-to-end simulation.

  12. Time and Energy Efficient Relay Transmission for Multi-Hop Wireless Sensor Networks.

    Science.gov (United States)

    Kim, Jin-Woo; Barrado, José Ramón Ramos; Jeon, Dong-Keun

    2016-06-27

    The IEEE 802.15.4 standard is widely recognized as one of the most successful enabling technologies for short range low rate wireless communications and it is used in IoT applications. It covers all the details related to the MAC and PHY layers of the IoT protocol stack. Due to the nature of IoT, the wireless sensor networks are autonomously self-organized networks without infrastructure support. One of the issues in IoT is the network scalability. To address this issue, it is necessary to support the multi-hop topology. The IEEE 802.15.4 network can support a star, peer-to-peer, or cluster-tree topology. One of the IEEE 802.15.4 topologies suited for the high predictability of performance guarantees and energy efficient behavior is a cluster-tree topology where sensor nodes can switch off their transceivers and go into a sleep state to save energy. However, the IEEE 802.15.4 cluster-tree topology may not be able to provide sufficient bandwidth for the increased traffic load and the additional information may not be delivered successfully. The common drawback of the existing approaches is that they do not address the poor bandwidth utilization problem in IEEE 802.15.4 cluster-tree networks, so it is difficult to increase the network performance. Therefore, to solve this problem in this paper we study a relay transmission protocol based on the standard protocol in the IEEE 802.15.4 MAC. In the proposed scheme, the coordinators can relay data frames to their parent devices or their children devices without contention and can provide bandwidth for the increased traffic load or the number of devices. We also evaluate the performance of the proposed scheme through simulation. The simulation results demonstrate that the proposed scheme can improve the reliability, the end-to-end delay, and the energy consumption.

  13. Distributed wireless quantum communication networks with partially entangled pairs

    International Nuclear Information System (INIS)

    Yu Xu-Tao; Zhang Zai-Chen; Xu Jin

    2014-01-01

    Wireless quantum communication networks transfer quantum state by teleportation. Existing research focuses on maximal entangled pairs. In this paper, we analyse the distributed wireless quantum communication networks with partially entangled pairs. A quantum routing scheme with multi-hop teleportation is proposed. With the proposed scheme, is not necessary for the quantum path to be consistent with the classical path. The quantum path and its associated classical path are established in a distributed way. Direct multi-hop teleportation is conducted on the selected path to transfer a quantum state from the source to the destination. Based on the feature of multi-hop teleportation using partially entangled pairs, if the node number of the quantum path is even, the destination node will add another teleportation at itself. We simulated the performance of distributed wireless quantum communication networks with a partially entangled state. The probability of transferring the quantum state successfully is statistically analyzed. Our work shows that multi-hop teleportation on distributed wireless quantum networks with partially entangled pairs is feasible. (general)

  14. Time and Energy Efficient Relay Transmission for Multi-Hop Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jin-Woo Kim

    2016-06-01

    Full Text Available The IEEE 802.15.4 standard is widely recognized as one of the most successful enabling technologies for short range low rate wireless communications and it is used in IoT applications. It covers all the details related to the MAC and PHY layers of the IoT protocol stack. Due to the nature of IoT, the wireless sensor networks are autonomously self-organized networks without infrastructure support. One of the issues in IoT is the network scalability. To address this issue, it is necessary to support the multi-hop topology. The IEEE 802.15.4 network can support a star, peer-to-peer, or cluster-tree topology. One of the IEEE 802.15.4 topologies suited for the high predictability of performance guarantees and energy efficient behavior is a cluster-tree topology where sensor nodes can switch off their transceivers and go into a sleep state to save energy. However, the IEEE 802.15.4 cluster-tree topology may not be able to provide sufficient bandwidth for the increased traffic load and the additional information may not be delivered successfully. The common drawback of the existing approaches is that they do not address the poor bandwidth utilization problem in IEEE 802.15.4 cluster-tree networks, so it is difficult to increase the network performance. Therefore, to solve this problem in this paper we study a relay transmission protocol based on the standard protocol in the IEEE 802.15.4 MAC. In the proposed scheme, the coordinators can relay data frames to their parent devices or their children devices without contention and can provide bandwidth for the increased traffic load or the number of devices. We also evaluate the performance of the proposed scheme through simulation. The simulation results demonstrate that the proposed scheme can improve the reliability, the end-to-end delay, and the energy consumption.

  15. Energy-aware Wireless Multi-hop Networks

    NARCIS (Netherlands)

    Vazifehdan, J.

    2011-01-01

    Wireless networks have provided us a variety of services which facilitate communication between people beyond the physical boundaries. Mobile telephony, mobile Internet and high-deffnition video calls are examples of services supported by modern networks nowadays. Beyond this, enhancements in

  16. An empirical evaluation of bufferbloat in IEEE 802.11n wireless networks

    KAUST Repository

    Showail, Ahmad; Jamshaid, Kamran; Shihada, Basem

    2014-01-01

    In this paper, we analyze the impact of large, persistently-full buffers (`bufferbloat') on various network dynamics in IEEE 802.11n wireless networks. Bufferbloat has mostly been studied in the context of wired networks. We study the impact of bufferbloat on a variety of wireless network topologies, including wireless LAN (WLAN) and multi-hop wireless networks. Our results show that a single FTP transfer between two Linux wireless hosts can saturate the buffers in the network stack, leading to RTT delays exceeding 4.5 s in multi-hop configurations. We show that well-designed Aggregate MAC Protocol Data Unit (A-MPDU) MAC-layer frame aggregation can reduce RTT delays while simultaneously increasing network throughput. However, additional measures may still be required to meet the constraints of real-time flows (such as VoIP). Our experiments show that large buffers can deteriorate the fairness in rate allocation in parking lot based multi-hop networks.

  17. An empirical evaluation of bufferbloat in IEEE 802.11n wireless networks

    KAUST Repository

    Showail, Ahmad

    2014-04-06

    In this paper, we analyze the impact of large, persistently-full buffers (`bufferbloat\\') on various network dynamics in IEEE 802.11n wireless networks. Bufferbloat has mostly been studied in the context of wired networks. We study the impact of bufferbloat on a variety of wireless network topologies, including wireless LAN (WLAN) and multi-hop wireless networks. Our results show that a single FTP transfer between two Linux wireless hosts can saturate the buffers in the network stack, leading to RTT delays exceeding 4.5 s in multi-hop configurations. We show that well-designed Aggregate MAC Protocol Data Unit (A-MPDU) MAC-layer frame aggregation can reduce RTT delays while simultaneously increasing network throughput. However, additional measures may still be required to meet the constraints of real-time flows (such as VoIP). Our experiments show that large buffers can deteriorate the fairness in rate allocation in parking lot based multi-hop networks.

  18. High throughput route selection in multi-rate wireless mesh networks

    Institute of Scientific and Technical Information of China (English)

    WEI Yi-fei; GUO Xiang-li; SONG Mei; SONG Jun-de

    2008-01-01

    Most existing Ad-hoc routing protocols use the shortest path algorithm with a hop count metric to select paths. It is appropriate in single-rate wireless networks, but has a tendency to select paths containing long-distance links that have low data rates and reduced reliability in multi-rate networks. This article introduces a high throughput routing algorithm utilizing the multi-rate capability and some mesh characteristics in wireless fidelity (WiFi) mesh networks. It uses the medium access control (MAC) transmission time as the routing metric, which is estimated by the information passed up from the physical layer. When the proposed algorithm is adopted, the Ad-hoc on-demand distance vector (AODV) routing can be improved as high throughput AODV (HT-AODV). Simulation results show that HT-AODV is capable of establishing a route that has high data-rate, short end-to-end delay and great network throughput.

  19. A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks

    KAUST Repository

    Xia, Li; Shihada, Basem

    2014-01-01

    This paper studies the joint optimization problem of energy and delay in a multi-hop wireless network. The optimization variables are the transmission rates, which are adjustable according to the packet queueing length in the buffer. The optimization goal is to minimize the energy consumption of energy-critical nodes and the packet transmission delay throughout the network. In this paper, we aim at understanding the well-known decentralized algorithms which are threshold based from a different research angle. By using a simplified network model, we show that we can adopt the semi-open Jackson network model and study this optimization problem in closed form. This simplified network model further allows us to establish some significant optimality properties. We prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate. We also prove that the threshold-type policy is optimal, i.e., when the number of packets in the buffer is larger than a threshold, transmit with the maximal rate (power); otherwise, no transmission. With these optimality properties, we develop a heuristic algorithm to iteratively find the optimal threshold. Finally, we conduct some simulation experiments to demonstrate the main idea of this paper.

  20. A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks

    KAUST Repository

    Xia, Li

    2014-11-20

    This paper studies the joint optimization problem of energy and delay in a multi-hop wireless network. The optimization variables are the transmission rates, which are adjustable according to the packet queueing length in the buffer. The optimization goal is to minimize the energy consumption of energy-critical nodes and the packet transmission delay throughout the network. In this paper, we aim at understanding the well-known decentralized algorithms which are threshold based from a different research angle. By using a simplified network model, we show that we can adopt the semi-open Jackson network model and study this optimization problem in closed form. This simplified network model further allows us to establish some significant optimality properties. We prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate. We also prove that the threshold-type policy is optimal, i.e., when the number of packets in the buffer is larger than a threshold, transmit with the maximal rate (power); otherwise, no transmission. With these optimality properties, we develop a heuristic algorithm to iteratively find the optimal threshold. Finally, we conduct some simulation experiments to demonstrate the main idea of this paper.

  1. Cross-Layer Scheme to Control Contention Window for Per-Flow in Asymmetric Multi-Hop Networks

    Science.gov (United States)

    Giang, Pham Thanh; Nakagawa, Kenji

    The IEEE 802.11 MAC standard for wireless ad hoc networks adopts Binary Exponential Back-off (BEB) mechanism to resolve bandwidth contention between stations. BEB mechanism controls the bandwidth allocation for each station by choosing a back-off value from one to CW according to the uniform random distribution, where CW is the contention window size. However, in asymmetric multi-hop networks, some stations are disadvantaged in opportunity of access to the shared channel and may suffer severe throughput degradation when the traffic load is large. Then, the network performance is degraded in terms of throughput and fairness. In this paper, we propose a new cross-layer scheme aiming to solve the per-flow unfairness problem and achieve good throughput performance in IEEE 802.11 multi-hop ad hoc networks. Our cross-layer scheme collects useful information from the physical, MAC and link layers of own station. This information is used to determine the optimal Contention Window (CW) size for per-station fairness. We also use this information to adjust CW size for each flow in the station in order to achieve per-flow fairness. Performance of our cross-layer scheme is examined on various asymmetric multi-hop network topologies by using Network Simulator (NS-2).

  2. A Large-Scale Multi-Hop Localization Algorithm Based on Regularized Extreme Learning for Wireless Networks.

    Science.gov (United States)

    Zheng, Wei; Yan, Xiaoyong; Zhao, Wei; Qian, Chengshan

    2017-12-20

    A novel large-scale multi-hop localization algorithm based on regularized extreme learning is proposed in this paper. The large-scale multi-hop localization problem is formulated as a learning problem. Unlike other similar localization algorithms, the proposed algorithm overcomes the shortcoming of the traditional algorithms which are only applicable to an isotropic network, therefore has a strong adaptability to the complex deployment environment. The proposed algorithm is composed of three stages: data acquisition, modeling and location estimation. In data acquisition stage, the training information between nodes of the given network is collected. In modeling stage, the model among the hop-counts and the physical distances between nodes is constructed using regularized extreme learning. In location estimation stage, each node finds its specific location in a distributed manner. Theoretical analysis and several experiments show that the proposed algorithm can adapt to the different topological environments with low computational cost. Furthermore, high accuracy can be achieved by this method without setting complex parameters.

  3. Towards Effective Intra-flow Network Coding in Software Defined Wireless Mesh Networks

    OpenAIRE

    Donghai Zhu; Xinyu Yang Yang; Peng Zhao; Wei Yu

    2016-01-01

    Wireless Mesh Networks (WMNs) have potential to provide convenient broadband wireless Internet access to mobile users.With the support of Software-Defined Networking (SDN) paradigm that separates control plane and data plane, WMNs can be easily deployed and managed. In addition, by exploiting the broadcast nature of the wireless medium and the spatial diversity of multi-hop wireless networks, intra-flow network coding has shown a greater benefit in comparison with traditional routing paradigm...

  4. Neighbor discovery in multi-hop wireless networks: evaluation and dimensioning with interferences considerations

    Directory of Open Access Journals (Sweden)

    Elyes Ben Hamida

    2008-04-01

    Full Text Available In this paper, we study the impact of collisions and interferences on a neighbor discovery process in the context of multi-hop wireless networks. We consider three models in which interferences and collisions are handled in very different ways. From an ideal channel where simultaneous transmissions do not interfere, we derive an alternate channel where simultaneous transmissions are considered two-by-two under the form of collisions, to finally reach a more realistic channel where simultaneous transmissions are handled under the form of shot-noise interferences. In these models, we analytically compute the link probability success between two neighbors as well as the expected number of nodes that correctly receive a Hello packet. Using this analysis, we show that if the neighbor discovery process is asymptotically equivalent in the three models, it offers very different behaviors locally in time. In particular, the scalability of the process is not the same depending on the way interferences are handled. Finally, we apply our results to the dimensioning of a Hello protocol parameters. We propose a method to adapt the protocol parameters to meet application constraints on the neighbor discovery process and to minimize the protocol energy consumption.

  5. An Adaptive Data Gathering Scheme for Multi-Hop Wireless Sensor Networks Based on Compressed Sensing and Network Coding.

    Science.gov (United States)

    Yin, Jun; Yang, Yuwang; Wang, Lei

    2016-04-01

    Joint design of compressed sensing (CS) and network coding (NC) has been demonstrated to provide a new data gathering paradigm for multi-hop wireless sensor networks (WSNs). By exploiting the correlation of the network sensed data, a variety of data gathering schemes based on NC and CS (Compressed Data Gathering--CDG) have been proposed. However, these schemes assume that the sparsity of the network sensed data is constant and the value of the sparsity is known before starting each data gathering epoch, thus they ignore the variation of the data observed by the WSNs which are deployed in practical circumstances. In this paper, we present a complete design of the feedback CDG scheme where the sink node adaptively queries those interested nodes to acquire an appropriate number of measurements. The adaptive measurement-formation procedure and its termination rules are proposed and analyzed in detail. Moreover, in order to minimize the number of overall transmissions in the formation procedure of each measurement, we have developed a NP-complete model (Maximum Leaf Nodes Minimum Steiner Nodes--MLMS) and realized a scalable greedy algorithm to solve the problem. Experimental results show that the proposed measurement-formation method outperforms previous schemes, and experiments on both datasets from ocean temperature and practical network deployment also prove the effectiveness of our proposed feedback CDG scheme.

  6. Distributed medium access control in wireless networks

    CERN Document Server

    Wang, Ping

    2013-01-01

    This brief investigates distributed medium access control (MAC) with QoS provisioning for both single- and multi-hop wireless networks including wireless local area networks (WLANs), wireless ad hoc networks, and wireless mesh networks. For WLANs, an efficient MAC scheme and a call admission control algorithm are presented to provide guaranteed QoS for voice traffic and, at the same time, increase the voice capacity significantly compared with the current WLAN standard. In addition, a novel token-based scheduling scheme is proposed to provide great flexibility and facility to the network servi

  7. On using multiple routing metrics with destination sequenced distance vector protocol for MultiHop wireless ad hoc networks

    Science.gov (United States)

    Mehic, M.; Fazio, P.; Voznak, M.; Partila, P.; Komosny, D.; Tovarek, J.; Chmelikova, Z.

    2016-05-01

    A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol. To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

  8. Towards Effective Intra-flow Network Coding in Software Defined Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Donghai Zhu

    2016-01-01

    Full Text Available Wireless Mesh Networks (WMNs have potential to provide convenient broadband wireless Internet access to mobile users.With the support of Software-Defined Networking (SDN paradigm that separates control plane and data plane, WMNs can be easily deployed and managed. In addition, by exploiting the broadcast nature of the wireless medium and the spatial diversity of multi-hop wireless networks, intra-flow network coding has shown a greater benefit in comparison with traditional routing paradigms in data transmission for WMNs. In this paper, we develop a novel OpenCoding protocol, which combines the SDN technique with intra-flow network coding for WMNs. Our developed protocol can simplify the deployment and management of the network and improve network performance. In OpenCoding, a controller that works on the control plane makes routing decisions for mesh routers and the hop-by-hop forwarding function is replaced by network coding functions in data plane. We analyze the overhead of OpenCoding. Through a simulation study, we show the effectiveness of the OpenCoding protocol in comparison with existing schemes. Our data shows that OpenCoding outperforms both traditional routing and intra-flow network coding schemes.

  9. Distributed Cross-layer Monitoring in Wireless Mesh Networks

    OpenAIRE

    Panmin, Ye; Yong,

    2009-01-01

    Wireless mesh networks has rapid development over the last few years. However, due to properties such as distributed infrastructure and interference, which strongly affect the performance of wireless mesh networks, developing technology has to face the challenge of architecture and protocol design issues. Traditional layered protocols do not function efficiently in multi-hop wireless environments. To get deeper understanding on interaction of the layered protocols and optimize the performance...

  10. Node Load Balance Multi-flow Opportunistic Routing in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Wang Tao

    2014-04-01

    Full Text Available Opportunistic routing (OR has been proposed to improve the performance of wireless networks by exploiting the multi-user diversity and broadcast nature of the wireless medium. It involves multiple candidate forwarders to relay packets every hop. The existing OR doesn’t take account of the traffic load and load balance, therefore some nodes may be overloaded while the others may not, leading to network performance decline. In this paper, we focus on opportunities routing selection with node load balance which is described as a convex optimization problem. To solve the problem, by combining primal-dual and sub-gradient methods, a fully distributed Node load balance Multi-flow Opportunistic Routing algorithm (NMOR is proposed. With node load balance constraint, NMOR allocates the flow rate iteratively and the rate allocation decides the candidate forwarder selection of opportunities routing. The simulation results show that NMOR algorithm improves 100 %, 62 % of the aggregative throughput than ETX and EAX, respectively.

  11. Sleep/wake scheduling scheme for minimizing end-to-end delay in multi-hop wireless sensor networks

    Directory of Open Access Journals (Sweden)

    Madani Sajjad

    2011-01-01

    Full Text Available Abstract We present a sleep/wake schedule protocol for minimizing end-to-end delay for event driven multi-hop wireless sensor networks. In contrast to generic sleep/wake scheduling schemes, our proposed algorithm performs scheduling that is dependent on traffic loads. Nodes adapt their sleep/wake schedule based on traffic loads in response to three important factors, (a the distance of the node from the sink node, (b the importance of the node's location from connectivity's perspective, and (c if the node is in the proximity where an event occurs. Using these heuristics, the proposed scheme reduces end-to-end delay and maximizes the throughput by minimizing the congestion at nodes having heavy traffic load. Simulations are carried out to evaluate the performance of the proposed protocol, by comparing its performance with S-MAC and Anycast protocols. Simulation results demonstrate that the proposed protocol has significantly reduced the end-to-end delay, as well as has improved the other QoS parameters, like average energy per packet, average delay, packet loss ratio, throughput, and coverage lifetime.

  12. Communication devices for network-hopping communications and methods of network-hopping communications

    Science.gov (United States)

    Buttles, John W

    2013-04-23

    Wireless communication devices include a software-defined radio coupled to processing circuitry. The system controller is configured to execute computer programming code. Storage media is coupled to the system controller and includes computer programming code configured to cause the system controller to configure and reconfigure the software-defined radio to operate on each of a plurality of communication networks according to a selected sequence. Methods for communicating with a wireless device and methods of wireless network-hopping are also disclosed.

  13. Wireless three-hop networks with stealing II : exact solutions through boundary value problems

    NARCIS (Netherlands)

    Guillemin, F.; Knessl, C.; Leeuwaarden, van J.S.H.

    2013-01-01

    We study the stationary distribution of a random walk in the quarter plane arising in the study of three-hop wireless networks with stealing. Our motivation is to find exact tail asymptotics (beyond logarithmic estimates) for the marginal distributions, which requires an exact solution for the

  14. An implementation of traffic light system using multi-hop Ad hoc networks

    KAUST Repository

    Ansari, Imran Shafique

    2009-01-01

    as a router, since routes are mostly multi-hop, due to the limited power transmission set by government agencies, (e.g. the Federal Communication Commission (FCC), which is 1 Watt in Industrial Scientific and Medical (ISM) band. The natures of wireless

  15. Performance and energy efficiency in wireless self-organized networks

    Energy Technology Data Exchange (ETDEWEB)

    Gao, C.

    2009-07-01

    Self-organized packet radio networks (ad-hoc networks) and wireless sensor networks have got massive attention recently. One of critical problems in such networks is the energy efficiency, because wireless nodes are usually powered by battery. Energy efficiency design can dramatically increase the survivability and stability of wireless ad-hoc/sensor networks. In this thesis the energy efficiency has been considered at different protocol layers for wireless ad-hoc/sensor networks. The energy consumption of wireless nodes is inspected at the physical layer and MAC layer. At the network layer, some current routing protocols are compared and special attention has been paid to reactive routing protocols. A minimum hop analysis is given and according to the analysis result, a modification of AODV routing is proposed. A variation of transmit power can be also applied to clustering algorithm, which is believed to be able to control the scalability of network. Clustering a network can also improve the energy efficiency. We offer a clustering scheme based on the link state measurement and variation of transmit power of intra-cluster and inter-cluster transmission. Simulation shows that it can achieve both targets. In association with the clustering algorithm, a global synchronization scheme is proposed to increase the efficiency of clustering algorithm. The research attention has been also paid to self-organization for multi-hop cellular networks. A 2-hop 2-slot uplink proposal to infrastructure-based cellular networks. The proposed solution can significantly increase the throughput of uplink communication and reduce the energy consumption of wireless terminals. (orig.)

  16. Monitoring Churn in Wireless Networks

    Science.gov (United States)

    Holzer, Stephan; Pignolet, Yvonne Anne; Smula, Jasmin; Wattenhofer, Roger

    Wireless networks often experience a significant amount of churn, the arrival and departure of nodes. In this paper we propose a distributed algorithm for single-hop networks that detects churn and is resilient to a worst-case adversary. The nodes of the network are notified about changes quickly, in asymptotically optimal time up to an additive logarithmic overhead. We establish a trade-off between saving energy and minimizing the delay until notification for single- and multi-channel networks.

  17. Wireless Sensor Network Optimization: Multi-Objective Paradigm.

    Science.gov (United States)

    Iqbal, Muhammad; Naeem, Muhammad; Anpalagan, Alagan; Ahmed, Ashfaq; Azam, Muhammad

    2015-07-20

    Optimization problems relating to wireless sensor network planning, design, deployment and operation often give rise to multi-objective optimization formulations where multiple desirable objectives compete with each other and the decision maker has to select one of the tradeoff solutions. These multiple objectives may or may not conflict with each other. Keeping in view the nature of the application, the sensing scenario and input/output of the problem, the type of optimization problem changes. To address different nature of optimization problems relating to wireless sensor network design, deployment, operation, planing and placement, there exist a plethora of optimization solution types. We review and analyze different desirable objectives to show whether they conflict with each other, support each other or they are design dependent. We also present a generic multi-objective optimization problem relating to wireless sensor network which consists of input variables, required output, objectives and constraints. A list of constraints is also presented to give an overview of different constraints which are considered while formulating the optimization problems in wireless sensor networks. Keeping in view the multi facet coverage of this article relating to multi-objective optimization, this will open up new avenues of research in the area of multi-objective optimization relating to wireless sensor networks.

  18. Wireless Sensor Network Optimization: Multi-Objective Paradigm

    Science.gov (United States)

    Iqbal, Muhammad; Naeem, Muhammad; Anpalagan, Alagan; Ahmed, Ashfaq; Azam, Muhammad

    2015-01-01

    Optimization problems relating to wireless sensor network planning, design, deployment and operation often give rise to multi-objective optimization formulations where multiple desirable objectives compete with each other and the decision maker has to select one of the tradeoff solutions. These multiple objectives may or may not conflict with each other. Keeping in view the nature of the application, the sensing scenario and input/output of the problem, the type of optimization problem changes. To address different nature of optimization problems relating to wireless sensor network design, deployment, operation, planing and placement, there exist a plethora of optimization solution types. We review and analyze different desirable objectives to show whether they conflict with each other, support each other or they are design dependent. We also present a generic multi-objective optimization problem relating to wireless sensor network which consists of input variables, required output, objectives and constraints. A list of constraints is also presented to give an overview of different constraints which are considered while formulating the optimization problems in wireless sensor networks. Keeping in view the multi facet coverage of this article relating to multi-objective optimization, this will open up new avenues of research in the area of multi-objective optimization relating to wireless sensor networks. PMID:26205271

  19. Performance Analysis of RF-FSO Multi-Hop Networks

    KAUST Repository

    Makki, Behrooz

    2017-05-12

    We study the performance of multi-hop networks composed of millimeter wave (MMW)-based radio frequency (RF) and free-space optical (FSO) links. The results are obtained in the cases with and without hybrid automatic repeat request (HARQ). Taking the MMW characteristics of the RF links into account, we derive closed-form expressions for the network outage probability. We also evaluate the effect of various parameters such as power amplifiers efficiency, number of antennas as well as different coherence times of the RF and the FSO links on the system performance. Finally, we present mappings between the performance of RF- FSO multi-hop networks and the ones using only the RF- or the FSO-based communication, in the sense that with appropriate parameter settings the same outage probability is achieved in these setups. The results show the efficiency of the RF-FSO setups in different conditions. Moreover, the HARQ can effectively improve the outage probability/energy efficiency, and compensate the effect of hardware impairments in RF-FSO networks. For common parameter settings of the RF-FSO dual- hop networks, outage probability 10^{-4} and code rate 3 nats-per-channel-use, the implementation of HARQ with a maximum of 2 and 3 retransmissions reduces the required power, compared to the cases with no HARQ, by 13 and 17 dB, respectively.

  20. Highly Efficient Multi Channel Packet Forwarding with Round Robin Intermittent Periodic Transmit for Multihop Wireless Backhaul Networks

    Science.gov (United States)

    Furukawa, Hiroshi

    2017-01-01

    Round Robin based Intermittent Periodic Transmit (RR-IPT) has been proposed which achieves highly efficient multi-hop relays in multi-hop wireless backhaul networks (MWBN) where relay nodes are 2-dimensionally deployed. This paper newly investigates multi-channel packet scheduling and forwarding scheme for RR-IPT. Downlink traffic is forwarded by RR-IPT via one of the channels, while uplink traffic and part of downlink are accommodated in the other channel. By comparing IPT and carrier sense multiple access with collision avoidance (CSMA/CA) for uplink/downlink packet forwarding channel, IPT is more effective in reducing packet loss rate whereas CSMA/CA is better in terms of system throughput and packet delay improvement. PMID:29137164

  1. Study on a resource allocation scheme in multi-hop MIMO-OFDM systems over lognormal-rayleigh compound channels

    Directory of Open Access Journals (Sweden)

    LIU Jun

    2015-10-01

    Full Text Available For new generation wireless communication networks,this paper studies the optimization of the capacity and end-to-end throughput of the MIMO-OFDM based multi-hop relay systems.A water-filling power allocation method is proposed to improve the channel capacity and the throughput of the MIMO-OFDM system based multi-hop relay system in the Lognormal-Rayleigh shadowing compound channels.Simulations on the capacity and throughput show that the water-filling algorithm can improve the system throughput effectively in the MIMO-OFDM multi-hop relay system.

  2. Routing and Scheduling Algorithms in Resource-Limited Wireless Multi-Hop Networks

    National Research Council Canada - National Science Library

    Michail, Anastassios

    2001-01-01

    ...) to transmit their messages to the desired destinations. The distinguishing features of such all-wireless network architectures give rise to new trade-offs between traditional concerns in wireless communications...

  3. Efficient Evaluation of Wireless Real-Time Control Networks

    Directory of Open Access Journals (Sweden)

    Peter Horvath

    2015-02-01

    Full Text Available In this paper, we present a system simulation framework for the design and performance evaluation of complex wireless cyber-physical systems. We describe the simulator architecture and the specific developments that are required to simulate cyber-physical systems relying on multi-channel, multihop mesh networks. We introduce realistic and efficient physical layer models and a system simulation methodology, which provides statistically significant performance evaluation results with low computational complexity. The capabilities of the proposed framework are illustrated in the example of WirelessHART, a centralized, real-time, multi-hop mesh network designed for industrial control and monitor applications.

  4. Performance Analysis of RF-FSO Multi-Hop Networks

    KAUST Repository

    Makki, Behrooz; Svensson, Tommy; Brandt-Pearce, Maite; Alouini, Mohamed-Slim

    2017-01-01

    We study the performance of multi-hop networks composed of millimeter wave (MMW)-based radio frequency (RF) and free-space optical (FSO) links. The results are obtained in the cases with and without hybrid automatic repeat request (HARQ). Taking

  5. Clustering algorithm in initialization of multi-hop wireless sensor networks

    NARCIS (Netherlands)

    Guo, Peng; Tao, Jiang; Zhang, Kui; Chen, Hsiao-Hwa

    2009-01-01

    In most application scenarios of wireless sensor networks (WSN), sensor nodes are usually deployed randomly and do not have any knowledge about the network environment or even their ID's at the initial stage of their operations. In this paper, we address the clustering problems with a newly deployed

  6. An Evolutionary Mobility Aware Multi-Objective Hybrid Routing Algorithm for Heterogeneous Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Kulkarni, Nandkumar P.; Prasad, Neeli R.; Prasad, Ramjee

    deliberation. To tackle these two problems, Mobile Wireless Sensor Networks (MWSNs) is a better choice. In MWSN, Sensor nodes move freely to a target area without the need for any special infrastructure. Due to mobility, the routing process in MWSN has become more complicated as connections in the network can...... such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. The authors study the influence of energy heterogeneity and mobility of sensor nodes on the performance of EMRP. The Performance of EMRP compared with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-Objective Routing...

  7. A Lifetime Optimization Algorithm Limited by Data Transmission Delay and Hops for Mobile Sink-Based Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yourong Chen

    2017-01-01

    Full Text Available To improve the lifetime of mobile sink-based wireless sensor networks and considering that data transmission delay and hops are limited in actual system, a lifetime optimization algorithm limited by data transmission delay and hops (LOA_DH for mobile sink-based wireless sensor networks is proposed. In LOA_DH, some constraints are analyzed, and an optimization model is proposed. Maximum capacity path routing algorithm is used to calculate the energy consumption of communication. Improved genetic algorithm which modifies individuals to meet all constraints is used to solve the optimization model. The optimal solution of sink node’s sojourn grid centers and sojourn times which maximizes network lifetime is obtained. Simulation results show that, in three node distribution scenes, LOA_DH can find the movement solution of sink node which covers all sensor nodes. Compared with MCP_RAND, MCP_GMRE, and EASR, the solution improves network lifetime and reduces average amount of node discarded data and average energy consumption of nodes.

  8. Network Coding on Heterogeneous Multi-Core Processors for Wireless Sensor Networks

    Science.gov (United States)

    Kim, Deokho; Park, Karam; Ro, Won W.

    2011-01-01

    While network coding is well known for its efficiency and usefulness in wireless sensor networks, the excessive costs associated with decoding computation and complexity still hinder its adoption into practical use. On the other hand, high-performance microprocessors with heterogeneous multi-cores would be used as processing nodes of the wireless sensor networks in the near future. To this end, this paper introduces an efficient network coding algorithm developed for the heterogenous multi-core processors. The proposed idea is fully tested on one of the currently available heterogeneous multi-core processors referred to as the Cell Broadband Engine. PMID:22164053

  9. Radio resource management scheme and outage analysis for network-assisted multi-hop D2D communications

    Directory of Open Access Journals (Sweden)

    Leila Melki

    2016-11-01

    Full Text Available In a cellular network it's very difficult to make spectrum resource more efficiently. Device-to-Device (D2D technology enables new service opportunities, and provides high throughput and reliable communication while reducing the base station load. For better total performance, short-range D2D links and cellular links share the same radio resource and the management of interference becomes a crucial task. Here we argue that single-hop D2D technology can be used to further improve cellular networks performance if the key D2D radio resource management algorithms are suitably extended to support multi-hop D2D communications. Aiming to establish a new paradigm for the analysis and design of multi-hop D2D communications, We propose a radio resource allocation for multi-hop D2D routes based on interference avoidance approach in LTE-A networks. On top of that, we investigate the outage probability of D2D communication. We first introduce a new definition of outage probability by considering the maximum distance to be allowable for single-hop transmission. Then we study and analyze the outage performance of a multi-hop D2D route. We derive the general closed form expression of outage probability of the multi-hop D2D routes. The results demonstrate that the D2D radio, sharing the same resources as the cellular network, provide higher capacity compared to pure cellular communication where all the data is transmitted through the base station. They also demonstrate that the new method of calculation of D2D multi hop outage probability has better performance than classical method defined in the literature.

  10. Key Management in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ismail Mansour

    2015-09-01

    Full Text Available Wireless sensor networks are a challenging field of research when it comes to security issues. Using low cost sensor nodes with limited resources makes it difficult for cryptographic algorithms to function without impacting energy consumption and latency. In this paper, we focus on key management issues in multi-hop wireless sensor networks. These networks are easy to attack due to the open nature of the wireless medium. Intruders could try to penetrate the network, capture nodes or take control over particular nodes. In this context, it is important to revoke and renew keys that might be learned by malicious nodes. We propose several secure protocols for key revocation and key renewal based on symmetric encryption and elliptic curve cryptography. All protocols are secure, but have different security levels. Each proposed protocol is formally proven and analyzed using Scyther, an automatic verification tool for cryptographic protocols. For efficiency comparison sake, we implemented all protocols on real testbeds using TelosB motes and discussed their performances.

  11. Design Aspects of An Energy-Efficient, Lightweight Medium Access Control Protocol for Wireless Sensor Networks

    NARCIS (Netherlands)

    van Hoesel, L.F.W.; Havinga, Paul J.M.

    2006-01-01

    This document gives an overview of the most relevant design aspects of the lightweight medium access control (LMAC) protocol [16] for wireless sensor networks (WSNs). These aspects include selfconfiguring and localized operation of the protocol, time synchronization in multi-hop networks, network

  12. A Multi-Hop Clustering Mechanism for Scalable IoT Networks.

    Science.gov (United States)

    Sung, Yoonyoung; Lee, Sookyoung; Lee, Meejeong

    2018-03-23

    It is expected that up to 26 billion Internet of Things (IoT) equipped with sensors and wireless communication capabilities will be connected to the Internet by 2020 for various purposes. With a large scale IoT network, having each node connected to the Internet with an individual connection may face serious scalability issues. The scalability problem of the IoT network may be alleviated by grouping the nodes of the IoT network into clusters and having a representative node in each cluster connect to the Internet on behalf of the other nodes in the cluster instead of having a per-node Internet connection and communication. In this paper, we propose a multi-hop clustering mechanism for IoT networks to minimize the number of required Internet connections. Specifically, the objective of proposed mechanism is to select the minimum number of coordinators, which take the role of a representative node for the cluster, i.e., having the Internet connection on behalf of the rest of the nodes in the cluster and to map a partition of the IoT nodes onto the selected set of coordinators to minimize the total distance between the nodes and their respective coordinator under a certain constraint in terms of maximum hop count between the IoT nodes and their respective coordinator. Since this problem can be mapped into a set cover problem which is known as NP-hard, we pursue a heuristic approach to solve the problem and analyze the complexity of the proposed solution. Through a set of experiments with varying parameters, the proposed scheme shows 63-87.3% reduction of the Internet connections depending on the number of the IoT nodes while that of the optimal solution is 65.6-89.9% in a small scale network. Moreover, it is shown that the performance characteristics of the proposed mechanism coincide with expected performance characteristics of the optimal solution in a large-scale network.

  13. A Method for Dynamically Selecting the Best Frequency Hopping Technique in Industrial Wireless Sensor Network Applications.

    Science.gov (United States)

    Fernández de Gorostiza, Erlantz; Berzosa, Jorge; Mabe, Jon; Cortiñas, Roberto

    2018-02-23

    Industrial wireless applications often share the communication channel with other wireless technologies and communication protocols. This coexistence produces interferences and transmission errors which require appropriate mechanisms to manage retransmissions. Nevertheless, these mechanisms increase the network latency and overhead due to the retransmissions. Thus, the loss of data packets and the measures to handle them produce an undesirable drop in the QoS and hinder the overall robustness and energy efficiency of the network. Interference avoidance mechanisms, such as frequency hopping techniques, reduce the need for retransmissions due to interferences but they are often tailored to specific scenarios and are not easily adapted to other use cases. On the other hand, the total absence of interference avoidance mechanisms introduces a security risk because the communication channel may be intentionally attacked and interfered with to hinder or totally block it. In this paper we propose a method for supporting the design of communication solutions under dynamic channel interference conditions and we implement dynamic management policies for frequency hopping technique and channel selection at runtime. The method considers several standard frequency hopping techniques and quality metrics, and the quality and status of the available frequency channels to propose the best combined solution to minimize the side effects of interferences. A simulation tool has been developed and used in this work to validate the method.

  14. Decentralized control of transmission rates in energy-critical wireless networks

    KAUST Repository

    Xia, Li

    2013-06-01

    In this paper, we discuss the decentralized optimization of delay and energy consumption in a multi-hop wireless network. The goal is to minimize the energy consumption of energy-critical nodes and the overall packet transmission delay of the network. The transmission rates of energy-critical nodes are adjustable according to the local information of nodes, i.e., the length of packets queued. The multi-hop network is modeled as a queueing network.We prove that the system performance is monotone w.r.t. (with respect to) the transmission rate, thus the “bang-bang” control is an optimal control. We also prove that there exists a threshold type control policy which is optimal. We propose a decentralized algorithm to control transmission rates of these energy-critical nodes. Some simulation experiments are conducted to demonstrate the effectiveness of our approach.

  15. Decentralized control of transmission rates in energy-critical wireless networks

    KAUST Repository

    Xia, Li; Shihada, Basem

    2013-01-01

    In this paper, we discuss the decentralized optimization of delay and energy consumption in a multi-hop wireless network. The goal is to minimize the energy consumption of energy-critical nodes and the overall packet transmission delay of the network. The transmission rates of energy-critical nodes are adjustable according to the local information of nodes, i.e., the length of packets queued. The multi-hop network is modeled as a queueing network.We prove that the system performance is monotone w.r.t. (with respect to) the transmission rate, thus the “bang-bang” control is an optimal control. We also prove that there exists a threshold type control policy which is optimal. We propose a decentralized algorithm to control transmission rates of these energy-critical nodes. Some simulation experiments are conducted to demonstrate the effectiveness of our approach.

  16. Analysis and Relative Evaluation of Connectivity of a Mobile Multi-Hop Network

    Science.gov (United States)

    Nakano, Keisuke; Miyakita, Kazuyuki; Sengoku, Masakazu; Shinoda, Shoji

    In mobile multi-hop networks, a source node S and a destination node D sometimes encounter a situation where there is no multi-hop path between them when a message M, destined for D, arrives at S. In this situation, we cannot send M from S to D immediately; however, we can deliver M to D after waiting some time with the help of two capabilities of mobility. One of the capabilities is to construct a connected multi-hop path by changing the topology of the network during the waiting time (Capability 1), and the other is to move M closer to D during the waiting time (Capability 2). In this paper, we consider three methods to deliver M from S to D by using these capabilities in different ways. Method 1 uses Capability 1 and sends M from S to D after waiting until a connected multi-hop path appears between S and D. Method 2 uses Capability 2 and delivers M to D by allowing a mobile node to carry M from S to D. Method 3 is a combination of Methods 1 and 2 and minimizes the waiting time. We evaluate and compare these three methods in terms of the mean waiting time, from the time when M arrives at S to the time when D starts receiving M, as a new approach to connectivity evaluation. We consider a one-dimensional mobile multi-hop network consisting of mobile nodes flowing in opposite directions along a street. First, we derive some approximate equations and propose an estimation method to compute the mean waiting time of Method 1. Second, we theoretically analyze the mean waiting time of Method 2, and compute a lower bound of that of Method 3. By comparing the three methods under the same assumptions using results of the analyses and some simulation results, we show relations between the mean waiting times of these methods and show how Capabilities 1 and 2 differently affect the mean waiting time.

  17. Hop-distance relationship analysis with quasi-UDG model for node localization in wireless sensor networks

    Directory of Open Access Journals (Sweden)

    Chen Ping

    2011-01-01

    Full Text Available Abstract In wireless sensor networks (WSNs, location information plays an important role in many fundamental services which includes geographic routing, target tracking, location-based coverage, topology control, and others. One promising approach in sensor network localization is the determination of location based on hop counts. A critical priori of this approach that directly influences the accuracy of location estimation is the hop-distance relationship. However, most of the related works on the hop-distance relationship assume the unit-disk graph (UDG model that is unrealistic in a practical scenario. In this paper, we formulate the hop-distance relationship for quasi-UDG model in WSNs where sensor nodes are randomly and independently deployed in a circular region based on a Poisson point process. Different from the UDG model, quasi-UDG model has the non-uniformity property for connectivity. We derive an approximated recursive expression for the probability of the hop count with a given geographic distance. The border effect and dependence problem are also taken into consideration. Furthermore, we give the expressions describing the distribution of distance with known hop counts for inner nodes and those suffered from the border effect where we discover the insignificance of the border effect. The analytical results are validated by simulations showing the accuracy of the employed approximation. Besides, we demonstrate the localization application of the formulated relationship and show the accuracy improvement in the WSN localization.

  18. Entanglement routers via a wireless quantum network based on arbitrary two qubit systems

    International Nuclear Information System (INIS)

    Metwally, N

    2014-01-01

    A wireless quantum network is generated between multi-hops, where each hop consists of two entangled nodes. These nodes share a finite number of entangled two-qubit systems randomly. Different types of wireless quantum bridges (WQBS) are generated between the non-connected nodes. The efficiency of these WQBS to be used as quantum channels between its terminals to perform quantum teleportation is investigated. We suggest a theoretical wireless quantum communication protocol to teleport unknown quantum signals from one node to another, where the more powerful WQBS are used as quantum channels. It is shown that, by increasing the efficiency of the sources that emit the initial partial entangled states, one can increase the efficiency of the wireless quantum communication protocol. (paper)

  19. A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF

    Directory of Open Access Journals (Sweden)

    Vaibhav Soni

    2015-01-01

    Full Text Available In wireless sensor networks, geographic adaptive fidelity (GAF is one of the most popular energy-aware routing protocols. It conserves energy by identifying equivalence between sensors from a routing perspective and then turning off unnecessary sensors, while maintaining the connectivity of the network. Nevertheless, the traditional GAF still cannot reach the optimum energy usage since it needs more number of hops to transmit data packets to the sink. As a result, it also leads to higher packet delay. In this paper, we propose a modified version of GAF to minimize hop count for data routing, called two-level GAF (T-GAF. Furthermore, we use a generalized version of GAF called Diagonal-GAF (DGAF where two diagonal adjacent grids can also directly communicate. It has an advantage of less overhead of coordinator election based on the residual energy of sensors. Analysis and simulation results show significant improvements of the proposed work comparing to traditional GAF in the aspect of total hop count, energy consumption, total distance covered by the data packet before reaching the sink, and packet delay. As a result, compared to traditional GAF, it needs 40% to 47% less hop count and consumes 27% to 35% less energy to extend the network lifetime.

  20. Hop-by-HopWorm Propagation with Carryover Epidemic Model in Mobile Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jun-Won Ho

    2015-10-01

    Full Text Available In the internet, a worm is usually propagated in a random multi-hop contact manner. However, the attacker will not likely select this random multi-hop propagation approach in a mobile sensor network. This is because multi-hop worm route paths to random vulnerable targets can be often breached due to node mobility, leading to failure of fast worm spread under this strategy. Therefore, an appropriate propagation strategy is needed for mobile sensor worms. To meet this need, we discuss a hop-by-hop worm propagation model in mobile sensor networks. In a hop-by-hop worm propagation model, benign nodes are infected by worm in neighbor-to-neighbor spread manner. Since worm infection occurs in hop-by-hop contact, it is not substantially affected by a route breach incurred by node mobility. We also propose the carryover epidemic model to deal with the worm infection quota deficiency that might occur when employing an epidemic model in a mobile sensor network. We analyze worm infection capability under the carryover epidemic model. Moreover, we simulate hop-by-hop worm propagation with carryover epidemic model by using an ns-2 simulator. The simulation results demonstrate that infection quota carryovers are seldom observed where a node’s maximum speed is no less than 20 m/s.

  1. Multi-Domain SDN Survivability for Agricultural Wireless Sensor Networks.

    Science.gov (United States)

    Huang, Tao; Yan, Siyu; Yang, Fan; Liu, Jiang

    2016-11-06

    Wireless sensor networks (WSNs) have been widely applied in agriculture field; meanwhile, the advent of multi-domain software-defined networks (SDNs) have improved the wireless resource utilization rate and strengthened network management. In recent times, multi-domain SDNs have been applied to agricultural sensor networks, namely multi-domain software-defined wireless sensor networks (SDWSNs). However, when the SDNs controlling agriculture networks suddenly become unavailable, whether intra-domain or inter-domain, sensor network communication is abnormal because of the loss of control. Moreover, there are controller and switch info-updating problems even if the controller becomes available again. To resolve these problems, this paper proposes a new approach based on an Open vSwitch extension for multi-domain SDWSNs, which can enhance agriculture network survivability and stability. We achieved this by designing a connection-state mechanism, a communication mechanism on both L2 and L3, and an info-updating mechanism based on Open vSwitch. The experimental results show that, whether it is agricultural inter-domain or intra-domain during the controller failure period, the sensor switches can enter failure recovery mode as soon as possible so that the sensor network keeps a stable throughput, a short failure recovery time below 300 ms, and low packet loss. Further, the domain can smoothly control the domain network again once the controller becomes available. This approach based on an Open vSwitch extension can enhance the survivability and stability of multi-domain SDWSNs in precision agriculture.

  2. Multi-Domain SDN Survivability for Agricultural Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Tao Huang

    2016-11-01

    Full Text Available Wireless sensor networks (WSNs have been widely applied in agriculture field; meanwhile, the advent of multi-domain software-defined networks (SDNs have improved the wireless resource utilization rate and strengthened network management. In recent times, multi-domain SDNs have been applied to agricultural sensor networks, namely multi-domain software-defined wireless sensor networks (SDWSNs. However, when the SDNs controlling agriculture networks suddenly become unavailable, whether intra-domain or inter-domain, sensor network communication is abnormal because of the loss of control. Moreover, there are controller and switch info-updating problems even if the controller becomes available again. To resolve these problems, this paper proposes a new approach based on an Open vSwitch extension for multi-domain SDWSNs, which can enhance agriculture network survivability and stability. We achieved this by designing a connection-state mechanism, a communication mechanism on both L2 and L3, and an info-updating mechanism based on Open vSwitch. The experimental results show that, whether it is agricultural inter-domain or intra-domain during the controller failure period, the sensor switches can enter failure recovery mode as soon as possible so that the sensor network keeps a stable throughput, a short failure recovery time below 300 ms, and low packet loss. Further, the domain can smoothly control the domain network again once the controller becomes available. This approach based on an Open vSwitch extension can enhance the survivability and stability of multi-domain SDWSNs in precision agriculture.

  3. On Throughput Improvement of Wireless Ad Hoc Networks with Hidden Nodes

    Science.gov (United States)

    Choi, Hong-Seok; Lim, Jong-Tae

    In this letter, we present the throughput analysis of the wireless ad hoc networks based on the IEEE 802.11 MAC (Medium Access Control). Especially, our analysis includes the case with the hidden node problem so that it can be applied to the multi-hop networks. In addition, we suggest a new channel access control algorithm to maximize the network throughput and show the usefulness of the proposed algorithm through simulations.

  4. An Embedded Multi-Agent Systems Based Industrial Wireless Sensor Network.

    Science.gov (United States)

    Taboun, Mohammed S; Brennan, Robert W

    2017-09-14

    With the emergence of cyber-physical systems, there has been a growing interest in network-connected devices. One of the key requirements of a cyber-physical device is the ability to sense its environment. Wireless sensor networks are a widely-accepted solution for this requirement. In this study, an embedded multi-agent systems-managed wireless sensor network is presented. A novel architecture is proposed, along with a novel wireless sensor network architecture. Active and passive wireless sensor node types are defined, along with their communication protocols, and two application-specific examples are presented. A series of three experiments is conducted to evaluate the performance of the agent-embedded wireless sensor network.

  5. Quality of Service Metrics in Wireless Sensor Networks: A Survey

    Science.gov (United States)

    Snigdh, Itu; Gupta, Nisha

    2016-03-01

    Wireless ad hoc network is characterized by autonomous nodes communicating with each other by forming a multi hop radio network and maintaining connectivity in a decentralized manner. This paper presents a systematic approach to the interdependencies and the analogy of the various factors that affect and constrain the wireless sensor network. This article elaborates the quality of service parameters in terms of methods of deployment, coverage and connectivity which affect the lifetime of the network that have been addressed, till date by the different literatures. The analogy of the indispensable rudiments was discussed that are important factors to determine the varied quality of service achieved, yet have not been duly focused upon.

  6. Relaying Strategies and Protocols for Efficient Wireless Networks

    KAUST Repository

    Zafar, Ammar

    2014-10-01

    Next generation wireless networks are expected to provide high data rate and satisfy the Quality-of-Service (QoS) constraints of the users. A significant component of achieving these goals is to increase the effi ciency of wireless networks by either optimizing current architectures or exploring new technologies which achieve that. The latter includes revisiting technologies which were previously proposed, but due to a multitude of reasons were ignored at that time. One such technology is relaying which was initially proposed in the latter half of the 1960s and then was revived in the early 2000s. In this dissertation, we study relaying in conjunction with resource allocation to increase the effi ciency of wireless networks. In this regard, we differentiate between conventional relaying and relaying with buffers. Conventional relaying is traditional relaying where the relay forwards the signal it received immediately. On the other hand, in relaying with buffers or buffer-aided relaying as it is called, the relay can store received data in its buffer and forward it later on. This gives the benefit of taking advantage of good channel conditions as the relay can only transmit when the channel conditions are good. The dissertation starts with conventional relaying and considers the problem of minimizing the total consumed power while maintaining system QoS. After upper bounding the system performance, more practical algorithms which require reduced feedback overhead are explored. Buffer-aided relaying is then considered and the joint user-and-hop scheduler is introduced which exploits multi-user diversity (MUD) and 5 multi-hop diversity (MHD) gains together in dual-hop broadcast channels. Next joint user-and-hop scheduling is extended to the shared relay channel where two source-destination pairs share a single relay. The benefits of buffer-aided relaying in the bidirectional relay channel utilizing network coding are then explored. Finally, a new transmission protocol

  7. An Embedded Multi-Agent Systems Based Industrial Wireless Sensor Network

    Science.gov (United States)

    Brennan, Robert W.

    2017-01-01

    With the emergence of cyber-physical systems, there has been a growing interest in network-connected devices. One of the key requirements of a cyber-physical device is the ability to sense its environment. Wireless sensor networks are a widely-accepted solution for this requirement. In this study, an embedded multi-agent systems-managed wireless sensor network is presented. A novel architecture is proposed, along with a novel wireless sensor network architecture. Active and passive wireless sensor node types are defined, along with their communication protocols, and two application-specific examples are presented. A series of three experiments is conducted to evaluate the performance of the agent-embedded wireless sensor network. PMID:28906452

  8. Multi-Destination Cognitive Radio Relay Network with SWIPT and Multiple Primary Receivers

    KAUST Repository

    Al-Habob, Ahmed A.; Salhab, Anas M.; Zummo, Salam A.; Alouini, Mohamed-Slim

    2017-01-01

    In this paper, we study the performance of simultaneous wireless information and power transfer (SWIPT) technique in a multi-destination dual-hop underlay cognitive relay network with multiple primary receivers. Information transmission from

  9. Minimum Interference Channel Assignment Algorithm for Multicast in a Wireless Mesh Network

    Directory of Open Access Journals (Sweden)

    Sangil Choi

    2016-12-01

    Full Text Available Wireless mesh networks (WMNs have been considered as one of the key technologies for the configuration of wireless machines since they emerged. In a WMN, wireless routers provide multi-hop wireless connectivity between hosts in the network and also allow them to access the Internet via gateway devices. Wireless routers are typically equipped with multiple radios operating on different channels to increase network throughput. Multicast is a form of communication that delivers data from a source to a set of destinations simultaneously. It is used in a number of applications, such as distributed games, distance education, and video conferencing. In this study, we address a channel assignment problem for multicast in multi-radio multi-channel WMNs. In a multi-radio multi-channel WMN, two nearby nodes will interfere with each other and cause a throughput decrease when they transmit on the same channel. Thus, an important goal for multicast channel assignment is to reduce the interference among networked devices. We have developed a minimum interference channel assignment (MICA algorithm for multicast that accurately models the interference relationship between pairs of multicast tree nodes using the concept of the interference factor and assigns channels to tree nodes to minimize interference within the multicast tree. Simulation results show that MICA achieves higher throughput and lower end-to-end packet delay compared with an existing channel assignment algorithm named multi-channel multicast (MCM. In addition, MICA achieves much lower throughput variation among the destination nodes than MCM.

  10. Balancing energy consumption with hybrid clustering and routing strategy in wireless sensor networks.

    Science.gov (United States)

    Xu, Zhezhuang; Chen, Liquan; Liu, Ting; Cao, Lianyang; Chen, Cailian

    2015-10-20

    Multi-hop data collection in wireless sensor networks (WSNs) is a challenge issue due to the limited energy resource and transmission range of wireless sensors. The hybrid clustering and routing (HCR) strategy has provided an effective solution, which can generate a connected and efficient cluster-based topology for multi-hop data collection in WSNs. However, it suffers from imbalanced energy consumption, which results in the poor performance of the network lifetime. In this paper, we evaluate the energy consumption of HCR and discover an important result: the imbalanced energy consumption generally appears in gradient k = 1, i.e., the nodes that can communicate with the sink directly. Based on this observation, we propose a new protocol called HCR-1, which includes the adaptive relay selection and tunable cost functions to balance the energy consumption. The guideline of setting the parameters in HCR-1 is provided based on simulations. The analytical and numerical results prove that, with minor modification of the topology in Sensors 2015, 15 26584 gradient k = 1, the HCR-1 protocol effectively balances the energy consumption and prolongs the network lifetime.

  11. Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

    Science.gov (United States)

    Radi, Marjan; Dezfouli, Behnam; Bakar, Kamalrulnizam Abu; Lee, Malrey

    2012-01-01

    A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks. PMID:22368490

  12. Multipath routing in wireless sensor networks: survey and research challenges.

    Science.gov (United States)

    Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Lee, Malrey

    2012-01-01

    A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

  13. Event-Triggered Fault Estimation for Stochastic Systems over Multi-Hop Relay Networks with Randomly Occurring Sensor Nonlinearities and Packet Dropouts.

    Science.gov (United States)

    Li, Yunji; Peng, Li

    2018-02-28

    Wireless sensors have many new applications where remote estimation is essential. Considering that a remote estimator is located far away from the process and the wireless transmission distance of sensor nodes is limited, sensor nodes always forward data packets to the remote estimator through a series of relays over a multi-hop link. In this paper, we consider a network with sensor nodes and relay nodes where the relay nodes can forward the estimated values to the remote estimator. An event-triggered remote estimator of state and fault with the corresponding data-forwarding scheme is investigated for stochastic systems subject to both randomly occurring nonlinearity and randomly occurring packet dropouts governed by Bernoulli-distributed sequences to achieve a trade-off between estimation accuracy and energy consumption. Recursive Riccati-like matrix equations are established to calculate the estimator gain to minimize an upper bound of the estimator error covariance. Subsequently, a sufficient condition and data-forwarding scheme are presented under which the error covariance is mean-square bounded in the multi-hop links with random packet dropouts. Furthermore, implementation issues of the theoretical results are discussed where a new data-forwarding communication protocol is designed. Finally, the effectiveness of the proposed algorithms and communication protocol are extensively evaluated using an experimental platform that was established for performance evaluation with a sensor and two relay nodes.

  14. On Prolonging Network Lifetime through Load-Similar Node Deployment in Wireless Sensor Networks

    Science.gov (United States)

    Li, Qiao-Qin; Gong, Haigang; Liu, Ming; Yang, Mei; Zheng, Jun

    2011-01-01

    This paper is focused on the study of the energy hole problem in the Progressive Multi-hop Rotational Clustered (PMRC)-structure, a highly scalable wireless sensor network (WSN) architecture. Based on an analysis on the traffic load distribution in PMRC-based WSNs, we propose a novel load-similar node distribution strategy combined with the Minimum Overlapping Layers (MOL) scheme to address the energy hole problem in PMRC-based WSNs. In this strategy, sensor nodes are deployed in the network area according to the load distribution. That is, more nodes shall be deployed in the range where the average load is higher, and then the loads among different areas in the sensor network tend to be balanced. Simulation results demonstrate that the load-similar node distribution strategy prolongs network lifetime and reduces the average packet latency in comparison with existing nonuniform node distribution and uniform node distribution strategies. Note that, besides the PMRC structure, the analysis model and the proposed load-similar node distribution strategy are also applicable to other multi-hop WSN structures. PMID:22163809

  15. A two-hop based adaptive routing protocol for real-time wireless sensor networks.

    Science.gov (United States)

    Rachamalla, Sandhya; Kancherla, Anitha Sheela

    2016-01-01

    One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol. It uses the adaptive transmission power algorithm which is based on the attenuation of the wireless link to improve the energy efficiency. The proposed routing mechanism can be associated with any geographic routing protocol and its performance is evaluated by integrating with the well known two-hop based real-time routing protocol, PATH and the resulting protocol is energy-efficient adaptive routing protocol (EE-ARP). The EE-ARP performs well in terms of energy consumption, deadline miss ratio, packet drop and end-to-end delay.

  16. Network Coding for Hop-by-Hop Communication Enhancement in Multi-hop Networks

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Khamfroush, Hana; Roetter, Daniel Enrique Lucani

    2016-01-01

    In our recent study, we introduced the PlayNCool protocol that increases the throughput of the wireless networks by enabling a helper node to strengthen the communication link between two neighboring nodes and using random linear network coding. This paper focuses on design and implementation adv...

  17. A Terrestrial Microbial Fuel Cell for Powering a Single-Hop Wireless Sensor Network.

    Science.gov (United States)

    Zhang, Daxing; Zhu, Yingmin; Pedrycz, Witold; Guo, Yongxian

    2016-05-18

    Microbial fuel cells (MFCs) are envisioned as one of the most promising alternative renewable energy sources because they can generate electric current continuously while treating waste. Terrestrial Microbial Fuel Cells (TMFCs) can be inoculated and work on the use of soil, which further extends the application areas of MFCs. Energy supply, as a primary influential factor determining the lifetime of Wireless Sensor Network (WSN) nodes, remains an open challenge in sensor networks. In theory, sensor nodes powered by MFCs have an eternal life. However, low power density and high internal resistance of MFCs are two pronounced problems in their operation. A single-hop WSN powered by a TMFC experimental setup was designed and experimented with. Power generation performance of the proposed TMFC, the relationships between the performance of the power generation and the environment temperature, the water content of the soil by weight were measured by experiments. Results show that the TMFC can achieve good power generation performance under special environmental conditions. Furthermore, the experiments with sensor data acquisition and wireless transmission of the TMFC powering WSN were carried out. We demonstrate that the obtained experimental results validate the feasibility of TMFCs powering WSNs.

  18. A Terrestrial Microbial Fuel Cell for Powering a Single-Hop Wireless Sensor Network

    Science.gov (United States)

    Zhang, Daxing; Zhu, Yingmin; Pedrycz, Witold; Guo, Yongxian

    2016-01-01

    Microbial fuel cells (MFCs) are envisioned as one of the most promising alternative renewable energy sources because they can generate electric current continuously while treating waste. Terrestrial Microbial Fuel Cells (TMFCs) can be inoculated and work on the use of soil, which further extends the application areas of MFCs. Energy supply, as a primary influential factor determining the lifetime of Wireless Sensor Network (WSN) nodes, remains an open challenge in sensor networks. In theory, sensor nodes powered by MFCs have an eternal life. However, low power density and high internal resistance of MFCs are two pronounced problems in their operation. A single-hop WSN powered by a TMFC experimental setup was designed and experimented with. Power generation performance of the proposed TMFC, the relationships between the performance of the power generation and the environment temperature, the water content of the soil by weight were measured by experiments. Results show that the TMFC can achieve good power generation performance under special environmental conditions. Furthermore, the experiments with sensor data acquisition and wireless transmission of the TMFC powering WSN were carried out. We demonstrate that the obtained experimental results validate the feasibility of TMFCs powering WSNs. PMID:27213346

  19. Multi-objective ant algorithm for wireless sensor network positioning

    International Nuclear Information System (INIS)

    Fidanova, S.; Shindarov, M.; Marinov, P.

    2013-01-01

    It is impossible to imagine our modern life without telecommunications. Wireless networks are a part of telecommunications. Wireless sensor networks (WSN) consist of spatially distributed sensors, which communicate in wireless way. This network monitors physical or environmental conditions. The objective is the full coverage of the monitoring region and less energy consumption of the network. The most appropriate approach to solve the problem is metaheuristics. In this paper the full coverage of the area is treated as a constrain. The objectives which are optimized are a minimal number of sensors and energy (lifetime) of the network. We apply multi-objective Ant Colony Optimization to solve this important telecommunication problem. We chose MAX-MIN Ant System approach, because it is proven to converge to the global optima

  20. Achieving Fair Throughput among TCP Flows in Multi-Hop Wireless Mesh Networks

    Science.gov (United States)

    Hou, Ting-Chao; Hsu, Chih-Wei

    Previous research shows that the IEEE 802.11 DCF channel contention mechanism is not capable of providing throughput fairness among nodes in different locations of the wireless mesh network. The node nearest the gateway will always strive for the chance to transmit data, causing fewer transmission opportunities for the nodes farther from the gateway, resulting in starvation. Prior studies modify the DCF mechanism to address the fairness problem. This paper focuses on the fairness study when TCP flows are carried over wireless mesh networks. By not modifying lower layer protocols, the current work identifies TCP parameters that impact throughput fairness and proposes adjusting those parameters to reduce frame collisions and improve throughput fairness. With the aid of mathematical formulation and ns2 simulations, this study finds that frame transmission from each node can be effectively controlled by properly controlling the delayed ACK timer and using a suitable advertised window. The proposed method reduces frame collisions and greatly improves TCP throughput fairness.

  1. Extensive Investigations on Bio-Inspired Trust and Reputation Model over Hops Coefficient Factor in Distributed Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Vinod Kumar Verma

    2014-08-01

    Full Text Available Resource utilization requires a substantial consideration for a trust and reputation model to be deployed within a wireless sensor network (WSN. In the evaluation, our attention is focused on the effect of hops coefficient factor estimation on WSN with bio-inspired trust and reputation model (BTRM. We present the state-of-the-art system level evaluation of accuracy and path length of sensor node operations for their current and average scenarios. Additionally, we emphasized over the energy consumption evaluation for static, dynamic and oscillatory modes of BTRM-WSN model. The performance of the hops coefficient factor for our proposed framework is evaluated via analytic bounds and numerical simulations.

  2. Self-Organization Scheme for Balanced Routing in Large-Scale Multi-Hop Networks

    DEFF Research Database (Denmark)

    Badiu, Mihai Alin; Saad, David; Coon, Justin P.

    2018-01-01

    We propose a self-organization scheme for cost-effective and load-balanced routing in multi-hop networks. To avoid overloading nodes that provide favourable routing conditions, we assign each node with a cost function that penalizes high loads. Thus, finding routes to sink nodes is formulated...

  3. Wifi, WiMax and LTE multi-hop mesh networks basic communication protocols and application areas

    CERN Document Server

    Wei, Hung-Yu; Dixit, Sudhir

    2013-01-01

    Wifi, WiMAX, and Cellular Multihop Networks presents an overview of WiFi-based and WiMAX-based multihop relay networks. As the first text to cover IEEE 802.16j multihop hop relay technology, this revolutionary resource explores the latest advances in multi-hop and ad-hoc networking. Not only does this reference provide the technological aspects, but also the applications for the emerging technology and architectural issues. Ranging from introductory material to advanced topics, this guidebook, plus PowerPoint slides, is essential for engineers, researchers, and students interested in

  4. Enhancing a network coding security scheme to avoid packet dropping in wireless mesh networks / H.L.H.C. Terblanche.

    OpenAIRE

    Terblanche, Heila Levina Helena Catharina

    2013-01-01

    With the increase of mobile and smart device usage, the interest in dynamically forming networks is rising. One such type of network isWireless Mesh Networks (WMNs). WMNs are multi-hop networks, with a decentralised nature that can dynamically form into mesh topologies. Network Coding (NC) is a method that is used to increase the efficiency of networks by encoding and decoding data on packet level by means of an XOR operation. NC works well with WMNs because it can exploit WMNs broadcast a...

  5. Range based power control for multi-radio multi-channel wireless mesh networks

    CSIR Research Space (South Africa)

    Olwal, TO

    2009-08-01

    Full Text Available Multi-Radio Multi-Channel (MRMC) systems are key to power control problems in Wireless Mesh Networks (WMNs). In this paper, researchers present a range based dynamic power control for MRMC WMNs. First, WMN is represented as a set of disjoint Unified...

  6. End-to-end delay analysis in wireless sensor networks with service vacation

    KAUST Repository

    Alabdulmohsin, Ibrahim; Hyadi, Amal; Afify, Laila H.; Shihada, Basem

    2014-01-01

    In this paper, a delay-sensitive multi-hop wireless sensor network is considered, employing an M/G/1 with vacations framework. Sensors transmit measurements to a predefined data sink subject to maximum end-to-end delay constraint. In order to prolong the battery lifetime, a sleeping scheme is adopted throughout the network nodes. The objective of our proposed framework is to present an expression for maximum hop-count as well as an approximate expression of the probability of blocking at the sink node upon violating certain end-to-end delay threshold. Using numerical simulations, we validate the proposed analytical model and demonstrate that the blocking probability of the system for various vacation time distributions matches the simulation results.

  7. End-to-end delay analysis in wireless sensor networks with service vacation

    KAUST Repository

    Alabdulmohsin, Ibrahim

    2014-04-01

    In this paper, a delay-sensitive multi-hop wireless sensor network is considered, employing an M/G/1 with vacations framework. Sensors transmit measurements to a predefined data sink subject to maximum end-to-end delay constraint. In order to prolong the battery lifetime, a sleeping scheme is adopted throughout the network nodes. The objective of our proposed framework is to present an expression for maximum hop-count as well as an approximate expression of the probability of blocking at the sink node upon violating certain end-to-end delay threshold. Using numerical simulations, we validate the proposed analytical model and demonstrate that the blocking probability of the system for various vacation time distributions matches the simulation results.

  8. Multi-channel distributed coordinated function over single radio in wireless sensor networks.

    Science.gov (United States)

    Campbell, Carlene E-A; Loo, Kok-Keong Jonathan; Gemikonakli, Orhan; Khan, Shafiullah; Singh, Dhananjay

    2011-01-01

    Multi-channel assignments are becoming the solution of choice to improve performance in single radio for wireless networks. Multi-channel allows wireless networks to assign different channels to different nodes in real-time transmission. In this paper, we propose a new approach, Multi-channel Distributed Coordinated Function (MC-DCF) which takes advantage of multi-channel assignment. The backoff algorithm of the IEEE 802.11 distributed coordination function (DCF) was modified to invoke channel switching, based on threshold criteria in order to improve the overall throughput for wireless sensor networks (WSNs) over 802.11 networks. We presented simulation experiments in order to investigate the characteristics of multi-channel communication in wireless sensor networks using an NS2 platform. Nodes only use a single radio and perform channel switching only after specified threshold is reached. Single radio can only work on one channel at any given time. All nodes initiate constant bit rate streams towards the receiving nodes. In this work, we studied the impact of non-overlapping channels in the 2.4 frequency band on: constant bit rate (CBR) streams, node density, source nodes sending data directly to sink and signal strength by varying distances between the sensor nodes and operating frequencies of the radios with different data rates. We showed that multi-channel enhancement using our proposed algorithm provides significant improvement in terms of throughput, packet delivery ratio and delay. This technique can be considered for WSNs future use in 802.11 networks especially when the IEEE 802.11n becomes popular thereby may prevent the 802.15.4 network from operating effectively in the 2.4 GHz frequency band.

  9. Bluetooth Low Power Modes Applied to the Data Transportation Network in Home Automation Systems

    Directory of Open Access Journals (Sweden)

    Josu Etxaniz

    2017-04-01

    Full Text Available Even though home automation is a well-known research and development area, recent technological improvements in different areas such as context recognition, sensing, wireless communications or embedded systems have boosted wireless smart homes. This paper focuses on some of those areas related to home automation. The paper draws attention to wireless communications issues on embedded systems. Specifically, the paper discusses the multi-hop networking together with Bluetooth technology and latency, as a quality of service (QoS metric. Bluetooth is a worldwide standard that provides low power multi-hop networking. It is a radio license free technology and establishes point-to-point and point-to-multipoint links, known as piconets, or multi-hop networks, known as scatternets. This way, many Bluetooth nodes can be interconnected to deploy ambient intelligent networks. This paper introduces the research on multi-hop latency done with park and sniff low power modes of Bluetooth over the test platform developed. Besides, an empirical model is obtained to calculate the latency of Bluetooth multi-hop communications over asynchronous links when links in scatternets are always in sniff or the park mode. Smart home devices and networks designers would take advantage of the models and the estimation of the delay they provide in communications along Bluetooth multi-hop networks.

  10. Bluetooth Low Power Modes Applied to the Data Transportation Network in Home Automation Systems

    Science.gov (United States)

    Etxaniz, Josu; Aranguren, Gerardo

    2017-01-01

    Even though home automation is a well-known research and development area, recent technological improvements in different areas such as context recognition, sensing, wireless communications or embedded systems have boosted wireless smart homes. This paper focuses on some of those areas related to home automation. The paper draws attention to wireless communications issues on embedded systems. Specifically, the paper discusses the multi-hop networking together with Bluetooth technology and latency, as a quality of service (QoS) metric. Bluetooth is a worldwide standard that provides low power multi-hop networking. It is a radio license free technology and establishes point-to-point and point-to-multipoint links, known as piconets, or multi-hop networks, known as scatternets. This way, many Bluetooth nodes can be interconnected to deploy ambient intelligent networks. This paper introduces the research on multi-hop latency done with park and sniff low power modes of Bluetooth over the test platform developed. Besides, an empirical model is obtained to calculate the latency of Bluetooth multi-hop communications over asynchronous links when links in scatternets are always in sniff or the park mode. Smart home devices and networks designers would take advantage of the models and the estimation of the delay they provide in communications along Bluetooth multi-hop networks. PMID:28468294

  11. Bluetooth Low Power Modes Applied to the Data Transportation Network in Home Automation Systems.

    Science.gov (United States)

    Etxaniz, Josu; Aranguren, Gerardo

    2017-04-30

    Even though home automation is a well-known research and development area, recent technological improvements in different areas such as context recognition, sensing, wireless communications or embedded systems have boosted wireless smart homes. This paper focuses on some of those areas related to home automation. The paper draws attention to wireless communications issues on embedded systems. Specifically, the paper discusses the multi-hop networking together with Bluetooth technology and latency, as a quality of service (QoS) metric. Bluetooth is a worldwide standard that provides low power multi-hop networking. It is a radio license free technology and establishes point-to-point and point-to-multipoint links, known as piconets, or multi-hop networks, known as scatternets. This way, many Bluetooth nodes can be interconnected to deploy ambient intelligent networks. This paper introduces the research on multi-hop latency done with park and sniff low power modes of Bluetooth over the test platform developed. Besides, an empirical model is obtained to calculate the latency of Bluetooth multi-hop communications over asynchronous links when links in scatternets are always in sniff or the park mode. Smart home devices and networks designers would take advantage of the models and the estimation of the delay they provide in communications along Bluetooth multi-hop networks.

  12. Efficient data communication protocols for wireless networks

    Science.gov (United States)

    Zeydan, Engin

    In this dissertation, efficient decentralized algorithms are investigated for cost minimization problems in wireless networks. For wireless sensor networks, we investigate both the reduction in the energy consumption and throughput maximization problems separately using multi-hop data aggregation for correlated data in wireless sensor networks. The proposed algorithms exploit data redundancy using a game theoretic framework. For energy minimization, routes are chosen to minimize the total energy expended by the network using best response dynamics to local data. The cost function used in routing takes into account distance, interference and in-network data aggregation. The proposed energy-efficient correlation-aware routing algorithm significantly reduces the energy consumption in the network and converges in a finite number of steps iteratively. For throughput maximization, we consider both the interference distribution across the network and correlation between forwarded data when establishing routes. Nodes along each route are chosen to minimize the interference impact in their neighborhood and to maximize the in-network data aggregation. The resulting network topology maximizes the global network throughput and the algorithm is guaranteed to converge with a finite number of steps using best response dynamics. For multiple antenna wireless ad-hoc networks, we present distributed cooperative and regret-matching based learning schemes for joint transmit beanformer and power level selection problem for nodes operating in multi-user interference environment. Total network transmit power is minimized while ensuring a constant received signal-to-interference and noise ratio at each receiver. In cooperative and regret-matching based power minimization algorithms, transmit beanformers are selected from a predefined codebook to minimize the total power. By selecting transmit beamformers judiciously and performing power adaptation, the cooperative algorithm is shown to

  13. Design of Compressed Sensing Algorithm for Coal Mine IoT Moving Measurement Data Based on a Multi-Hop Network and Total Variation

    Directory of Open Access Journals (Sweden)

    Gang Wang

    2018-05-01

    Full Text Available As the application of a coal mine Internet of Things (IoT, mobile measurement devices, such as intelligent mine lamps, cause moving measurement data to be increased. How to transmit these large amounts of mobile measurement data effectively has become an urgent problem. This paper presents a compressed sensing algorithm for the large amount of coal mine IoT moving measurement data based on a multi-hop network and total variation. By taking gas data in mobile measurement data as an example, two network models for the transmission of gas data flow, namely single-hop and multi-hop transmission modes, are investigated in depth, and a gas data compressed sensing collection model is built based on a multi-hop network. To utilize the sparse characteristics of gas data, the concept of total variation is introduced and a high-efficiency gas data compression and reconstruction method based on Total Variation Sparsity based on Multi-Hop (TVS-MH is proposed. According to the simulation results, by using the proposed method, the moving measurement data flow from an underground distributed mobile network can be acquired and transmitted efficiently.

  14. Design of Compressed Sensing Algorithm for Coal Mine IoT Moving Measurement Data Based on a Multi-Hop Network and Total Variation.

    Science.gov (United States)

    Wang, Gang; Zhao, Zhikai; Ning, Yongjie

    2018-05-28

    As the application of a coal mine Internet of Things (IoT), mobile measurement devices, such as intelligent mine lamps, cause moving measurement data to be increased. How to transmit these large amounts of mobile measurement data effectively has become an urgent problem. This paper presents a compressed sensing algorithm for the large amount of coal mine IoT moving measurement data based on a multi-hop network and total variation. By taking gas data in mobile measurement data as an example, two network models for the transmission of gas data flow, namely single-hop and multi-hop transmission modes, are investigated in depth, and a gas data compressed sensing collection model is built based on a multi-hop network. To utilize the sparse characteristics of gas data, the concept of total variation is introduced and a high-efficiency gas data compression and reconstruction method based on Total Variation Sparsity based on Multi-Hop (TVS-MH) is proposed. According to the simulation results, by using the proposed method, the moving measurement data flow from an underground distributed mobile network can be acquired and transmitted efficiently.

  15. A Unified NET-MAC-PHY Cross-layer Framework for Performance Evaluation of Multi-hop Ad hoc WLANs

    Directory of Open Access Journals (Sweden)

    Rachid El-Azouzi

    2014-09-01

    Full Text Available Most of the existing works have been evaluated the performance of 802.11 multihop networks by considering the MAC layer or network layer separately. Knowing the nature of the multi-hop ad hoc networks, many factors in different layers are crucial for study the performance of MANET. In this paper we present a new analytic model for evaluating average end-to-end throughput in IEEE 802.11e multihop wireless networks. In particular, we investigate an intricate interaction among PHY, MAC and Network layers. For instance, we incorporate carrier sense threshold, transmission power, contention window size, retransmissions retry limit, multi rates, routing protocols and network topology together. We build a general cross-layered framework to represent multi-hop ad hoc networks with asymmetric topology and asymmetric traffic. We develop an analytical model to predict throughput of each connection as well as stability of forwarding queues at intermediate nodes in saturated networks. To the best of our knowledge, it seems that our work is the first wherein general topology and asymmetric parameters setup are considered in PHY/MAC/Network layers. Performance of such a system is also evaluated through simulation. We show that performance measures of the MAC layer are affected by the traffic intensity of flows to be forwarded. More precisely, attempt rate and collision probability are dependent on traffic flows, topology and routing.

  16. DEHAR: a Distributed Energy Harvesting Aware Routing Algorithm for Ad-hoc Multi-hop Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Jakobsen, Mikkel Koefoed; Madsen, Jan; Hansen, Michael Reichhardt

    2010-01-01

    One of the key design goals in Wireless Sensor Networks is long lasting or even continuous operation. Continuous operation is made possible through energy harvesting. Keeping the network operational imposes a demand to prevent network segmentation and power loss in nodes. It is therefore important...... that the best energy-wise route is found for each data transfer from a source node to the sink node. We present a new adaptive and distributed routing algorithm for finding energy optimised routes in a wireless sensor network with energy harvesting. The algorithm finds an energy efficient route from each source...

  17. MAC layer security issues in wireless mesh networks

    Science.gov (United States)

    Reddy, K. Ganesh; Thilagam, P. Santhi

    2016-03-01

    Wireless Mesh Networks (WMNs) have emerged as a promising technology for a broad range of applications due to their self-organizing, self-configuring and self-healing capability, in addition to their low cost and easy maintenance. Securing WMNs is more challenging and complex issue due to their inherent characteristics such as shared wireless medium, multi-hop and inter-network communication, highly dynamic network topology and decentralized architecture. These vulnerable features expose the WMNs to several types of attacks in MAC layer. The existing MAC layer standards and implementations are inadequate to secure these features and fail to provide comprehensive security solutions to protect both backbone and client mesh. Hence, there is a need for developing efficient, scalable and integrated security solutions for WMNs. In this paper, we classify the MAC layer attacks and analyze the existing countermeasures. Based on attacks classification and countermeasures analysis, we derive the research directions to enhance the MAC layer security for WMNs.

  18. On the Performance of Millimeter Wave-based RF-FSO Multi-hop and Mesh Networks

    KAUST Repository

    Makki, Behrooz; Svensson, Tommy; Brandt-Pearce, Maite; Alouini, Mohamed-Slim

    2017-01-01

    This paper studies the performance of multi-hop and mesh networks composed of millimeter wave-based radio frequency (RF) and free-space optical (FSO) links. The results are obtained in cases with and without hybrid automatic repeat request (HARQ

  19. Multiple-state based power control for multi-radio multi-channel wireless mesh networks

    CSIR Research Space (South Africa)

    Olwal, TO

    2009-01-01

    Full Text Available Multi-Radio Multi-Channel (MRMC) systems are key to power control problems in wireless mesh networks (WMNs). In this paper, we present asynchronous multiple-state based power control for MRMC WMNs. First, WMN is represented as a set of disjoint...

  20. Significant performance improvement obtained in a wireless mesh network using a beamswitching antenna

    CSIR Research Space (South Africa)

    Lysko, AA

    2012-09-01

    Full Text Available mesh network operated in a fixed 11 Mbps mode. The throughput improvement in multi-hop communication obtained in the presence of an interferer is tenfold, from 0.2 Mbps to 2 Mbps. Index Terms?antenna, smart antenna, wireless mesh network, WMN... efficiency in the communications, and active research and development of new methods and technologies enabling this at the physical layer, including multiple antenna techniques, such as multiple input multiple output (MIMO) and smart antennas...

  1. A Middleware Solution for Wireless IoT Applications in Sparse Smart Cities

    Science.gov (United States)

    Lanzone, Stefano; Riberto, Giulio; Stefanelli, Cesare; Tortonesi, Mauro

    2017-01-01

    The spread of off-the-shelf mobile devices equipped with multiple wireless interfaces together with sophisticated sensors is paving the way to novel wireless Internet of Things (IoT) environments, characterized by multi-hop infrastructure-less wireless networks where devices carried by users act as sensors/actuators as well as network nodes. In particular, the paper presents Real Ad-hoc Multi-hop Peer-to peer-Wireless IoT Application (RAMP-WIA), a novel solution that facilitates the development, deployment, and management of applications in sparse Smart City environments, characterized by users willing to collaborate by allowing new applications to be deployed on their smartphones to remotely monitor and control fixed/mobile devices. RAMP-WIA allows users to dynamically configure single-hop wireless links, to manage opportunistically multi-hop packet dispatching considering that the network topology (together with the availability of sensors and actuators) may abruptly change, to actuate reliably sensor nodes specifically considering that only part of them could be actually reachable in a timely manner, and to upgrade dynamically the nodes through over-the-air distribution of new software components. The paper also reports the performance of RAMP-WIA on simple but realistic cases of small-scale deployment scenarios with off-the-shelf Android smartphones and Raspberry Pi devices; these results show not only the feasibility and soundness of the proposed approach, but also the efficiency of the middleware implemented when deployed on real testbeds. PMID:29099745

  2. A Middleware Solution for Wireless IoT Applications in Sparse Smart Cities.

    Science.gov (United States)

    Bellavista, Paolo; Giannelli, Carlo; Lanzone, Stefano; Riberto, Giulio; Stefanelli, Cesare; Tortonesi, Mauro

    2017-11-03

    The spread of off-the-shelf mobile devices equipped with multiple wireless interfaces together with sophisticated sensors is paving the way to novel wireless Internet of Things (IoT) environments, characterized by multi-hop infrastructure-less wireless networks where devices carried by users act as sensors/actuators as well as network nodes. In particular, the paper presents Real Ad-hoc Multi-hop Peer-to peer-Wireless IoT Application (RAMP-WIA), a novel solution that facilitates the development, deployment, and management of applications in sparse Smart City environments, characterized by users willing to collaborate by allowing new applications to be deployed on their smartphones to remotely monitor and control fixed/mobile devices. RAMP-WIA allows users to dynamically configure single-hop wireless links, to manage opportunistically multi-hop packet dispatching considering that the network topology (together with the availability of sensors and actuators) may abruptly change, to actuate reliably sensor nodes specifically considering that only part of them could be actually reachable in a timely manner, and to upgrade dynamically the nodes through over-the-air distribution of new software components. The paper also reports the performance of RAMP-WIA on simple but realistic cases of small-scale deployment scenarios with off-the-shelf Android smartphones and Raspberry Pi devices; these results show not only the feasibility and soundness of the proposed approach, but also the efficiency of the middleware implemented when deployed on real testbeds.

  3. A Middleware Solution for Wireless IoT Applications in Sparse Smart Cities

    Directory of Open Access Journals (Sweden)

    Paolo Bellavista

    2017-11-01

    Full Text Available The spread of off-the-shelf mobile devices equipped with multiple wireless interfaces together with sophisticated sensors is paving the way to novel wireless Internet of Things (IoT environments, characterized by multi-hop infrastructure-less wireless networks where devices carried by users act as sensors/actuators as well as network nodes. In particular, the paper presents Real Ad-hoc Multi-hop Peer-to peer-Wireless IoT Application (RAMP-WIA, a novel solution that facilitates the development, deployment, and management of applications in sparse Smart City environments, characterized by users willing to collaborate by allowing new applications to be deployed on their smartphones to remotely monitor and control fixed/mobile devices. RAMP-WIA allows users to dynamically configure single-hop wireless links, to manage opportunistically multi-hop packet dispatching considering that the network topology (together with the availability of sensors and actuators may abruptly change, to actuate reliably sensor nodes specifically considering that only part of them could be actually reachable in a timely manner, and to upgrade dynamically the nodes through over-the-air distribution of new software components. The paper also reports the performance of RAMP-WIA on simple but realistic cases of small-scale deployment scenarios with off-the-shelf Android smartphones and Raspberry Pi devices; these results show not only the feasibility and soundness of the proposed approach, but also the efficiency of the middleware implemented when deployed on real testbeds.

  4. A Wireless Sensor Network for Structural Health Monitoring: Performance and Experience

    OpenAIRE

    Paek, Jeongyeup; Chintalapudi, Krishna; Caffrey, John; Govindan, Ramesh; Masri, Sami

    2005-01-01

    While sensor network research has made significant strides in the past few years, the literature has relatively few examples of papers that have evaluated and validated a complete experimental system. In this paper we discuss our deployment experiences and evaluate the performance of a multi-hop wireless data acquisition system (called Wisden) for structural health monitoring (SHM) on a large seismic test structure used by civil engineers. Our experiments indicate that, with the latest sensor...

  5. TMAC: Timestamp-Ordered MAC Protocol for Wireless Mesh Networks

    KAUST Repository

    Nawab, Faisal

    2011-05-01

    Wireless Mesh Networks (WMNs) have emerged to meet a need for a self-organized and self-configured multi-hop wireless network infrastructure. Low cost infrastructure and ease of deployment have made WMNs an attractive technology for last mile access. However, 802.11 based WMNs are subject to serious fairness issues. With backlogged TCP traffic, nodes which are two or more hops away from the gateway are subject to starvation, while the one-hop away node saturates the channel with its own local traffic. We study the interactions of TCP and IEEE 802.11 MAC in WMNs to aid us in understanding and overcoming the unfairness problem. We propose a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput performance due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically derive the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs via a manipulative per-node scheduling mechanism which takes advantage of the age of each packet as a priority metric. Simulation is conducted to validate our model and to illustrate the fairness characteristics of TMAC. Our results show that TMAC achieves excellent resource allocation fairness while maintaining above 90% of maximum link capacity in parking lot and large grid topologies. Our work illuminates the factors affecting TCP fairness in WMNs. Our theoretical and empirical findings can be used in future research to develop more fairness-aware protocols for WMNs.

  6. A Stochastic Geometry Model for Multi-hop Highway Vehicular Communication

    KAUST Repository

    Farooq, Muhammad Junaid

    2015-11-19

    Carrier sense multiple access (CSMA) protocol is standardized for vehicular communication to ensure a distributed and efficient communication between vehicles. However, several vehicular applications require efficient multi-hop information dissemination. This paper exploits stochastic geometry to develop a tractable and accurate modeling framework to characterize the multi-hop transmissions for vehicular networks in a multi-lane highway setup. In particular, we study the tradeoffs between per-hop packet forward progress, per-hop transmission success probability, and spatial frequency reuse (SFR) efficiency imposed by different packet forwarding schemes, namely, most forward with fixed radius (MFR), the nearest with forward progress (NFP), and the random with forward progress (RFP). We also define a new performance metric, denoted as the aggregate packet progress (APP), which is a dimensionless quantity that captures the aforementioned tradeoffs. To this end, the developed model reveals the interplay between the spectrum sensing threshold (th) of the CSMA protocol and the packet forwarding scheme. Our results show that, in contrary to ALOHA networks which always favor NFP, MFR may achieve the highest APP in CSMA networks if th is properly chosen.

  7. Wireless Testbed Bonsai

    Science.gov (United States)

    2006-02-01

    wireless sensor device network, and a about 200 Stargate nodes higher-tier multi-hop peer- to-peer 802.11b wireless network. Leading up to the full ExScal...deployment, we conducted spatial scaling tests on our higher-tier protocols on a 7 × 7 grid of Stargates nodes 45m and with 90m separations respectively...onW and its scaled version W̃ . III. EXPERIMENTAL SETUP Description of Kansei testbed. A stargate is a single board linux-based computer [7]. It uses a

  8. MCBT: Multi-Hop Cluster Based Stable Backbone Trees for Data Collection and Dissemination in WSNs

    Directory of Open Access Journals (Sweden)

    Tae-Jin Lee

    2009-07-01

    Full Text Available We propose a stable backbone tree construction algorithm using multi-hop clusters for wireless sensor networks (WSNs. The hierarchical cluster structure has advantages in data fusion and aggregation. Energy consumption can be decreased by managing nodes with cluster heads. Backbone nodes, which are responsible for performing and managing multi-hop communication, can reduce the communication overhead such as control traffic and minimize the number of active nodes. Previous backbone construction algorithms, such as Hierarchical Cluster-based Data Dissemination (HCDD and Multicluster, Mobile, Multimedia radio network (MMM, consume energy quickly. They are designed without regard to appropriate factors such as residual energy and degree (the number of connections or edges to other nodes of a node for WSNs. Thus, the network is quickly disconnected or has to reconstruct a backbone. We propose a distributed algorithm to create a stable backbone by selecting the nodes with higher energy or degree as the cluster heads. This increases the overall network lifetime. Moreover, the proposed method balances energy consumption by distributing the traffic load among nodes around the cluster head. In the simulation, the proposed scheme outperforms previous clustering schemes in terms of the average and the standard deviation of residual energy or degree of backbone nodes, the average residual energy of backbone nodes after disseminating the sensed data, and the network lifetime.

  9. Reliable and Efficient Communications in Wireless Sensor Networks

    International Nuclear Information System (INIS)

    Abdelhakim, M.M.

    2014-01-01

    , and has shown to be optimal from the information theory point of view. Next, we observe that: while simplifying the routing process, a major limitation with SENMA is that data transmission is limited by the physical speed of the mobile access points (MAs) and the length of their trajectory, resulting in low throughput and large delay. To solve this problem, we propose a novel mobile access coordinated wireless sensor network (MC-WSN) architecture. The proposed MC-WSN can provide reliable and time-sensitive information exchange through hop number control, which is achieved by active network development and topology design. We discuss the optimal topology design for MC-WSN such that the average number of hops between the source and its nearest sink is minimized, and analyze the performance of MC-WSN in terms of throughput, stability, delay, and energy efficiency by exploiting tools in information theory, queuing theory, and radio energy dissipation model. It is shown that MC-WSN achieves much higher throughput and significantly lower delay and energy consumption than that of SENMA. Finally, motivated by the observation that the number of hops in data transmission has a direct impact on the network performance, we introduce the concept of the N-hop networks. Based on the N-hop concept, we propose a unified framework for wireless networks and discuss general network design criteria. The unified framework reflects the convergence of centralized and ad-hoc networks. It includes all exiting network models as special cases, and makes the analytical characterization of the network performance more tractable. Further study on N-hop networks will be conducted in our future research.

  10. A Hybrid Fuzzy Multi-hop Unequal Clustering Algorithm for Dense Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Shawkat K. Guirguis

    2017-01-01

    Full Text Available Clustering is carried out to explore and solve power dissipation problem in wireless sensor network (WSN. Hierarchical network architecture, based on clustering, can reduce energy consumption, balance traffic load, improve scalability, and prolong network lifetime. However, clustering faces two main challenges: hotspot problem and searching for effective techniques to perform clustering. This paper introduces a fuzzy unequal clustering technique for heterogeneous dense WSNs to determine both final cluster heads and their radii. Proposed fuzzy system blends three effective parameters together which are: the distance to the base station, the density of the cluster, and the deviation of the noders residual energy from the average network energy. Our objectives are achieving gain for network lifetime, energy distribution, and energy consumption. To evaluate the proposed algorithm, WSN clustering based routing algorithms are analyzed, simulated, and compared with obtained results. These protocols are LEACH, SEP, HEED, EEUC, and MOFCA.

  11. A multi-attribute vertical handoff scheme for heterogeneous wireless networks

    Directory of Open Access Journals (Sweden)

    JI Xiaolong

    2014-04-01

    Full Text Available In order to meet the user demand for different services as well as to mitigate the Ping-pong effect caused by vertical handoff for wireless network,a multi-attribute vertical handoff scheme for heterogeneous wireless network is proposed.In the algorithm,a fuzzy logic method is used to make pre-decision.The optimal handoff target network is selected by a cost function of network which uses an Analytic Hierarchy Process to calculate the weights of SNR,delay,cost and user preference in different business scenarios.Simulation is performed in the environment which is overlapped by WiMAX and UMTS networks.Results show that the proposed approach can effectively reduce the number of handoff and power consumption in a condition to satisfy the user needs.

  12. Flexible quality of service model for wireless body area sensor networks.

    Science.gov (United States)

    Liao, Yangzhe; Leeson, Mark S; Higgins, Matthew D

    2016-03-01

    Wireless body area sensor networks (WBASNs) are becoming an increasingly significant breakthrough technology for smart healthcare systems, enabling improved clinical decision-making in daily medical care. Recently, radio frequency ultra-wideband technology has developed substantially for physiological signal monitoring due to its advantages such as low-power consumption, high transmission data rate, and miniature antenna size. Applications of future ubiquitous healthcare systems offer the prospect of collecting human vital signs, early detection of abnormal medical conditions, real-time healthcare data transmission and remote telemedicine support. However, due to the technical constraints of sensor batteries, the supply of power is a major bottleneck for healthcare system design. Moreover, medium access control (MAC) needs to support reliable transmission links that allow sensors to transmit data safely and stably. In this Letter, the authors provide a flexible quality of service model for ad hoc networks that can support fast data transmission, adaptive schedule MAC control, and energy efficient ubiquitous WBASN networks. Results show that the proposed multi-hop communication ad hoc network model can balance information packet collisions and power consumption. Additionally, wireless communications link in WBASNs can effectively overcome multi-user interference and offer high transmission data rates for healthcare systems.

  13. Energy Efficient In-network RFID Data Filtering Scheme in Wireless Sensor Networks

    Science.gov (United States)

    Bashir, Ali Kashif; Lim, Se-Jung; Hussain, Chauhdary Sajjad; Park, Myong-Soon

    2011-01-01

    RFID (Radio frequency identification) and wireless sensor networks are backbone technologies for pervasive environments. In integration of RFID and WSN, RFID data uses WSN protocols for multi-hop communications. Energy is a critical issue in WSNs; however, RFID data contains a lot of duplication. These duplications can be eliminated at the base station, but unnecessary transmissions of duplicate data within the network still occurs, which consumes nodes’ energy and affects network lifetime. In this paper, we propose an in-network RFID data filtering scheme that efficiently eliminates the duplicate data. For this we use a clustering mechanism where cluster heads eliminate duplicate data and forward filtered data towards the base station. Simulation results prove that our approach saves considerable amounts of energy in terms of communication and computational cost, compared to existing filtering schemes. PMID:22163999

  14. Energy Efficient In-network RFID Data Filtering Scheme in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Myong-Soon Park

    2011-07-01

    Full Text Available RFID (Radio frequency identification and wireless sensor networks are backbone technologies for pervasive environments. In integration of RFID and WSN, RFID data uses WSN protocols for multi-hop communications. Energy is a critical issue in WSNs; however, RFID data contains a lot of duplication. These duplications can be eliminated at the base station, but unnecessary transmissions of duplicate data within the network still occurs, which consumes nodes’ energy and affects network lifetime. In this paper, we propose an in-network RFID data filtering scheme that efficiently eliminates the duplicate data. For this we use a clustering mechanism where cluster heads eliminate duplicate data and forward filtered data towards the base station. Simulation results prove that our approach saves considerable amounts of energy in terms of communication and computational cost, compared to existing filtering schemes.

  15. Exploring Relay Cooperation for Secure and Reliable Transmission in Two-HopWireless Networks

    Directory of Open Access Journals (Sweden)

    Yulong Shen

    2014-03-01

    Full Text Available This work considers the problem of secure and reliable information transmission via relay cooperation in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While previous work on this problem mainly studied infinite networks and their asymptotic behavior and scaling law results, this papers focuses on a more practical network with finite number of system nodes and explores the corresponding exact result on the number of eavesdroppers one network can tolerate to ensure desired secrecy and reliability. We first study the scenario where path-loss is equal between all pairs of nodes and consider two transmission protocols there, one adopts an optimal but complex relay selection process with less load balance capacity while the other adopts a random but simple relay selection process with good load balance capacity. Theoretical analysis and numerical results are then provided to determine the maximum number of eavesdroppers one network can tolerate to ensure a desired performance in terms of the secrecy outage probability and transmission outage probability. We further extend our study to the more general scenario where path-loss between each pair of nodes also depends on the distance between them, for which a new transmission protocol with both preferable relay selection and good load balance as well as the corresponding theoretical analysis and numerical results are presented.

  16. Analysis and Testing of Mobile Wireless Networks

    Science.gov (United States)

    Alena, Richard; Evenson, Darin; Rundquist, Victor; Clancy, Daniel (Technical Monitor)

    2002-01-01

    Wireless networks are being used to connect mobile computing elements in more applications as the technology matures. There are now many products (such as 802.11 and 802.11b) which ran in the ISM frequency band and comply with wireless network standards. They are being used increasingly to link mobile Intranet into Wired networks. Standard methods of analyzing and testing their performance and compatibility are needed to determine the limits of the technology. This paper presents analytical and experimental methods of determining network throughput, range and coverage, and interference sources. Both radio frequency (BE) domain and network domain analysis have been applied to determine wireless network throughput and range in the outdoor environment- Comparison of field test data taken under optimal conditions, with performance predicted from RF analysis, yielded quantitative results applicable to future designs. Layering multiple wireless network- sooners can increase performance. Wireless network components can be set to different radio frequency-hopping sequences or spreading functions, allowing more than one sooner to coexist. Therefore, we ran multiple 802.11-compliant systems concurrently in the same geographical area to determine interference effects and scalability, The results can be used to design of more robust networks which have multiple layers of wireless data communication paths and provide increased throughput overall.

  17. Energy and Data Throughput for Asymmetric Inter-Session Network Coding

    DEFF Research Database (Denmark)

    Paramanathan, Achuthan; Heide, Janus; Pahlevani, Peyman

    2012-01-01

    on commercial platforms. The outcome of this paper confirms the analytical expression, and the results shows that even with a large asymmetric data rate there is a gain in terms of energy consumption and throughput when network coding is applied in compare to the case when network coding is not applied.......In this paper we investigate the impact of asymmetric traffic patterns on the energy consumption and throughput in a wireless multi hop network. Network coding is a novel technique for communication systems and a viable solution for wireless multi hop networks. State-of-the-art research is mainly...

  18. Dynamic channel assignment scheme for multi-radio wireless mesh networks

    CSIR Research Space (South Africa)

    Kareem, TR

    2008-09-01

    Full Text Available This paper investigates the challenges involve in designing a dynamic channel assignment (DCA) scheme for wireless mesh networks, particularly for multi-radio systems. It motivates the need for fast switching and process coordination modules...

  19. One Kind of Routing Algorithm Modified in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Wei Ni Ni

    2016-01-01

    Full Text Available The wireless sensor networks are the emerging next generation sensor networks, Routing technology is the wireless sensor network communication layer of the core technology. To build reliable paths in wireless sensor networks, we can consider two ways: providing multiple paths utilizing the redundancy to assure the communication reliability or constructing transmission reliability mechanism to assure the reliability of every hop. Braid multipath algorithm and ReInforM routing algorithm are the realizations of these two mechanisms. After the analysis of these two algorithms, this paper proposes a ReInforM routing algorithm based braid multipath routing algorithm.

  20. Replica Node Detection Using Enhanced Single Hop Detection with Clonal Selection Algorithm in Mobile Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    L. S. Sindhuja

    2016-01-01

    Full Text Available Security of Mobile Wireless Sensor Networks is a vital challenge as the sensor nodes are deployed in unattended environment and they are prone to various attacks. One among them is the node replication attack. In this, the physically insecure nodes are acquired by the adversary to clone them by having the same identity of the captured node, and the adversary deploys an unpredictable number of replicas throughout the network. Hence replica node detection is an important challenge in Mobile Wireless Sensor Networks. Various replica node detection techniques have been proposed to detect these replica nodes. These methods incur control overheads and the detection accuracy is low when the replica is selected as a witness node. This paper proposes to solve these issues by enhancing the Single Hop Detection (SHD method using the Clonal Selection algorithm to detect the clones by selecting the appropriate witness nodes. The advantages of the proposed method include (i increase in the detection ratio, (ii decrease in the control overhead, and (iii increase in throughput. The performance of the proposed work is measured using detection ratio, false detection ratio, packet delivery ratio, average delay, control overheads, and throughput. The implementation is done using ns-2 to exhibit the actuality of the proposed work.

  1. The distributed wireless gathering problem

    NARCIS (Netherlands)

    Bonifaci, V.; Korteweg, P.; Marchetti Spaccamela, A.; Stougie, L.

    2011-01-01

    We address the problem of data gathering in a wireless network using multi-hop communication; our main goal is the analysis of simple algorithms suitable for implementation in realistic scenarios. We study the performance of distributed algorithms, which do not use any form of local coordination,

  2. Advanced Communication for Wireless Sensor Networks

    Science.gov (United States)

    2016-08-22

    strategies that could be used to increase the single-hop transmission range of a wireless sensor network, increase energy efficiency (improve battery...substance placed within the reach of the network. Sensor measurements were quantized to save energy and bandwidth during transmission of the...the problem of assigning transmission powers to every node in order to maintain connectivity while minimizing the energy consumption of the whole

  3. Mobile Device Based Dynamic Key Management Protocols for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chin-Ling Chen

    2015-01-01

    Full Text Available In recent years, wireless sensor network (WSN applications have tended to transmit data hop by hop, from sensor nodes through cluster nodes to the base station. As a result, users must collect data from the base station. This study considers two different applications: hop by hop transmission of data from cluster nodes to the base station and the direct access to cluster nodes data by mobile users via mobile devices. Due to the hardware limitations of WSNs, some low-cost operations such as symmetric cryptographic algorithms and hash functions are used to implement a dynamic key management. The session key can be updated to prevent threats of attack from each communication. With these methods, the data gathered in wireless sensor networks can be more securely communicated. Moreover, the proposed scheme is analyzed and compared with related schemes. In addition, an NS2 simulation is developed in which the experimental results show that the designed communication protocol is workable.

  4. Extending lifetime of wireless sensor networks using multi-sensor ...

    Indian Academy of Sciences (India)

    SOUMITRA DAS

    In this paper a multi-sensor data fusion approach for wireless sensor network based on bayesian methods and ant colony ... niques for efficiently routing the data from source to the BS ... Literature review ... efficient scheduling and lot more to increase the lifetime of ... Nature-inspired algorithms such as ACO algorithms have.

  5. Modelling the guaranteed QoS for wireless sensor networks: a network calculus approach

    Directory of Open Access Journals (Sweden)

    Yu Jianping

    2011-01-01

    Full Text Available Abstract Wireless sensor networks (WSNs became one of the high technology domains during the last 10 years. Real-time applications for them make it necessary to provide the guaranteed quality of service (QoS. The main contributions of this article are a system skeleton and a guaranteed QoS model that are suitable for the WSNs. To do it, we develop a sensor node model based on virtual buffer sharing and present a two-layer scheduling model using the network calculus. With the system skeleton, we develop a guaranteed QoS model, such as the upper bounds on buffer queue length/delay/effective bandwidth, and single-hop/multi-hops delay/jitter/effective bandwidth. Numerical results show the system skeleton and the guaranteed QoS model are scalable for different types of flows, including the self-similar traffic flows, and the parameters of flow regulators and service curves of sensor nodes affect them. Our proposal leads to buffer dimensioning, guaranteed QoS support and control in the WSNs.

  6. Multi-Channel Multi-Radio Using 802.11 Based Media Access for Sink Nodes in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Kok-Keong Loo

    2011-05-01

    Full Text Available The next generation surveillance and multimedia systems will become increasingly deployed as wireless sensor networks in order to monitor parks, public places and for business usage. The convergence of data and telecommunication over IP-based networks has paved the way for wireless networks. Functions are becoming more intertwined by the compelling force of innovation and technology. For example, many closed-circuit TV premises surveillance systems now rely on transmitting their images and data over IP networks instead of standalone video circuits. These systems will increase their reliability in the future on wireless networks and on IEEE 802.11 networks. However, due to limited non-overlapping channels, delay, and congestion there will be problems at sink nodes. In this paper we provide necessary conditions to verify the feasibility of round robin technique in these networks at the sink nodes by using a technique to regulate multi-radio multichannel assignment. We demonstrate through simulations that dynamic channel assignment scheme using multi-radio, and multichannel configuration at a single sink node can perform close to optimal on the average while multiple sink node assignment also performs well. The methods proposed in this paper can be a valuable tool for network designers in planning network deployment and for optimizing different performance objectives.

  7. Multi-channel multi-radio using 802.11 based media access for sink nodes in wireless sensor networks.

    Science.gov (United States)

    Campbell, Carlene E-A; Khan, Shafiullah; Singh, Dhananjay; Loo, Kok-Keong

    2011-01-01

    The next generation surveillance and multimedia systems will become increasingly deployed as wireless sensor networks in order to monitor parks, public places and for business usage. The convergence of data and telecommunication over IP-based networks has paved the way for wireless networks. Functions are becoming more intertwined by the compelling force of innovation and technology. For example, many closed-circuit TV premises surveillance systems now rely on transmitting their images and data over IP networks instead of standalone video circuits. These systems will increase their reliability in the future on wireless networks and on IEEE 802.11 networks. However, due to limited non-overlapping channels, delay, and congestion there will be problems at sink nodes. In this paper we provide necessary conditions to verify the feasibility of round robin technique in these networks at the sink nodes by using a technique to regulate multi-radio multichannel assignment. We demonstrate through simulations that dynamic channel assignment scheme using multi-radio, and multichannel configuration at a single sink node can perform close to optimal on the average while multiple sink node assignment also performs well. The methods proposed in this paper can be a valuable tool for network designers in planning network deployment and for optimizing different performance objectives.

  8. Cluster-based Data Gathering in Long-Strip Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    FANG, W.

    2012-02-01

    Full Text Available This paper investigates a special class of wireless sensor networks that are different from traditional ones in that the sensor nodes in this class of networks are deployed along narrowly elongated geographical areas and form a long-strip topology. According to hardware capabilities of current sensor nodes, a cluster-based protocol for reliable and efficient data gathering in long-strip wireless sensor networks (LSWSN is proposed. A well-distributed cluster-based architecture is first formed in the whole network through contention-based cluster head election. Cluster heads are responsible for coordination among the nodes within their clusters and aggregation of their sensory data, as well as transmission the data to the sink node on behalf of their own clusters. The intra-cluster coordination is based on the traditional TDMA schedule, in which the inter-cluster interference caused by the border nodes is solved by the multi-channel communication technique. The cluster reporting is based on the CSMA contention, in which a connected overlay network is formed by relay nodes to forward the data from the cluster heads through multi-hops to the sink node. The relay nodes are non-uniformly deployed to resolve the energy-hole problem which is extremely serious in the LSWSN. Extensive simulation results illuminate the distinguished performance of the proposed protocol.

  9. An Ultraviolet Optical Wireless Sensor Network in Multi-scattering Channels

    Science.gov (United States)

    Kedar, Debbie; Arnon, Shlomi

    2006-10-01

    Networks of wirelessly communicating sensors are a promising technology for future data-gathering systems in both civilian and military applications including medical and environmental monitoring and surveillance, home security and industry. Optical wireless communication is a potential solution for the links, particularly thanks to the small and lightweight hardware and low power consumption. A noteworthy feature of optical wireless communication at ultraviolet wavelengths is that scattering of radiation by atmospheric particles is significant, so that the backscattering of light by these particles can function as a vehicle of communication as if numerous tiny reflecting mirrors were placed in the atmosphere. Also, almost no solar radiation penetrates the atmosphere in this spectral band, which is hence called the solar blind ultraviolet spectrum, so that very large field-of-view receivers can be used. In this paper we present a model of a non-line-of-sight (NLOS) optical wireless sensor network operating in the solar blind ultraviolet spectrum. The system feasibility is evaluated and found to facilitate miniature operational sensor networks. The problem of multi-access interference is addressed and the possibility of overcoming it using WDM diversity methods is investigated.

  10. Wireless Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Hong-Chuan Yang

    2007-01-01

    Full Text Available We study the energy-efficient configuration of multihop paths with automatic repeat request (ARQ mechanism in wireless ad hoc networks. We adopt a cross-layer design approach and take both the quality of each radio hop and the battery capacity of each transmitting node into consideration. Under certain constraints on the maximum tolerable transmission delay and the required packet delivery ratio, we solve optimization problems to jointly schedule the transmitting power of each transmitting node and the retransmission limit over each hop. Numerical results demonstrate that the path configuration methods can either significantly reduce the average energy consumption per packet delivery or considerably extend the average lifetime of the multihop route.

  11. Scalable power selection method for wireless mesh networks

    CSIR Research Space (South Africa)

    Olwal, TO

    2009-01-01

    Full Text Available This paper addresses the problem of a scalable dynamic power control (SDPC) for wireless mesh networks (WMNs) based on IEEE 802.11 standards. An SDPC model that accounts for architectural complexities witnessed in multiple radios and hops...

  12. A Stochastic Geometry Model for Multi-hop Highway Vehicular Communication

    KAUST Repository

    Farooq, Muhammad Junaid; Elsawy, Hesham; Alouini, Mohamed-Slim

    2015-01-01

    dissemination. This paper exploits stochastic geometry to develop a tractable and accurate modeling framework to characterize the multi-hop transmissions for vehicular networks in a multi-lane highway setup. In particular, we study the tradeoffs between per

  13. Testing a Firefly-Inspired Synchronization Algorithm in a Complex Wireless Sensor Network.

    Science.gov (United States)

    Hao, Chuangbo; Song, Ping; Yang, Cheng; Liu, Xiongjun

    2017-03-08

    Data acquisition is the foundation of soft sensor and data fusion. Distributed data acquisition and its synchronization are the important technologies to ensure the accuracy of soft sensors. As a research topic in bionic science, the firefly-inspired algorithm has attracted widespread attention as a new synchronization method. Aiming at reducing the design difficulty of firefly-inspired synchronization algorithms for Wireless Sensor Networks (WSNs) with complex topologies, this paper presents a firefly-inspired synchronization algorithm based on a multiscale discrete phase model that can optimize the performance tradeoff between the network scalability and synchronization capability in a complex wireless sensor network. The synchronization process can be regarded as a Markov state transition, which ensures the stability of this algorithm. Compared with the Miroll and Steven model and Reachback Firefly Algorithm, the proposed algorithm obtains better stability and performance. Finally, its practicality has been experimentally confirmed using 30 nodes in a real multi-hop topology with low quality links.

  14. Reliability Improved Cooperative Communication over Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zhuangbin Chen

    2017-10-01

    Full Text Available With the development of smart devices and connection technologies, Wireless Sensor Networks (WSNs are becoming increasingly intelligent. New or special functions can be obtained by receiving new versions of program codes to upgrade their software systems, forming the so-called smart Internet of Things (IoT. Due to the lossy property of wireless channels, data collection in WSNs still suffers from a long delay, high energy consumption, and many retransmissions. Thanks to wireless software-defined networks (WSDNs, software in sensors can now be updated to help them transmit data cooperatively, thereby achieving more reliable communication. In this paper, a Reliability Improved Cooperative Communication (RICC data collection scheme is proposed to improve the reliability of random-network-coding-based cooperative communications in multi-hop relay WSNs without reducing the network lifetime. In WSNs, sensors in different positions can have different numbers of packets to handle, resulting in the unbalanced energy consumption of the network. In particular, nodes in non-hotspot areas have up to 90% of their original energy remaining when the network dies. To efficiently use the residual energy, in RICC, high data transmission power is adopted in non-hotspot areas to achieve a higher reliability at the cost of large energy consumption, and relatively low transmission power is adopted in hotspot areas to maintain the long network lifetime. Therefore, high reliability and a long network lifetime can be obtained simultaneously. The simulation results show that compared with other scheme, RICC can reduce the end-to-end Message Fail delivering Ratio (MFR by 59.4%–62.8% under the same lifetime with a more balanced energy utilization.

  15. On the Performance of Millimeter Wave-based RF-FSO Multi-hop and Mesh Networks

    KAUST Repository

    Makki, Behrooz

    2017-09-22

    This paper studies the performance of multi-hop and mesh networks composed of millimeter wave-based radio frequency (RF) and free-space optical (FSO) links. The results are obtained in cases with and without hybrid automatic repeat request (HARQ). Using the central limit theorem as well as other state-of-the-art approximation schemes, we derive closed-form expressions for the networks’ outage probability and ergodic achievable rates. We also evaluate the effect of various parameters such as power amplifiers efficiency, number of antennas as well as different coherence times of the RF and the FSO links on the system performance. Finally, we determine the minimum number of the transmit antennas in the RF link such that the same rate is supported in the RF- and the FSO-based hops. The results show the efficiency of the RF-FSO setups in different conditions. Moreover, HARQ can effectively improve the outage probability/energy efficiency, and compensate for the effect of hardware impairments in RF-FSO networks. For common parameter settings of the RF-FSO dual-hop networks, outage probability of 10−4 and code rate of 3 nats-per-channel-use, the implementation of HARQ with a maximum of 2 and 3 retransmissions reduces the required power, compared to cases with open-loop communication, by 13 and 17 dB, respectively.

  16. Buffer sizing for multi-hop networks

    KAUST Repository

    Shihada, Basem

    2014-01-28

    A cumulative buffer may be defined for an interference domain in a wireless mesh network and distributed among nodes in the network to maintain or improve capacity utilization of network resources in the interference domain without increasing packet queuing delay times. When an interference domain having communications links sharing resources in a network is identified, a cumulative buffer size is calculated. The cumulative buffer may be distributed among buffers in each node of the interference domain according to a simple division or according to a cost function taking into account a distance of the communications link from the source and destination. The network may be monitored and the cumulative buffer size recalculated and redistributed when the network conditions change.

  17. Fuzzy-Logic Based Distributed Energy-Efficient Clustering Algorithm for Wireless Sensor Networks.

    Science.gov (United States)

    Zhang, Ying; Wang, Jun; Han, Dezhi; Wu, Huafeng; Zhou, Rundong

    2017-07-03

    Due to the high-energy efficiency and scalability, the clustering routing algorithm has been widely used in wireless sensor networks (WSNs). In order to gather information more efficiently, each sensor node transmits data to its Cluster Head (CH) to which it belongs, by multi-hop communication. However, the multi-hop communication in the cluster brings the problem of excessive energy consumption of the relay nodes which are closer to the CH. These nodes' energy will be consumed more quickly than the farther nodes, which brings the negative influence on load balance for the whole networks. Therefore, we propose an energy-efficient distributed clustering algorithm based on fuzzy approach with non-uniform distribution (EEDCF). During CHs' election, we take nodes' energies, nodes' degree and neighbor nodes' residual energies into consideration as the input parameters. In addition, we take advantage of Takagi, Sugeno and Kang (TSK) fuzzy model instead of traditional method as our inference system to guarantee the quantitative analysis more reasonable. In our scheme, each sensor node calculates the probability of being as CH with the help of fuzzy inference system in a distributed way. The experimental results indicate EEDCF algorithm is better than some current representative methods in aspects of data transmission, energy consumption and lifetime of networks.

  18. A Uniform Energy Consumption Algorithm for Wireless Sensor and Actuator Networks Based on Dynamic Polling Point Selection

    Science.gov (United States)

    Li, Shuo; Peng, Jun; Liu, Weirong; Zhu, Zhengfa; Lin, Kuo-Chi

    2014-01-01

    Recent research has indicated that using the mobility of the actuator in wireless sensor and actuator networks (WSANs) to achieve mobile data collection can greatly increase the sensor network lifetime. However, mobile data collection may result in unacceptable collection delays in the network if the path of the actuator is too long. Because real-time network applications require meeting data collection delay constraints, planning the path of the actuator is a very important issue to balance the prolongation of the network lifetime and the reduction of the data collection delay. In this paper, a multi-hop routing mobile data collection algorithm is proposed based on dynamic polling point selection with delay constraints to address this issue. The algorithm can actively update the selection of the actuator's polling points according to the sensor nodes' residual energies and their locations while also considering the collection delay constraint. It also dynamically constructs the multi-hop routing trees rooted by these polling points to balance the sensor node energy consumption and the extension of the network lifetime. The effectiveness of the algorithm is validated by simulation. PMID:24451455

  19. Effective Data Acquisition Protocol for Multi-Hop Heterogeneous Wireless Sensor Networks Using Compressive Sensing

    Directory of Open Access Journals (Sweden)

    Ahmed M. Khedr

    2015-10-01

    Full Text Available In designing wireless sensor networks (WSNs, it is important to reduce energy dissipation and prolong network lifetime. Clustering of nodes is one of the most effective approaches for conserving energy in WSNs. Cluster formation protocols generally consider the heterogeneity of sensor nodes in terms of energy difference of nodes but ignore the different transmission ranges of them. In this paper, we propose an effective data acquisition clustered protocol using compressive sensing (EDACP-CS for heterogeneous WSNs that aims to conserve the energy of sensor nodes in the presence of energy and transmission range heterogeneity. In EDACP-CS, cluster heads are selected based on the distance from the base station and sensor residual energy. Simulation results show that our protocol offers a much better performance than the existing protocols in terms of energy consumption, stability, network lifetime, and throughput.

  20. A framework for multi-object tracking over distributed wireless camera networks

    Science.gov (United States)

    Gau, Victor; Hwang, Jenq-Neng

    2010-07-01

    In this paper, we propose a unified framework targeting at two important issues in a distributed wireless camera network, i.e., object tracking and network communication, to achieve reliable multi-object tracking over distributed wireless camera networks. In the object tracking part, we propose a fully automated approach for tracking of multiple objects across multiple cameras with overlapping and non-overlapping field of views without initial training. To effectively exchange the tracking information among the distributed cameras, we proposed an idle probability based broadcasting method, iPro, which adaptively adjusts the broadcast probability to improve the broadcast effectiveness in a dense saturated camera network. Experimental results for the multi-object tracking demonstrate the promising performance of our approach on real video sequences for cameras with overlapping and non-overlapping views. The modeling and ns-2 simulation results show that iPro almost approaches the theoretical performance upper bound if cameras are within each other's transmission range. In more general scenarios, e.g., in case of hidden node problems, the simulation results show that iPro significantly outperforms standard IEEE 802.11, especially when the number of competing nodes increases.

  1. Location-Aware Dynamic Session-Key Management for Grid-Based Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    I-Hsien Lin

    2010-08-01

    Full Text Available Security is a critical issue for sensor networks used in hostile environments. When wireless sensor nodes in a wireless sensor network are distributed in an insecure hostile environment, the sensor nodes must be protected: a secret key must be used to protect the nodes transmitting messages. If the nodes are not protected and become compromised, many types of attacks against the network may result. Such is the case with existing schemes, which are vulnerable to attacks because they mostly provide a hop-by-hop paradigm, which is insufficient to defend against known attacks. We propose a location-aware dynamic session-key management protocol for grid-based wireless sensor networks. The proposed protocol improves the security of a secret key. The proposed scheme also includes a key that is dynamically updated. This dynamic update can lower the probability of the key being guessed correctly. Thus currently known attacks can be defended. By utilizing the local information, the proposed scheme can also limit the flooding region in order to reduce the energy that is consumed in discovering routing paths.

  2. Cascading Multi-Hop Reservation and Transmission in Underwater Acoustic Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jae-Won Lee

    2014-10-01

    Full Text Available The long propagation delay in an underwater acoustic channel makes designing an underwater media access control (MAC protocol more challenging. In particular, handshaking-based MAC protocols widely used in terrestrial radio channels have been known to be inappropriate in underwater acoustic channels, because of the inordinately large latency involved in exchanging control packets. Furthermore, in the case of multi-hop relaying in a hop-by-hop handshaking manner, the end-to-end delay significantly increases. In this paper, we propose a new MAC protocol named cascading multi-hop reservation and transmission (CMRT. In CMRT, intermediate nodes between a source and a destination may start handshaking in advance for the next-hop relaying before handshaking for the previous node is completed. By this concurrent relaying, control packet exchange and data delivery cascade down to the destination. In addition, to improve channel utilization, CMRT adopts a packet-train method where multiple data packets are sent together by handshaking once. Thus, CMRT reduces the time taken for control packet exchange and accordingly increases the throughput. The performance of CMRT is evaluated and compared with that of two conventional MAC protocols (multiple-access collision avoidance for underwater (MACA-U and MACA-U with packet trains (MACA-UPT. The results show that CMRT outperforms other MAC protocols in terms of both throughput and end-to-end delay.

  3. A Mixed Transmission Strategy to Achieve Energy Balancing in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Liu, Tong; Gu, Tao; Jin, Ning

    2017-01-01

    In this paper, we investigate the problem of energy balanced data collection in wireless sensor networks, aiming to balance energy consumption among all sensor nodes during the data propagation process. Energy balanced data collection can potentially save energy consumption and prolong network...... lifetime, and hence, it has many practical implications for sensor network design and deployment. The traditional hop-by-hop transmission model allows a sensor node to propagate its packets in a hop-by-hop manner toward the sink, resulting in poor energy balancing for the entire network. To address...... the problem, we apply a slice-based energy model, and divide the problem into inter-slice and intra-slice energy balancing problems. We then propose a probability-based strategy named inter-slice mixed transmission protocol and an intra-slice forwarding technique to address each of the problems. We propose...

  4. Green heterogeneous wireless networks

    CERN Document Server

    Ismail, Muhammad; Nee, Hans-Peter; Qaraqe, Khalid A; Serpedin, Erchin

    2016-01-01

    This book focuses on the emerging research topic "green (energy efficient) wireless networks" which has drawn huge attention recently from both academia and industry. This topic is highly motivated due to important environmental, financial, and quality-of-experience (QoE) considerations. Specifically, the high energy consumption of the wireless networks manifests in approximately 2% of all CO2 emissions worldwide. This book presents the authors’ visions and solutions for deployment of energy efficient (green) heterogeneous wireless communication networks. The book consists of three major parts. The first part provides an introduction to the "green networks" concept, the second part targets the green multi-homing resource allocation problem, and the third chapter presents a novel deployment of device-to-device (D2D) communications and its successful integration in Heterogeneous Networks (HetNets). The book is novel in that it specifically targets green networking in a heterogeneous wireless medium, which re...

  5. DESIGN OF CAUCUS MEDIUM ACCESS CONTROL (C-MAC PROTOCOL FOR WIRELESS SENSOR NETWORKS IN SMART GRIDS

    Directory of Open Access Journals (Sweden)

    JEETU SHARMA

    2017-10-01

    Full Text Available A Caucus-based medium access control protocol (C-MAC is proposed to reduce the end to end delay and battery consumption of the sensor nodes deployed in the monitoring of various smart grid regions, such as substation, pole and wires, perimeter security, real time and non-real-time monitoring using wireless sensor networks. The objective is to prolong the network lifetime and to reduce the end to end delay by mitigating the energy-hole problem and by eliminating bottlenecks significantly by using caucus based efficient synchronization techniques in multi-hop square grid topology of the wireless sensor networks (WSNs. The protocol self-reliantly and adaptively schedules node’s wake-up times, decreases idle listening and collisions, increases network throughput, and extends network lifetime. It induces a low duty cycle for adjusting wake-up times of sensor nodes. The appropriate selection of active and sleep time slots and next hop relay nodes are proposed to minimize the data transmission latency and to reduce battery consumption to increase the network lifetime. The uniform and synchronized transmission of the data packets is of prime importance to improve the network performance. Simulation results justify that the proposed C-MAC protocol increases the network lifetime, successful data transmission ratio along-with the reduction in end to end delay. The objective of this paper is to envisage benefits and utilization of C-MAC protocol for WSNs deployed in smart grids and to draw the attention of researchers in this area.

  6. Bio-inspired energy and channel management in distributed wireless multi-radio networks

    CSIR Research Space (South Africa)

    Olwal, TO

    2014-06-01

    Full Text Available In the recent past, research in the next generation wireless heterogeneous broadband networks has favoured the design of multi-radio interface over the single radio interface architectures in order to support desirable features such as a self...

  7. The Distribution of Minimum of Ratios of Two Random Variables and Its Application in Analysis of Multi-hop Systems

    Directory of Open Access Journals (Sweden)

    A. Stankovic

    2012-12-01

    Full Text Available The distributions of random variables are of interest in many areas of science. In this paper, ascertaining on the importance of multi-hop transmission in contemporary wireless communications systems operating over fading channels in the presence of cochannel interference, the probability density functions (PDFs of minimum of arbitrary number of ratios of Rayleigh, Rician, Nakagami-m, Weibull and α-µ random variables are derived. These expressions can be used to study the outage probability as an important multi-hop system performance measure. Various numerical results complement the proposed mathematical analysis.

  8. Renormalization group theory for percolation in time-varying networks.

    Science.gov (United States)

    Karschau, Jens; Zimmerling, Marco; Friedrich, Benjamin M

    2018-05-22

    Motivated by multi-hop communication in unreliable wireless networks, we present a percolation theory for time-varying networks. We develop a renormalization group theory for a prototypical network on a regular grid, where individual links switch stochastically between active and inactive states. The question whether a given source node can communicate with a destination node along paths of active links is equivalent to a percolation problem. Our theory maps the temporal existence of multi-hop paths on an effective two-state Markov process. We show analytically how this Markov process converges towards a memoryless Bernoulli process as the hop distance between source and destination node increases. Our work extends classical percolation theory to the dynamic case and elucidates temporal correlations of message losses. Quantification of temporal correlations has implications for the design of wireless communication and control protocols, e.g. in cyber-physical systems such as self-organized swarms of drones or smart traffic networks.

  9. MIMO wireless networks channels, techniques and standards for multi-antenna, multi-user and multi-cell systems

    CERN Document Server

    Clerckx, Bruno

    2013-01-01

    This book is unique in presenting channels, techniques and standards for the next generation of MIMO wireless networks. Through a unified framework, it emphasizes how propagation mechanisms impact the system performance under realistic power constraints. Combining a solid mathematical analysis with a physical and intuitive approach to space-time signal processing, the book progressively derives innovative designs for space-time coding and precoding as well as multi-user and multi-cell techniques, taking into consideration that MIMO channels are often far from ideal. Reflecting developments

  10. Two Tier Cluster Based Data Aggregation (TTCDA) in Wireless Sensor Network

    DEFF Research Database (Denmark)

    Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

    2012-01-01

    Wireless Sensor Network (WSN) often used for monitoring and control applications where sensor nodes collect data and send it to the sink. Most of the nodes consume their energy in transmission of data packets without aggregation to sink, which may be located at single or multi hop distance....... The direct transmission of data packets to the sink from nodes in the network causes increased communication costs in terms of energy, average delay and network lifetime. In this context, the data aggregation techniques minimize the communication cost with efficient bandwidth utilization by decreasing...... the packet count reached at the sink. Here, we propose Two Tier Cluster based Data Aggregation (TTCDA) algorithm for the randomly distributed nodes to minimize computation and communication cost. The TTCDA is energy and bandwidth efficient since it reduces the transmission of the number of packets...

  11. Dense Clustered Multi-Channel Wireless Sensor Cloud

    Directory of Open Access Journals (Sweden)

    Sivaramakrishnan Sivakumar

    2015-08-01

    Full Text Available Dense Wireless Sensor Network Clouds have an inherent issue of latency and packet drops with regards to data collection. Though there is extensive literature that tries to address these issues through either scheduling, channel contention or a combination of the two, the problem still largely exists. In this paper, a Clustered Multi-Channel Scheduling Protocol (CMSP is designed that creates a Voronoi partition of a dense network. Each partition is assigned a channel, and a scheduling scheme is adopted to collect data within the Voronoi partitions. This scheme collects data from the partitions concurrently and then passes it to the base station. CMSP is compared using simulation with other multi-channel protocols like Tree-based Multi-Channel, Multi-Channel MAC and Multi-frequency Media Access Control for wireless sensor networks. Results indicate CMSP has higher throughput and data delivery ratio at a lower power consumption due to network partitioning and hierarchical scheduling that minimizes load on the network.

  12. Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mann Raminder P

    2005-01-01

    Full Text Available Wireless ad hoc sensor networks differ from wireless ad hoc networks from the following perspectives: low energy, lightweight routing protocols, and adaptive communication patterns. This paper proposes an energy-aware routing protocol (EARP suitable for ad hoc wireless sensor networks and presents an analysis for its energy consumption in various phases of route discovery and maintenance. Based on the energy consumption associated with route request processing, EARP advocates the minimization of route requests by allocating dynamic route expiry times. This paper introduces a unique mechanism for estimation of route expiry time based on the probability of route validity, which is a function of time, number of hops, and mobility parameters. In contrast to AODV, EARP reduces the repeated flooding of route requests by maintaining valid routes for longer durations.

  13. Exploiting Multi-user Diversity and Multi-hop Diversity in Dual-hop Broadcast Channels

    KAUST Repository

    Zafar, Ammar

    2013-05-21

    We propose joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together. To achieve this objective, the first and second hops are scheduled opportunistically based on the channel state information. The joint scheduling problem is formulated as maximizing the weighted sum of the long term achievable rates of the users under a stability constraint, which means that in the long term the rate received by the relay should equal the rate transmitted by it, in addition to power constraints. We show that this problem is equivalent to a single-hop broadcast channel by treating the source as a virtual user with an optimal weight that maintains the stability constraint. We show how to obtain the source weight either off-line based on channel statistics or on real-time based on channel measurements. Furthermore, we consider special cases including the maximum sum-rate scheduler and the proportional fair scheduler. We also show how to extend the scheme into one that allows multiple user scheduling via superposition coding with successive decoding. Numerical results demonstrate that our proposed joint scheduling scheme enlarges the rate region as compared to scheduling schemes that exploit the diversity gains partially.

  14. Design and Analysis of a Data Fusion Scheme in Mobile Wireless Sensor Networks Based on Multi-Protocol Mobile Agents.

    Science.gov (United States)

    Wu, Chunxue; Wu, Wenliang; Wan, Caihua; Bekkering, Ernst; Xiong, Naixue

    2017-11-03

    Sensors are increasingly used in mobile environments with wireless network connections. Multiple sensor types measure distinct aspects of the same event. Their measurements are then combined to produce integrated, reliable results. As the number of sensors in networks increases, low energy requirements and changing network connections complicate event detection and measurement. We present a data fusion scheme for use in mobile wireless sensor networks with high energy efficiency and low network delays, that still produces reliable results. In the first phase, we used a network simulation where mobile agents dynamically select the next hop migration node based on the stability parameter of the link, and perform the data fusion at the migration node. Agents use the fusion results to decide if it should return the fusion results to the processing center or continue to collect more data. In the second phase. The feasibility of data fusion at the node level is confirmed by an experimental design where fused data from color sensors show near-identical results to actual physical temperatures. These results are potentially important for new large-scale sensor network applications.

  15. Multi-agent Negotiation Mechanisms for Statistical Target Classification in Wireless Multimedia Sensor Networks

    Science.gov (United States)

    Wang, Xue; Bi, Dao-wei; Ding, Liang; Wang, Sheng

    2007-01-01

    The recent availability of low cost and miniaturized hardware has allowed wireless sensor networks (WSNs) to retrieve audio and video data in real world applications, which has fostered the development of wireless multimedia sensor networks (WMSNs). Resource constraints and challenging multimedia data volume make development of efficient algorithms to perform in-network processing of multimedia contents imperative. This paper proposes solving problems in the domain of WMSNs from the perspective of multi-agent systems. The multi-agent framework enables flexible network configuration and efficient collaborative in-network processing. The focus is placed on target classification in WMSNs where audio information is retrieved by microphones. To deal with the uncertainties related to audio information retrieval, the statistical approaches of power spectral density estimates, principal component analysis and Gaussian process classification are employed. A multi-agent negotiation mechanism is specially developed to efficiently utilize limited resources and simultaneously enhance classification accuracy and reliability. The negotiation is composed of two phases, where an auction based approach is first exploited to allocate the classification task among the agents and then individual agent decisions are combined by the committee decision mechanism. Simulation experiments with real world data are conducted and the results show that the proposed statistical approaches and negotiation mechanism not only reduce memory and computation requirements in WMSNs but also significantly enhance classification accuracy and reliability. PMID:28903223

  16. Energy efficient medium access protocol for wireless medical body area sensor networks.

    Science.gov (United States)

    Omeni, O; Wong, A; Burdett, A J; Toumazou, C

    2008-12-01

    This paper presents a novel energy-efficient MAC Protocol designed specifically for wireless body area sensor networks (WBASN) focused towards pervasive healthcare applications. Wireless body area networks consist of wireless sensor nodes attached to the human body to monitor vital signs such as body temperature, activity or heart-rate. The network adopts a master-slave architecture, where the body-worn slave node periodically sends sensor readings to a central master node. Unlike traditional peer-to-peer wireless sensor networks, the nodes in this biomedical WBASN are not deployed in an ad hoc fashion. Joining a network is centrally managed and all communications are single-hop. To reduce energy consumption, all the sensor nodes are in standby or sleep mode until the centrally assigned time slot. Once a node has joined a network, there is no possibility of collision within a cluster as all communication is initiated by the central node and is addressed uniquely to a slave node. To avoid collisions with nearby transmitters, a clear channel assessment algorithm based on standard listen-before-transmit (LBT) is used. To handle time slot overlaps, the novel concept of a wakeup fallback time is introduced. Using single-hop communication and centrally controlled sleep/wakeup times leads to significant energy reductions for this application compared to more ldquoflexiblerdquo network MAC protocols such as 802.11 or Zigbee. As duty cycle is reduced, the overall power consumption approaches the standby power. The protocol is implemented in hardware as part of the Sensiumtrade system-on-chip WBASN ASIC, in a 0.13- mum CMOS process.

  17. On the hop count statistics for randomly deployed wireless sensor networks

    NARCIS (Netherlands)

    Dulman, S.O.; Rossi, M.; Havinga, Paul J.M.; Zorzi, M.

    2006-01-01

    In this paper we focus on exploiting the information provided by a generally accepted and largely ignored hypothesis (the random deployment of the nodes of an ad hoc or wireless sensor network) to design improved networking protocols. Specifically, we derive the relationship between the number of

  18. Handbook on theoretical and algorithmic aspects of sensor, ad hoc wireless, and peer-to-peer networks

    CERN Document Server

    Wu, Jie

    2005-01-01

    PrefaceAD HOC WIRELESS NETWORKSA Modular Cross Layer Architecture for Ad Hoc Networks, M. Conti, J. Crowcroft, G. Maselli, and G. TuriRouting Scalability in MANETs, J. Eriksson, S. Krishnamurthy and M. FaloutsosUniformly Distributed Algorithm for Virtual Backbone Routing in Ad Hoc Wireless Networks, D.S. KimMaximum Necessary Hop Count for Packet Routing in MANET, X. Chen and J. ShenEfficient Strategyproof Multicast in Selfish Wireless Networks, X.-Yang LiGeocasting in Ad Hoc and Sensor Networks, I. StojmenovicTopology Control for Ad hoc Networks: Present Solutions and Open Issues, C.-C. Shen a

  19. Multi-Channel Wireless Sensor Networks: Protocols, Design and Evaluation

    OpenAIRE

    Durmaz, O.

    2009-01-01

    Pervasive systems, which are described as networked embedded systems integrated with everyday environments, are considered to have the potential to change our daily lives by creating smart surroundings and by their ubiquity, just as the Internet. In the last decade, “Wireless Sensor Networks��? have appeared as one of the real-world examples of pervasive systems by combining automated sensing, embedded computing and wireless networking into tiny embedded devices. A wireless sensor network typ...

  20. Energy Efficient Clustering in Multi-hop Wireless Sensor Networks Using Differential Evolutionary MOPSO

    Directory of Open Access Journals (Sweden)

    D. Rajendra Prasad

    Full Text Available ABSTRACT The primary challenge in organizing sensor networks is energy efficacy. This requisite for energy efficacy is because sensor nodes capacities are limited and replacing them is not viable. This restriction further decreases network lifetime. Node lifetime varies depending on the requisites expected of its battery. Hence, primary element in constructing sensor networks is resilience to deal with decreasing lifetime of all sensor nodes. Various network infrastructures as well as their routing protocols for reduction of power utilization as well as to prolong network lifetime are studied. After analysis, it is observed that network constructions that depend on clustering are the most effective methods in terms of power utilization. Clustering divides networks into inter-related clusters such that every cluster has several sensor nodes with a Cluster Head (CH at its head. Sensor gathered information is transmitted to data processing centers through CH hierarchy in clustered environments. The current study utilizes Multi-Objective Particle Swarm Optimization (MOPSO-Differential Evolution (DE (MOPSO-DE technique for optimizing clustering.

  1. Multi-hop amplify-and-forward relaying cooperation in the presence of I/Q imbalance

    KAUST Repository

    Qi, Jian; Aï ssa, Sonia; Alouini, Mohamed-Slim

    2013-01-01

    In this paper, multi-hop cooperative networks implementing channel state information (CSI)-assisted amplify-and-forward (AF) relaying in the presence of in-phase and quadrature-phase (I/Q) imbalance are investigated. We propose a compensation algorithm for the I/Q imbalance. The performance of the multi-hop CSI-assisted AF cooperative networks with and without compensation for I/Q imbalance in Nakagami-m fading environment is evaluated in terms of average symbol error probability. Numerical results are provided and show that the proposed compensation method can effectively mitigate the impact of I/Q imbalance. © 2013 IEEE.

  2. Multi-hop amplify-and-forward relaying cooperation in the presence of I/Q imbalance

    KAUST Repository

    Qi, Jian

    2013-06-01

    In this paper, multi-hop cooperative networks implementing channel state information (CSI)-assisted amplify-and-forward (AF) relaying in the presence of in-phase and quadrature-phase (I/Q) imbalance are investigated. We propose a compensation algorithm for the I/Q imbalance. The performance of the multi-hop CSI-assisted AF cooperative networks with and without compensation for I/Q imbalance in Nakagami-m fading environment is evaluated in terms of average symbol error probability. Numerical results are provided and show that the proposed compensation method can effectively mitigate the impact of I/Q imbalance. © 2013 IEEE.

  3. Stability-Aware Geographic Routing in Energy Harvesting Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Tran Dinh Hieu

    2016-05-01

    Full Text Available A new generation of wireless sensor networks that harvest energy from environmental sources such as solar, vibration, and thermoelectric to power sensor nodes is emerging to solve the problem of energy limitation. Based on the photo-voltaic model, this research proposes a stability-aware geographic routing for reliable data transmissions in energy-harvesting wireless sensor networks (EH-WSNs to provide a reliable routes selection method and potentially achieve an unlimited network lifetime. Specifically, the influences of link quality, represented by the estimated packet reception rate, on network performance is investigated. Simulation results show that the proposed method outperforms an energy-harvesting-aware method in terms of energy consumption, the average number of hops, and the packet delivery ratio.

  4. NQAR: Network Quality Aware Routing in Error-Prone Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jaewon Choi

    2010-01-01

    Full Text Available We propose a network quality aware routing (NQAR mechanism to provide an enabling method of the delay-sensitive data delivery over error-prone wireless sensor networks. Unlike the existing routing methods that select routes with the shortest arrival latency or the minimum hop count, the proposed scheme adaptively selects the route based on the network qualities including link errors and collisions with minimum additional complexity. It is designed to avoid the paths with potential noise and collision that may cause many non-deterministic backoffs and retransmissions. We propose a generic framework to select a minimum cost route that takes the packet loss rate and collision history into account. NQAR uses a data centric approach to estimate a single-hop delay based on processing time, propagation delay, packet loss rate, number of backoffs, and the retransmission timeout between two neighboring nodes. This enables a source node to choose the shortest expected end-to-end delay path to send a delay-sensitive data. The experiment results show that NQAR reduces the end-to-end transfer delay up to approximately 50% in comparison with the latency-based directed diffusion and the hop count-based directed diffusion under the error-prone network environments. Moreover, NQAR shows better performance than those routing methods in terms of jitter, reachability, and network lifetime.

  5. Transmission Delay Based Control over Networks with Wireless Links

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    To achieve the mobility of computers during communication, the TCP connections between fixed host and mobile host may often traverse wired and wireless networks, and the recovery of losses due to wireless transmission error is much different from congestion control. The paper analyzes the side effect of RTT estimation while making the TCP source to handle congestion and wireless error losses properly. Then present a strategy using information feedback by the last hop acknowledgement and monitoring the queuing level of the wired bottleneck link by calculating the changes in transmission delay along the path. With the identification of the early stage of congestion, it can respond to wired congestion quickly while keeping wireless link more reliable, and make TCP react to the different packets losses more appropriately.

  6. Distributed Multi-Commodity Network Flow Algorithm for Energy Optimal Routing in Wireless Sensor Networks.

    Directory of Open Access Journals (Sweden)

    J. Trdlicka

    2010-12-01

    Full Text Available This work proposes a distributed algorithm for energy optimal routing in a wireless sensor network. The routing problem is described as a mathematical problem by the minimum-cost multi-commodity network flow problem. Due to the separability of the problem, we use the duality theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without any central node or knowledge of the whole network structure. Each node only needs to know the flow which is supposed to send or receive and the costs and capacities of the neighboring links. An evaluation of the presented algorithm on benchmarks for the energy optimal data flow routing in sensor networks with up to 100 nodes is presented.

  7. Compression of Video Tracking and Bandwidth Balancing Routing in Wireless Multimedia Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yin Wang

    2015-12-01

    Full Text Available There has been a tremendous growth in multimedia applications over wireless networks. Wireless Multimedia Sensor Networks(WMSNs have become the premier choice in many research communities and industry. Many state-of-art applications, such as surveillance, traffic monitoring, and remote heath care are essentially video tracking and transmission in WMSNs. The transmission speed is constrained by the big file size of video data and fixed bandwidth allocation in constant routing paths. In this paper, we present a CamShift based algorithm to compress the tracking of videos. Then we propose a bandwidth balancing strategy in which each sensor node is able to dynamically select the node for the next hop with the highest potential bandwidth capacity to resume communication. Key to this strategy is that each node merely maintains two parameters that contain its historical bandwidth varying trend and then predict its near future bandwidth capacity. Then, the forwarding node selects the next hop with the highest potential bandwidth capacity. Simulations demonstrate that our approach significantly increases the data received by the sink node and decreases the delay on video transmission in Wireless Multimedia Sensor Network environments.

  8. Analysis of Probability of Non-zero Secrecy Capacity for Multi-hop Networks in Presence of Hardware Impairments over Nakagami-m Fading Channels

    Directory of Open Access Journals (Sweden)

    T.-T. Phu

    2016-12-01

    Full Text Available In this paper, we evaluate probability of non-zero secrecy capacity of multi-hop relay networks over Nakagami-m fading channels in presence of hardware impairments. In the considered protocol, a source attempts to transmit its data to a destination by using multi-hop randomize-and-forward (RF strategy. The data transmitted by the source and relays are overheard by an eavesdropper. For performance evaluation, we derive exact expressions of probability of non-zero secrecy capacity (PoNSC, which are expressed by sums of infinite series of exponential functions and exponential integral functions. We then perform Monte Carlo simulations to verify the theoretical analysis.

  9. Design and Analysis of a Data Fusion Scheme in Mobile Wireless Sensor Networks Based on Multi-Protocol Mobile Agents

    Directory of Open Access Journals (Sweden)

    Chunxue Wu

    2017-11-01

    Full Text Available Sensors are increasingly used in mobile environments with wireless network connections. Multiple sensor types measure distinct aspects of the same event. Their measurements are then combined to produce integrated, reliable results. As the number of sensors in networks increases, low energy requirements and changing network connections complicate event detection and measurement. We present a data fusion scheme for use in mobile wireless sensor networks with high energy efficiency and low network delays, that still produces reliable results. In the first phase, we used a network simulation where mobile agents dynamically select the next hop migration node based on the stability parameter of the link, and perform the data fusion at the migration node. Agents use the fusion results to decide if it should return the fusion results to the processing center or continue to collect more data. In the second phase. The feasibility of data fusion at the node level is confirmed by an experimental design where fused data from color sensors show near-identical results to actual physical temperatures. These results are potentially important for new large-scale sensor network applications.

  10. Monitoring and classifying animal behavior using ZigBee-based mobile ad hoc wireless sensor networks and artificial neural networks

    DEFF Research Database (Denmark)

    S. Nadimi, Esmaeil; Nyholm Jørgensen, Rasmus; Blanes-Vidal, Victoria

    2012-01-01

    Animal welfare is an issue of great importance in modern food production systems. Because animal behavior provides reliable information about animal health and welfare, recent research has aimed at designing monitoring systems capable of measuring behavioral parameters and transforming them...... into their corresponding behavioral modes. However, network unreliability and high-energy consumption have limited the applicability of those systems. In this study, a 2.4-GHz ZigBee-based mobile ad hoc wireless sensor network (MANET) that is able to overcome those problems is presented. The designed MANET showed high...... communication reliability, low energy consumption and low packet loss rate (14.8%) due to the deployment of modern communication protocols (e.g. multi-hop communication and handshaking protocol). The measured behavioral parameters were transformed into the corresponding behavioral modes using a multilayer...

  11. DESYNC: Self-Organizing Desynchronization and TDMA on Wireless Sensor Networks

    OpenAIRE

    Degesys, Julius; Rose, Ian; Patel, Ankit; Nagpal, Radhika

    2006-01-01

    Desynchronization is a novel primitive for sensor networks: it implies that nodes perfectly interleave periodic events to occur in a round-robin schedule. This primitive can be used to evenly distribute sampling burden in a group of nodes, schedule sleep cycles, or organize a collision-free TDMA schedule for transmitting wireless messages. Here we present Desync, a biologically-inspired self-maintaining algorithm for desynchronization in a single-hop network. We present (1) theoretical result...

  12. Medium access control and hardware prototype designs for low-energy wireless sensor networks

    Energy Technology Data Exchange (ETDEWEB)

    Kohvakka, M.

    2009-07-01

    A Wireless Sensor Network (WSN) is an emerging technology consisting of small, cheap, and ultra-low energy sensor nodes, which cooperatively monitor physical quantities, actuate, and perform data processing tasks. A deployment may comprise thousands of randomly distributed autonomous nodes, which must self-configure and create a multi-hop network topology.This thesis focuses on low-energy WSNs targeting to long network lifetime. The main research problem is the combination of adaptive and scalable multi-hop networking with constrained energy budget, processing power, and communication bandwidth. The research problem is approached by energy-efficient protocols and low-power sensor node platforms. The main contribution of this thesis is an energy-efficient Medium Access Control (MAC) design for TUTWSN (Tampere University of Technology Wireless Sensor Network). The design comprises channel access and networking mechanisms, which specify data exchange, link synchronization, network self-configuration, and neighbor discovery operations. The second outcome are several low-power sensor node platforms, which have been designed and implemented to evaluate the performance of the MAC design and hardware components in real deployments. The third outcome are the performance models and analysis of several MAC designs including TUTWSN, IEEE 802.15.4, and the most essential research proposals.The results and conclusion of this Thesis indicate that it is possible to implement multi-hop WSNs in harsh and dynamic operation conditions with years of lifetime using current low-cost components and batteries. Energy analysis results indicate that the lowest energy consumption is achieved by using simple and high data-rate transceivers. It is also critical to minimize sleep mode power consumption of all components and to use accurate wake-up timers. However, the selection of components constitutes only a minor part of the solution, and an energy-efficient MAC layer design being able to

  13. A Cross-Layer Routing Design for Multi-Interface Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Tzu-Chieh Tsai

    2009-01-01

    Full Text Available In recent years, Wireless Mesh Networks (WMNs technologies have received significant attentions. WMNs not only accede to the advantages of ad hoc networks but also provide hierarchical multi-interface architecture. Transmission power control and routing path selections are critical issues in the past researches of multihop networks. Variable transmission power levels lead to different network connectivity and interference. Further, routing path selections among different radio interfaces will also produce different intra-/interflow interference. These features tightly affect the network performance. Most of the related works on the routing protocol design do not consider transmission power control and multi-interface environment simultaneously. In this paper, we proposed a cross-layer routing protocol called M2iRi2 which coordinates transmission power control and intra-/interflow interference considerations as routing metrics. Each radio interface calculates the potential tolerable-added transmission interference in the physical layer. When the route discovery starts, the M2iRi2 will adopt the appropriate power level to evaluate each interface quality along paths. The simulation results demonstrate that our design can enhance both network throughput and end-to-end delay.

  14. FTUC: A Flooding Tree Uneven Clustering Protocol for a Wireless Sensor Network.

    Science.gov (United States)

    He, Wei; Pillement, Sebastien; Xu, Du

    2017-11-23

    Clustering is an efficient approach in a wireless sensor network (WSN) to reduce the energy consumption of nodes and to extend the lifetime of the network. Unfortunately, this approach requires that all cluster heads (CHs) transmit their data to the base station (BS), which gives rise to the long distance communications problem, and in multi-hop routing, the CHs near the BS have to forward data from other nodes that lead those CHs to die prematurely, creating the hot zones problem. Unequal clustering has been proposed to solve these problems. Most of the current algorithms elect CH only by considering their competition radius, leading to unevenly distributed cluster heads. Furthermore, global distances values are needed when calculating the competition radius, which is a tedious task in large networks. To face these problems, we propose a flooding tree uneven clustering protocol (FTUC) suited for large networks. Based on the construction of a tree type sub-network to calculate the minimum and maximum distances values of the network, we then apply the unequal cluster theory. We also introduce referenced position circles to evenly elect cluster heads. Therefore, cluster heads are elected depending on the node's residual energy and their distance to a referenced circle. FTUC builds the best inter-cluster communications route by evaluating a cluster head cost function to find the best next hop to the BS. The simulation results show that the FTUC algorithm decreases the energy consumption of the nodes and balances the global energy consumption effectively, thus extending the lifetime of the network.

  15. Two-Layer Hierarchy Optimization Model for Communication Protocol in Railway Wireless Monitoring Networks

    Directory of Open Access Journals (Sweden)

    Xiaoping Ma

    2018-01-01

    Full Text Available The wireless monitoring system is always destroyed by the insufficient energy of the sensors in railway. Hence, how to optimize the communication protocol and extend the system lifetime is crucial to ensure the stability of system. However, the existing studies focused primarily on cluster-based or multihop protocols individually, which are ineffective in coping with the complex communication scenarios in the railway wireless monitoring system (RWMS. This study proposes a hybrid protocol which combines the cluster-based and multihop protocols (CMCP to minimize and balance the energy consumption in different sections of the RWMS. In the first hierarchy, the total energy consumption is minimized by optimizing the cluster quantities in the cluster-based protocol and the number of hops and the corresponding hop distances in the multihop protocol. In the second hierarchy, the energy consumption is balanced through rotating the cluster head (CH in the subnetworks and further optimizing the hops and the corresponding hop distances in the backbone network. On this basis, the system lifetime is maximized with the minimum and balance energy consumption among the sensors. Furthermore, the hybrid particle swarm optimization and genetic algorithm (PSO-GA are adopted to optimize the energy consumption from the two-layer hierarchy. Finally, the effectiveness of the proposed CMCP is verified in the simulation. The performances of the proposed CMCP in system lifetime, residual energy, and the corresponding variance are all superior to the LEACH protocol widely applied in the previous research. The effective protocol proposed in this study can facilitate the application of the wireless monitoring network in the railway system and enhance safety operation of the railway.

  16. OPS: Opportunistic pipeline scheduling in long-strip wireless sensor networks with unreliable links

    NARCIS (Netherlands)

    Guo, Peng; Meratnia, Nirvana; Havinga, Paul J.M.; Jiang, He; Zhang, Kui

    2015-01-01

    Being deployed in narrow but long area, strip wireless sensor networks (SWSNs) have drawn much attention in applications such as coal mines, pipeline and structure monitoring. One of typical characteristics of SWSNs is the large hop counts, which leads to long end-to-end delivery delay in

  17. A distributed monitoring system for photovoltaic arrays based on a two-level wireless sensor network

    Science.gov (United States)

    Su, F. P.; Chen, Z. C.; Zhou, H. F.; Wu, L. J.; Lin, P. J.; Cheng, S. Y.; Li, Y. F.

    2017-11-01

    In this paper, a distributed on-line monitoring system based on a two-level wireless sensor network (WSN) is proposed for real time status monitoring of photovoltaic (PV) arrays to support the fine management and maintenance of PV power plants. The system includes the sensing nodes installed on PV modules (PVM), sensing and routing nodes installed on combiner boxes of PV sub-arrays (PVA), a sink node and a data management centre (DMC) running on a host computer. The first level WSN is implemented by the low-cost wireless transceiver nRF24L01, and it is used to achieve single hop communication between the PVM nodes and their corresponding PVA nodes. The second level WSN is realized by the CC2530 based ZigBee network for multi-hop communication among PVA nodes and the sink node. The PVM nodes are used to monitor the PVM working voltage and backplane temperature, and they send the acquired data to their PVA node via the nRF24L01 based first level WSN. The PVA nodes are used to monitor the array voltage, PV string current and environment irradiance, and they send the acquired and received data to the DMC via the ZigBee based second level WSN. The DMC is designed using the MATLAB GUIDE and MySQL database. Laboratory experiment results show that the system can effectively acquire, display, store and manage the operating and environment parameters of PVA in real time.

  18. Multihop Capability Analysis in Wireless Information and Power Transfer Multirelay Cooperative Networks

    Directory of Open Access Journals (Sweden)

    Qilin Wu

    2018-01-01

    Full Text Available We study simultaneous wireless information and power transfer (SWIPT in multihop wireless cooperative networks, where the multihop capability that denotes the largest number of transmission hops is investigated. By utilizing the broadcast nature of multihop wireless networks, we first propose a cooperative forwarding power (CFP scheme. In CFP scheme, the multiple relays and receiver have distinctly different tasks. Specifically, multiple relays close to the transmitter harvest power from the transmitter first and then cooperatively forward the power (not the information towards the receiver. The receiver receives the information (not the power from the transmitter first, and then it harvests the power from the relays and is taken as the transmitter of the next hop. Furthermore, for performance comparison, we suggest two schemes: cooperative forwarding information and power (CFIP and direct receiving information and power (DFIP. Also, we construct an analysis model to investigate the multihop capabilities of CFP, CFIP, and DFIP schemes under the given targeted throughput requirement. Finally, simulation results validate the analysis model and show that the multihop capability of CFP is better than CFIP and DFIP, and for improving the multihop capabilities, it is best effective to increase the average number of relay nodes in cooperative set.

  19. The Role of Delay and Connectivity in Throughput Reduction of Cooperative Decentralized Wireless Networks

    Directory of Open Access Journals (Sweden)

    Ahmed Alkhayyat

    2015-01-01

    Full Text Available We proposed a multiple relay selection protocol for decentralized wireless networks. The proposed relays selection protocol aims to address three issues: (1 selecting relays within the coverage area of the source and destination to ensure that the relays are positioned one hop away from the destination, (2 ensuring that the best node (best relays with less distance and attenuation from the destination access the channel first, and (3 ensuring that the proposed relays selection is collision-free. Our analysis also considers three important characteristics of decentralized wireless networks that are directly affected by cooperation: delay, connectivity, and throughput. The main goal of this paper is to demonstrate that improving connectivity and increasing number of relays reduce the throughput of cooperative decentralized wireless networks; consequently, a trade-off equation has been derived.

  20. Advanced wireless mobile collaborative sensing network for tactical and strategic missions

    Science.gov (United States)

    Xu, Hao

    2017-05-01

    In this paper, an advanced wireless mobile collaborative sensing network will be developed. Through properly combining wireless sensor network, emerging mobile robots and multi-antenna sensing/communication techniques, we could demonstrate superiority of developed sensing network. To be concrete, heterogeneous mobile robots including unmanned aerial vehicle (UAV) and unmanned ground vehicle (UGV) are equipped with multi-model sensors and wireless transceiver antennas. Through real-time collaborative formation control, multiple mobile robots can team the best formation that can provide most accurate sensing results. Also, formatting multiple mobile robots can also construct a multiple-input multiple-output (MIMO) communication system that can provide a reliable and high performance communication network.

  1. LBMR: Load-Balanced Multipath Routing for Wireless Data-Intensive Transmission in Real-Time Medical Monitoring.

    Science.gov (United States)

    Tseng, Chinyang Henry

    2016-05-31

    In wireless networks, low-power Zigbee is an excellent network solution for wireless medical monitoring systems. Medical monitoring generally involves transmission of a large amount of data and easily causes bottleneck problems. Although Zigbee's AODV mesh routing provides extensible multi-hop data transmission to extend network coverage, it originally does not, and needs to support some form of load balancing mechanism to avoid bottlenecks. To guarantee a more reliable multi-hop data transmission for life-critical medical applications, we have developed a multipath solution, called Load-Balanced Multipath Routing (LBMR) to replace Zigbee's routing mechanism. LBMR consists of three main parts: Layer Routing Construction (LRC), a Load Estimation Algorithm (LEA), and a Route Maintenance (RM) mechanism. LRC assigns nodes into different layers based on the node's distance to the medical data gateway. Nodes can have multiple next-hops delivering medical data toward the gateway. All neighboring layer-nodes exchange flow information containing current load, which is the used by the LEA to estimate future load of next-hops to the gateway. With LBMR, nodes can choose the neighbors with the least load as the next-hops and thus can achieve load balancing and avoid bottlenecks. Furthermore, RM can detect route failures in real-time and perform route redirection to ensure routing robustness. Since LRC and LEA prevent bottlenecks while RM ensures routing fault tolerance, LBMR provides a highly reliable routing service for medical monitoring. To evaluate these accomplishments, we compare LBMR with Zigbee's AODV and another multipath protocol, AOMDV. The simulation results demonstrate LBMR achieves better load balancing, less unreachable nodes, and better packet delivery ratio than either AODV or AOMDV.

  2. A wireless sensor network design and evaluation for large structural strain field monitoring

    International Nuclear Information System (INIS)

    Qiu, Zixue; Wu, Jian; Yuan, Shenfang

    2011-01-01

    Structural strain changes under external environmental or mechanical loads are the main monitoring parameters in structural health monitoring or mechanical property tests. This paper presents a wireless sensor network designed for monitoring large structural strain field variation. First of all, a precision strain sensor node is designed for multi-channel strain gauge signal conditioning and wireless monitoring. In order to establish a synchronous strain data acquisition network, the cluster-star network synchronization method is designed in detail. To verify the functionality of the designed wireless network for strain field monitoring capability, a multi-point network evaluation system is developed for an experimental aluminum plate structure for load variation monitoring. Based on the precision wireless strain nodes, the wireless data acquisition network is deployed to synchronously gather, process and transmit strain gauge signals and monitor results under concentrated loads. This paper shows the efficiency of the wireless sensor network for large structural strain field monitoring

  3. A Novel Spectrally Efficient Asynchronous Multi-Channel MAC Using a Half-Duplex Transceiver for Wireless Networks

    Directory of Open Access Journals (Sweden)

    Abdullah Devendiran

    2018-01-01

    Full Text Available Multi-channel medium access control (MAC protocols maximize network performance by enabling concurrent wireless transmissions over non-interfering channels. Despite physical layer advancements, the underlying IEEE 802.11 MAC standard cannot fully exploit features and support high-performance applications. In this work, we propose the novel spectrally efficient asynchronous multi-channel MAC (SA-MMAC protocol for wireless networks using a single half-duplex transceiver. A full-duplex mode of operation on data channels reduces the signaling overhead and boosts the spectrum efficiency. A revamped contention mechanism of IEEE 802.11 addresses the multi-channel hidden terminal problem, and a jamming signal from the receiver addresses the collisions in control signals. Furthermore, the control channel is used for data transmissions to increase the bandwidth utilization but under a restricted half-duplex mode to avoid causing a bottleneck situation. The simulator is tested for correctness. The results suggest that the protocol can work well on 3, 4, or 12 concurrent channels with high node density, providing about 12.5 times more throughput than IEEE 802.11 and 18% to 95% more throughput than its multi-channel variants under saturated traffic conditions.

  4. An efficient routing algorithm for event based monitoring in a plant using virtual sink nodes in a wireless sensor network

    International Nuclear Information System (INIS)

    Jain, Sanjay Kumar; Vietla, Srinivas; Roy, D.A.; Biswas, B.B.; Pithawa, C.K.

    2010-01-01

    A Wireless Sensor Network is a collection of wireless sensor nodes arranged in a self-forming network without aid of any infrastructure or administration. The individual nodes have limited resources and hence efficient communication mechanisms between the nodes have to be devised for continued operation of the network in a plant environment. In wireless sensor networks a sink node or base station at one end acts as the recipient of information gathered by all other sensor nodes in the network and the information arrives at the sink through multiple hops across the nodes of the network. A routing algorithm has been developed in which a virtual sink node is generated whenever hop count of an ordinary node crosses a certain specified value. The virtual sink node acts as a recipient node for data of all neighboring nodes. This virtual sink helps in reducing routing overhead, especially when the sensor network is scaled to a larger network. The advantages with this scheme are less energy consumption, reduced congestion in the network and longevity of the network. The above algorithm is suitable for event based or interval based monitoring systems in nuclear plants. This paper describes the working of the proposed algorithm and provides its implementation details. (author)

  5. P-bRS: A Physarum-Based Routing Scheme for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mingchuan Zhang

    2014-01-01

    Full Text Available Routing in wireless sensor networks (WSNs is an extremely challenging issue due to the features of WSNs. Inspired by the large and single-celled amoeboid organism, slime mold Physarum polycephalum, we establish a novel selecting next hop model (SNH. Based on this model, we present a novel Physarum-based routing scheme (P-bRS for WSNs to balance routing efficiency and energy equilibrium. In P-bRS, a sensor node can choose the proper next hop by using SNH which comprehensively considers the distance, energy residue, and location of the next hop. The simulation results show how P-bRS can achieve the effective trade-off between routing efficiency and energy equilibrium compared to two famous algorithms.

  6. Delay reduction in multi-hop device-to-device communication using network coding

    KAUST Repository

    Douik, Ahmed S.

    2015-08-12

    This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost packets of devices in their transmission range by sending network coded packets. To solve the problem, the different events occurring at each device are identified so as to derive an expression for the probability distribution of the decoding delay. The joint optimization problem over the set of transmitting devices and the packet combinations of each is formulated. Due to the high complexity of finding the optimal solution, this paper focuses on cooperation without interference between the transmitting users. The optimal solution, in such interference-less scenario, is expressed using a graph theory approach by introducing the cooperation graph. Extensive simulations compare the decoding delay experienced in the Point to Multi-Point (PMP), the fully connected D2D (FC-D2D) and the more practical partially connected D2D (PC-D2D) configurations and suggest that the PC-D2D outperforms the FC-D2D in all situations and provides an enormous gain for poorly connected networks.

  7. Maximization of Energy Efficiency in Wireless ad hoc and Sensor Networks With SERENA

    Directory of Open Access Journals (Sweden)

    Saoucene Mahfoudh

    2009-01-01

    Full Text Available In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slot and the slots assigned to its neighbors, it sleeps the remaining time. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. SERENA is based on a two-hop coloring algorithm, whose complexity in terms of colors and rounds is evaluated. We then quantify the slot reuse. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks. We compare SERENA with classical TDMA and optimized variants such as USAP in wireless ad hoc and sensor networks.

  8. An Energy Efficient Stable Election-Based Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Weiwei Yuan

    2013-10-01

    Full Text Available Sensor nodes usually have limited energy supply and they are impractical to recharge. How to balance traffic load in sensors in order to increase network lifetime is a very challenging research issue. Many clustering algorithms have been proposed recently for wireless sensor networks (WSNs. However, sensor networks with one fixed sink node often suffer from a hot spots problem since nodes near sinks have more traffic burden to forward during a multi-hop transmission process. The use of mobile sinks has been shown to be an effective technique to enhance network performance features such as latency, energy efficiency, network lifetime, etc. In this paper, a modified Stable Election Protocol (SEP, which employs a mobile sink, has been proposed for WSNs with non-uniform node distribution. The decision of selecting cluster heads by the sink is based on the minimization of the associated additional energy and residual energy at each node. Besides, the cluster head selects the shortest path to reach the sink between the direct approach and the indirect approach with the use of the nearest cluster head. Simulation results demonstrate that our algorithm has better performance than traditional routing algorithms, such as LEACH and SEP.

  9. Delay reduction in multi-hop device-to-device communication using network coding

    KAUST Repository

    Douik, Ahmed S.; Sorour, Sameh; Al-Naffouri, Tareq Y.; Yang, Hong-Chuan; Alouini, Mohamed-Slim

    2015-01-01

    This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost

  10. Wireless mesh networks.

    Science.gov (United States)

    Wang, Xinheng

    2008-01-01

    Wireless telemedicine using GSM and GPRS technologies can only provide low bandwidth connections, which makes it difficult to transmit images and video. Satellite or 3G wireless transmission provides greater bandwidth, but the running costs are high. Wireless networks (WLANs) appear promising, since they can supply high bandwidth at low cost. However, the WLAN technology has limitations, such as coverage. A new wireless networking technology named the wireless mesh network (WMN) overcomes some of the limitations of the WLAN. A WMN combines the characteristics of both a WLAN and ad hoc networks, thus forming an intelligent, large scale and broadband wireless network. These features are attractive for telemedicine and telecare because of the ability to provide data, voice and video communications over a large area. One successful wireless telemedicine project which uses wireless mesh technology is the Emergency Room Link (ER-LINK) in Tucson, Arizona, USA. There are three key characteristics of a WMN: self-organization, including self-management and self-healing; dynamic changes in network topology; and scalability. What we may now see is a shift from mobile communication and satellite systems for wireless telemedicine to the use of wireless networks based on mesh technology, since the latter are very attractive in terms of cost, reliability and speed.

  11. A Hierarchical Energy Efficient Reliable Transport Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Prabhudutta Mohanty

    2014-12-01

    Full Text Available The two important requirements for many Wireless Senor Networks (WSNs are prolonged network lifetime and end-to-end reliability. The sensor nodes consume more energy during data transmission than the data sensing. In WSN, the redundant data increase the energy consumption, latency and reduce reliability during data transmission. Therefore, it is important to support energy efficient reliable data transport in WSNs. In this paper, we present a Hierarchical Energy Efficient Reliable Transport Protocol (HEERTP for the data transmission within the WSN. This protocol maximises the network lifetime by controlling the redundant data transmission with the co-ordination of Base Station (BS. The proposed protocol also achieves end-to-end reliability using a hop-by-hop acknowledgement scheme. We evaluate the performance of the proposed protocol through simulation. The simulation results reveal that our proposed protocol achieves better performance in terms of energy efficiency, latency and reliability than the existing protocols.

  12. TCPL: A Defense against wormhole attacks in wireless sensor networks

    International Nuclear Information System (INIS)

    Kumar, K. E. Naresh; Waheed, Mohd. Abdul; Basappa, K. Kari

    2010-01-01

    Do In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many sensor network routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.

  13. Power and delay optimisation in multi-hop wireless networks

    KAUST Repository

    Xia, Li; Shihada, Basem

    2014-01-01

    in order to minimise the power consumption and the queueing delay of the whole network. With the assumptions of interference-free links and independently and identically distributed (i.i.d.) channel states, we formulate this problem using a semi

  14. An Improved Digital Signature Protocol to Multi-User Broadcast Authentication Based on Elliptic Curve Cryptography in Wireless Sensor Networks (WSNs

    Directory of Open Access Journals (Sweden)

    Hamed Bashirpour

    2018-03-01

    Full Text Available In wireless sensor networks (WSNs, users can use broadcast authentication mechanisms to connect to the target network and disseminate their messages within the network. Since data transfer for sensor networks is wireless, as a result, attackers can easily eavesdrop deployed sensor nodes and the data sent between them or modify the content of eavesdropped data and inject false data into the sensor network. Hence, the implementation of the message authentication mechanisms (in order to avoid changes and injecting messages into the network of wireless sensor networks is essential. In this paper, we present an improved protocol based on elliptic curve cryptography (ECC to accelerate authentication of multi-user message broadcasting. In comparison with previous ECC-based schemes, complexity and computational overhead of proposed scheme is significantly decreased. Also, the proposed scheme supports user anonymity, which is an important property in broadcast authentication schemes for WSNs to preserve user privacy and user untracking.

  15. A Game Theory Based Congestion Control Protocol for Wireless Personal Area Networks

    Directory of Open Access Journals (Sweden)

    Chuang Ma

    2016-01-01

    Full Text Available In wireless sensor networks (WSNs, the presence of congestion increases the ratio of packet loss and energy consumption and reduces the network throughput. Particularly, this situation will be more complex in Internet of Things (IoT environment, which is composed of thousands of heterogeneous nodes. RPL is an IPv6 routing protocol in low power and lossy networks standardized by IETF. However, the RPL can induce problems under network congestion, such as frequently parent changing and throughput degradation. In this paper, we address the congestion problem between parent nodes and child nodes in RPL-enabled networks, which typically consist of low power and resource constraint devices. To mitigate the effect of network congestion, we design a parent-change procedure by game theory strategy, by which the child nodes can change next hop neighbors toward the sink. Comparing to the ContikiRPL implementation, the simulation results show that our protocol can achieve more than two times improvement in throughput and reduce packet loss rate with less increasing of average hop count.

  16. Radio propagation and adaptive antennas for wireless communication networks

    CERN Document Server

    Blaunstein, Nathan

    2014-01-01

    Explores novel wireless networks beyond 3G, and advanced 4G technologies, such as MIMO, via propagation phenomena and the fundamentals of adapted antenna usage.Explains how adaptive antennas can improve GoS and QoS for any wireless channel, with specific examples and applications in land, aircraft and satellite communications.Introduces new stochastic approach based on several multi-parametric models describing various terrestrial scenarios, which have been experimentally verified in different environmental conditionsNew chapters on fundamentals of wireless networks, cellular and non-cellular,

  17. Multi-Source Cooperative Data Collection with a Mobile Sink for the Wireless Sensor Network.

    Science.gov (United States)

    Han, Changcai; Yang, Jinsheng

    2017-10-30

    The multi-source cooperation integrating distributed low-density parity-check codes is investigated to jointly collect data from multiple sensor nodes to the mobile sink in the wireless sensor network. The one-round and two-round cooperative data collection schemes are proposed according to the moving trajectories of the sink node. Specifically, two sparse cooperation models are firstly formed based on geographical locations of sensor source nodes, the impairment of inter-node wireless channels and moving trajectories of the mobile sink. Then, distributed low-density parity-check codes are devised to match the directed graphs and cooperation matrices related with the cooperation models. In the proposed schemes, each source node has quite low complexity attributed to the sparse cooperation and the distributed processing. Simulation results reveal that the proposed cooperative data collection schemes obtain significant bit error rate performance and the two-round cooperation exhibits better performance compared with the one-round scheme. The performance can be further improved when more source nodes participate in the sparse cooperation. For the two-round data collection schemes, the performance is evaluated for the wireless sensor networks with different moving trajectories and the variant data sizes.

  18. Multi-agent Negotiation Mechanisms for Statistical Target Classification in Wireless Multimedia Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sheng Wang

    2007-10-01

    Full Text Available The recent availability of low cost and miniaturized hardware has allowedwireless sensor networks (WSNs to retrieve audio and video data in real worldapplications, which has fostered the development of wireless multimedia sensor networks(WMSNs. Resource constraints and challenging multimedia data volume makedevelopment of efficient algorithms to perform in-network processing of multimediacontents imperative. This paper proposes solving problems in the domain of WMSNs fromthe perspective of multi-agent systems. The multi-agent framework enables flexible networkconfiguration and efficient collaborative in-network processing. The focus is placed ontarget classification in WMSNs where audio information is retrieved by microphones. Todeal with the uncertainties related to audio information retrieval, the statistical approachesof power spectral density estimates, principal component analysis and Gaussian processclassification are employed. A multi-agent negotiation mechanism is specially developed toefficiently utilize limited resources and simultaneously enhance classification accuracy andreliability. The negotiation is composed of two phases, where an auction based approach isfirst exploited to allocate the classification task among the agents and then individual agentdecisions are combined by the committee decision mechanism. Simulation experiments withreal world data are conducted and the results show that the proposed statistical approachesand negotiation mechanism not only reduce memory and computation requi

  19. Wireless sensor placement for structural monitoring using information-fusing firefly algorithm

    Science.gov (United States)

    Zhou, Guang-Dong; Yi, Ting-Hua; Xie, Mei-Xi; Li, Hong-Nan

    2017-10-01

    Wireless sensor networks (WSNs) are promising technology in structural health monitoring (SHM) applications for their low cost and high efficiency. The limited wireless sensors and restricted power resources in WSNs highlight the significance of optimal wireless sensor placement (OWSP) during designing SHM systems to enable the most useful information to be captured and to achieve the longest network lifetime. This paper presents a holistic approach, including an optimization criterion and a solution algorithm, for optimally deploying self-organizing multi-hop WSNs on large-scale structures. The combination of information effectiveness represented by the modal independence and the network performance specified by the network connectivity and network lifetime is first formulated to evaluate the performance of wireless sensor configurations. Then, an information-fusing firefly algorithm (IFFA) is developed to solve the OWSP problem. The step sizes drawn from a Lévy distribution are adopted to drive fireflies toward brighter individuals. Following the movement with Lévy flights, information about the contributions of wireless sensors to the objective function as carried by the fireflies is fused and applied to move inferior wireless sensors to better locations. The reliability of the proposed approach is verified via a numerical example on a long-span suspension bridge. The results demonstrate that the evaluation criterion provides a good performance metric of wireless sensor configurations, and the IFFA outperforms the simple discrete firefly algorithm.

  20. Throughput Analysis of Large Wireless Networks with Regular Topologies

    Directory of Open Access Journals (Sweden)

    Hong Kezhu

    2007-01-01

    Full Text Available The throughput of large wireless networks with regular topologies is analyzed under two medium-access control schemes: synchronous array method (SAM and slotted ALOHA. The regular topologies considered are square, hexagon, and triangle. Both nonfading channels and Rayleigh fading channels are examined. Furthermore, both omnidirectional antennas and directional antennas are considered. Our analysis shows that the SAM leads to a much higher network throughput than the slotted ALOHA. The network throughput in this paper is measured in either bits-hops per second per Hertz per node or bits-meters per second per Hertz per node. The exact connection between the two measures is shown for each topology. With these two fundamental units, the network throughput shown in this paper can serve as a reliable benchmark for future works on network throughput of large networks.

  1. Throughput Analysis of Large Wireless Networks with Regular Topologies

    Directory of Open Access Journals (Sweden)

    Kezhu Hong

    2007-04-01

    Full Text Available The throughput of large wireless networks with regular topologies is analyzed under two medium-access control schemes: synchronous array method (SAM and slotted ALOHA. The regular topologies considered are square, hexagon, and triangle. Both nonfading channels and Rayleigh fading channels are examined. Furthermore, both omnidirectional antennas and directional antennas are considered. Our analysis shows that the SAM leads to a much higher network throughput than the slotted ALOHA. The network throughput in this paper is measured in either bits-hops per second per Hertz per node or bits-meters per second per Hertz per node. The exact connection between the two measures is shown for each topology. With these two fundamental units, the network throughput shown in this paper can serve as a reliable benchmark for future works on network throughput of large networks.

  2. An Asynchronous Multi-Sensor Micro Control Unit for Wireless Body Sensor Networks (WBSNs

    Directory of Open Access Journals (Sweden)

    Ching-Hsing Luo

    2011-07-01

    Full Text Available In this work, an asynchronous multi-sensor micro control unit (MCU core is proposed for wireless body sensor networks (WBSNs. It consists of asynchronous interfaces, a power management unit, a multi-sensor controller, a data encoder (DE, and an error correct coder (ECC. To improve the system performance and expansion abilities, the asynchronous interface is created for handshaking different clock domains between ADC and RF with MCU. To increase the use time of the WBSN system, a power management technique is developed for reducing power consumption. In addition, the multi-sensor controller is designed for detecting various biomedical signals. To prevent loss error from wireless transmission, use of an error correct coding technique is important in biomedical applications. The data encoder is added for lossless compression of various biomedical signals with a compression ratio of almost three. This design is successfully tested on a FPGA board. The VLSI architecture of this work contains 2.68-K gate counts and consumes power 496-μW at 133-MHz processing rate by using TSMC 0.13-μm CMOS process. Compared with the previous techniques, this work offers higher performance, more functions, and lower hardware cost than other micro controller designs.

  3. Design and Evaluation of a Wireless Sensor Network Based Aircraft Strength Testing System

    Science.gov (United States)

    Wu, Jian; Yuan, Shenfang; Zhou, Genyuan; Ji, Sai; Wang, Zilong; Wang, Yang

    2009-01-01

    The verification of aerospace structures, including full-scale fatigue and static test programs, is essential for structure strength design and evaluation. However, the current overall ground strength testing systems employ a large number of wires for communication among sensors and data acquisition facilities. The centralized data processing makes test programs lack efficiency and intelligence. Wireless sensor network (WSN) technology might be expected to address the limitations of cable-based aeronautical ground testing systems. This paper presents a wireless sensor network based aircraft strength testing (AST) system design and its evaluation on a real aircraft specimen. In this paper, a miniature, high-precision, and shock-proof wireless sensor node is designed for multi-channel strain gauge signal conditioning and monitoring. A cluster-star network topology protocol and application layer interface are designed in detail. To verify the functionality of the designed wireless sensor network for strength testing capability, a multi-point WSN based AST system is developed for static testing of a real aircraft undercarriage. Based on the designed wireless sensor nodes, the wireless sensor network is deployed to gather, process, and transmit strain gauge signals and monitor results under different static test loads. This paper shows the efficiency of the wireless sensor network based AST system, compared to a conventional AST system. PMID:22408521

  4. Design and evaluation of a wireless sensor network based aircraft strength testing system.

    Science.gov (United States)

    Wu, Jian; Yuan, Shenfang; Zhou, Genyuan; Ji, Sai; Wang, Zilong; Wang, Yang

    2009-01-01

    The verification of aerospace structures, including full-scale fatigue and static test programs, is essential for structure strength design and evaluation. However, the current overall ground strength testing systems employ a large number of wires for communication among sensors and data acquisition facilities. The centralized data processing makes test programs lack efficiency and intelligence. Wireless sensor network (WSN) technology might be expected to address the limitations of cable-based aeronautical ground testing systems. This paper presents a wireless sensor network based aircraft strength testing (AST) system design and its evaluation on a real aircraft specimen. In this paper, a miniature, high-precision, and shock-proof wireless sensor node is designed for multi-channel strain gauge signal conditioning and monitoring. A cluster-star network topology protocol and application layer interface are designed in detail. To verify the functionality of the designed wireless sensor network for strength testing capability, a multi-point WSN based AST system is developed for static testing of a real aircraft undercarriage. Based on the designed wireless sensor nodes, the wireless sensor network is deployed to gather, process, and transmit strain gauge signals and monitor results under different static test loads. This paper shows the efficiency of the wireless sensor network based AST system, compared to a conventional AST system.

  5. Physical Layer Network Coding

    DEFF Research Database (Denmark)

    Fukui, Hironori; Yomo, Hironori; Popovski, Petar

    2013-01-01

    of interfering nodes and usage of spatial reservation mechanisms. Specifically, we introduce a reserved area in order to protect the nodes involved in two-way relaying from the interference caused by neighboring nodes. We analytically derive the end-to-end rate achieved by PLNC considering the impact......Physical layer network coding (PLNC) has the potential to improve throughput of multi-hop networks. However, most of the works are focused on the simple, three-node model with two-way relaying, not taking into account the fact that there can be other neighboring nodes that can cause....../receive interference. The way to deal with this problem in distributed wireless networks is usage of MAC-layer mechanisms that make a spatial reservation of the shared wireless medium, similar to the well-known RTS/CTS in IEEE 802.11 wireless networks. In this paper, we investigate two-way relaying in presence...

  6. CONTEXT-CAPTURE MULTI-VALUED DECISION FUSION WITH FAULT TOLERANT CAPABILITY FOR WIRELESS SENSOR NETWORKS

    OpenAIRE

    Jun Wu; Shigeru Shimamoto

    2011-01-01

    Wireless sensor networks (WSNs) are usually utilized to perform decision fusion of event detection. Current decision fusion schemes are based on binary valued decision and do not consider bursty contextcapture. However, bursty context and multi-valued data are important characteristics of WSNs. One on hand, the local decisions from sensors usually have bursty and contextual characteristics. Fusion center must capture the bursty context information from the sensors. On the other hand, in pract...

  7. Research on Improved DV-HOP Algorithm against Wormhole Attacks in WSN

    Directory of Open Access Journals (Sweden)

    Wang Xue-Wen

    2016-01-01

    Full Text Available The secure location of node is significant in the WSN (Wireless Sensor Networks of the troop frontier defence system. The wormhole attack is a big threat in the secure location. The credibility of the beacon node was used to determine the malicious nodes produced by wormhole attack in the WSN. The estimated method of multibeacon nodes was adopted to improve DV-HOP algorithm after excluding the malicious nodes. In this paper, we compared the basic DV-HOP algorithm and the improved DV-HOP algorithm in the coverage percentage and the error of network localization by simulating. The simulation results indicate that the improved DV-HOP algorithm makes the localization coverage percentage can reach 90% on a certain scale of the network, and it makes the error percentage lower when the number of beacons is different.

  8. Recent development in wireless sensor and ad-hoc networks

    CERN Document Server

    Li, Xiaolong; Yang, Yeon-Mo

    2015-01-01

    Wireless Sensor Network (WSN) consists of numerous physically distributed autonomous devices used for sensing and monitoring the physical and/or environmental conditions. A WSN uses a gateway that provides wireless connectivity to the wired world as well as distributed networks. There are many open problems related to Ad-Hoc networks and its applications. Looking at the expansion of the cellular infrastructure, Ad-Hoc network may be acting as the basis of the 4th generation wireless technology with the new paradigm of ‘anytime, anywhere communications’. To realize this, the real challenge would be the security, authorization and management issues of the large scale WSNs. This book is an edited volume in the broad area of WSNs. The book covers various chapters like Multi-Channel Wireless Sensor Networks, its Coverage, Connectivity as well as Deployment. It covers comparison of various communication protocols and algorithms such as MANNET, ODMRP and ADMR Protocols for Ad hoc Multicasting, Location Based C...

  9. QoE-based transmission strategies for multi-user wireless information and power transfer

    Directory of Open Access Journals (Sweden)

    Taehun Jung

    2015-12-01

    Full Text Available One solution to the problem of supplying energy to wireless networks is wireless power transfer. One such technology–electromagnetic radiation enabled wireless power transfer–will change traditional wireless networks. In this paper, we investigate a transmission strategy for multi-user wireless information and power transfer. We consider a multi-user multiple-input multiple-output (MIMO channel that includes one base station (BS and two user terminals (UT consisting of one energy harvesting (EH receiver and one information decoding (ID receiver. Our system provides transmission strategies that can be executed and implemented in practical scenarios. The paper then analyzes the rate–energy (R–E pair of our strategies and compares them to those of the theoretical optimal strategy. We furthermore propose a QoE-based mode selection algorithm by mapping the R–E pair to the utility functions.

  10. An Energy-Efficient Link Layer Protocol for Reliable Transmission over Wireless Networks

    Directory of Open Access Journals (Sweden)

    Iqbal Adnan

    2009-01-01

    Full Text Available In multihop wireless networks, hop-by-hop reliability is generally achieved through positive acknowledgments at the MAC layer. However, positive acknowledgments introduce significant energy inefficiencies on battery-constrained devices. This inefficiency becomes particularly significant on high error rate channels. We propose to reduce the energy consumption during retransmissions using a novel protocol that localizes bit-errors at the MAC layer. The proposed protocol, referred to as Selective Retransmission using Virtual Fragmentation (SRVF, requires simple modifications to the positive-ACK-based reliability mechanism but provides substantial improvements in energy efficiency. The main premise of the protocol is to localize bit-errors by performing partial checksums on disjoint parts or virtual fragments of a packet. In case of error, only the corrupted virtual fragments are retransmitted. We develop stochastic models of the Simple Positive-ACK-based reliability, the previously-proposed Packet Length Optimization (PLO protocol, and the SRVF protocol operating over an arbitrary-order Markov wireless channel. Our analytical models show that SRVF provides significant theoretical improvements in energy efficiency over existing protocols. We then use bit-error traces collected over different real networks to empirically compare the proposed and existing protocols. These experimental results further substantiate that SRVF provides considerably better energy efficiency than Simple Positive-ACK and Packet Length Optimization protocols.

  11. A Multi-Vehicles, Wireless Testbed for Networked Control, Communications and Computing

    Science.gov (United States)

    Murray, Richard; Doyle, John; Effros, Michelle; Hickey, Jason; Low, Steven

    2002-03-01

    We have constructed a testbed consisting of 4 mobile vehicles (with 4 additional vehicles being completed), each with embedded computing and communications capability for use in testing new approaches for command and control across dynamic networks. The system is being used or is planned to be used for testing of a variety of communications-related technologies, including distributed command and control algorithms, dynamically reconfigurable network topologies, source coding for real-time transmission of data in lossy environments, and multi-network communications. A unique feature of the testbed is the use of vehicles that have second order dynamics. Requiring real-time feedback algorithms to stabilize the system while performing cooperative tasks. The testbed was constructed in the Caltech Vehicles Laboratory and consists of individual vehicles with PC-based computation and controls, and multiple communications devices (802.11 wireless Ethernet, Bluetooth, and infrared). The vehicles are freely moving, wheeled platforms propelled by high performance dotted fairs. The room contains an access points for an 802.11 network, overhead visual sensing (to allow emulation of CI'S signal processing), a centralized computer for emulating certain distributed computations, and network gateways to control and manipulate communications traffic.

  12. Security for multihop wireless networks

    CERN Document Server

    Khan, Shafiullah

    2014-01-01

    Security for Multihop Wireless Networks provides broad coverage of the security issues facing multihop wireless networks. Presenting the work of a different group of expert contributors in each chapter, it explores security in mobile ad hoc networks, wireless sensor networks, wireless mesh networks, and personal area networks.Detailing technologies and processes that can help you secure your wireless networks, the book covers cryptographic coprocessors, encryption, authentication, key management, attacks and countermeasures, secure routing, secure medium access control, intrusion detection, ep

  13. Wireless sensor networks architectures and protocols

    CERN Document Server

    Callaway, Jr, Edgar H

    2003-01-01

    Introduction to Wireless Sensor NetworksApplications and MotivationNetwork Performance ObjectivesContributions of this BookOrganization of this BookThe Development of Wireless Sensor NetworksEarly Wireless NetworksWireless Data NetworksWireless Sensor and Related NetworksConclusionThe Physical LayerSome Physical Layer ExamplesA Practical Physical Layer for Wireless Sensor NetworksSimulations and ResultsConclusionThe Data Link LayerMedium Access Control TechniquesThe Mediation DeviceSystem Analysis and SimulationConclusionThe Network LayerSome Network Design ExamplesA Wireless Sensor Network De

  14. Implementation of WirelessHART in the NS-2 Simulator and Validation of Its Correctness

    Directory of Open Access Journals (Sweden)

    Pouria Zand

    2014-05-01

    Full Text Available One of the first standards in the wireless sensor networks domain,WirelessHART (HART (Highway Addressable Remote Transducer, was introduced to address industrial process automation and control requirements. This standard can be used as a reference point to evaluate other wireless protocols in the domain of industrial monitoring and control. This makes it worthwhile to set up a reliable WirelessHART simulator in order to achieve that reference point in a relatively easy manner. Moreover, it offers an alternative to expensive testbeds for testing and evaluating the performance of WirelessHART. This paper explains our implementation of WirelessHART in the NS-2 network simulator. According to our knowledge, this is the first implementation that supports the WirelessHART network manager, as well as the whole stack (all OSI (Open Systems Interconnection model layers of the WirelessHART standard. It also explains our effort to validate the correctness of our implementation, namely through the validation of the implementation of the WirelessHART stack protocol and of the network manager. We use sniffed traffic from a realWirelessHART testbed installed in the Idrolab plant for these validations. This confirms the validity of our simulator. Empirical analysis shows that the simulated results are nearly comparable to the results obtained from real networks. We also demonstrate the versatility and usability of our implementation by providing some further evaluation results in diverse scenarios. For example, we evaluate the performance of the WirelessHART network by applying incremental interference in a multi-hop network.

  15. Wireless Sensor Network Localization Research

    OpenAIRE

    Liang Xin

    2014-01-01

    DV-Hop algorithm is one of the important range-free localization algorithms. It performs better in isotropic density senor networks, however, it brings larger location errors in random distributed networks. According to the localization principle of the DV-Hop algorithm, this paper improves the estimation of average single hop distance by using the Least Equal Square Error, and revises the estimated distance between the unknown node and the anchor node with compensation coefficient considerin...

  16. A self-optimizing scheme for energy balanced routing in Wireless Sensor Networks using SensorAnt.

    Science.gov (United States)

    Shamsan Saleh, Ahmed M; Ali, Borhanuddin Mohd; Rasid, Mohd Fadlee A; Ismail, Alyani

    2012-01-01

    Planning of energy-efficient protocols is critical for Wireless Sensor Networks (WSNs) because of the constraints on the sensor nodes' energy. The routing protocol should be able to provide uniform power dissipation during transmission to the sink node. In this paper, we present a self-optimization scheme for WSNs which is able to utilize and optimize the sensor nodes' resources, especially the batteries, to achieve balanced energy consumption across all sensor nodes. This method is based on the Ant Colony Optimization (ACO) metaheuristic which is adopted to enhance the paths with the best quality function. The assessment of this function depends on multi-criteria metrics such as the minimum residual battery power, hop count and average energy of both route and network. This method also distributes the traffic load of sensor nodes throughout the WSN leading to reduced energy usage, extended network life time and reduced packet loss. Simulation results show that our scheme performs much better than the Energy Efficient Ant-Based Routing (EEABR) in terms of energy consumption, balancing and efficiency.

  17. Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

    Science.gov (United States)

    Katiravan, Jeevaa; Sylvia, D; Rao, D Srinivasa

    2015-01-01

    In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

  18. Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Jeevaa Katiravan

    2015-01-01

    Full Text Available In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

  19. An improved energy aware distributed unequal clustering protocol for heterogeneous wireless sensor networks

    Directory of Open Access Journals (Sweden)

    Vrinda Gupta

    2016-06-01

    Full Text Available In this paper, an improved version of the energy aware distributed unequal clustering protocol (EADUC is projected. The EADUC protocol is commonly used for solving energy hole problem in multi-hop wireless sensor networks. In the EADUC, location of base station and residual energy are given importance as clustering parameters. Based on these parameters, different competition radii are assigned to nodes. Herein, a new approach has been proposed to improve the working of EADUC, by electing cluster heads considering number of nodes in the neighborhood in addition to the above two parameters. The inclusion of the neighborhood information for computation of the competition radii provides better balancing of energy in comparison with the existing approach. Furthermore, for the selection of next hop node, the relay metric is defined directly in terms of energy expense instead of only the distance information used in the EADUC and the data transmission phase has been extended in every round by performing the data collection number of times through use of major slots and mini-slots. The methodology used is of retaining the same clusters for a few rounds and is effective in reducing the clustering overhead. The performance of the proposed protocol has been evaluated under three different scenarios and compared with existing protocols through simulations. The results show that the proposed scheme outperforms the existing protocols in terms of network lifetime in all the scenarios.

  20. Static Three-Dimensional Fuzzy Routing Based on the Receiving Probability in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sohrab Khanmohammadi

    2013-11-01

    Full Text Available A Wireless Sensor Network (WSN is a collection of low-cost, low-power and large-scale wireless sensor nodes. Routing protocols are an important topic in WSN. Every sensor node should use a proper mechanism to transmit the generated packets to its destination, usually a base station. In previous works, routing protocols use the global information of the network that causes the redundant packets to be increased. Moreover, it leads to an increase in the network traffic, to a decrease in the delivery ratio of data packets, and to a reduction in network life. In this paper, we propose a new inferential routing protocol called SFRRP (Static Three-Dimensional Fuzzy Routing based on the Receiving Probability. The proposed protocol solves the above mentioned problems considerably. The data packets are transmitted by hop-to-hop delivery to the base station. It uses a fuzzy procedure to transmit the sensed data or the buffered data packets to one of the neighbors called selected node. In the proposed fuzzy system, the distance and number of neighbors are input variables, while the receiving probability is the output variable. SFRRP just uses the local neighborhood information to forward the packets and is not needed by any redundant packet for route discovery. The proposed protocol has some advantages such as a high delivery ratio, less delay time, high network life, and less network traffic. The performance of the proposed protocol surpasses the performance of the Flooding routing protocol in terms of delivery ratio, delay time and network lifetime.

  1. Multi-hop Relaying: An End-to-End Delay Analysis

    KAUST Repository

    Chaaban, Anas

    2015-12-01

    The impact of multi-hopping schemes on the communication latency in a relay channel is studied. The main aim is to characterize conditions under which such schemes decrease the communication latency given a reliability requirement. Both decode-forward (DF) and amplify-forward (AF) with block coding are considered, and are compared with the point-to-point (P2P) scheme which ignores the relay. Latency expressions for the three schemes are derived, and conditions under which DF and AF reduce latency are obtained for high signal-to-noise ratio (SNR). Interestingly, these conditions are more strict when compared to the conditions under which the same multi-hopping schemes achieve higher long-term (information-theoretic) rates than P2P. It turns out that the relation between the sourcedestination SNR and the harmonic mean of the SNR’s of the channels to and from the relay dictates whether multi-hopping reduces latency or not.

  2. Load balancing in integrated optical wireless networks

    DEFF Research Database (Denmark)

    Yan, Ying; Dittmann, Lars; Wong, S-W.

    2010-01-01

    In this paper, we tackle the load balancing problem in Integrated Optical Wireless Networks, where cell breathing technique is used to solve congestion by changing the coverage area of a fully loaded cell tower. Our objective is to design a load balancing mechanism which works closely...... with the integrated control scheme so as to maximize overall network throughput in the integrated network architecture. To the best of our knowledge no load balancing mechanisms, especially based on the Multi-Point Control Protocol (MPCP) defined in the IEEE 802.3ah, have been proposed so far. The major research...... issues are outlined and a cost function based optimization model is developed for power management. In particularly, two alternative feedback schemes are proposed to report wireless network status. Simulation results show that our proposed load balancing mechanism improves network performances....

  3. TMAC: Timestamp-Ordered MAC for CSMA/CA Wireless Mesh Networks

    KAUST Repository

    Nawab, Faisal Saud Yousef

    2011-07-31

    We propose TMAC, a timestamp-ordered MAC protocol for Wireless Mesh Networks (WMNs). TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11 stack, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity in parking lot and large grid topologies.

  4. Fair packet scheduling in Wireless Mesh Networks

    KAUST Repository

    Nawab, Faisal

    2014-02-01

    In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs. TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.

  5. Reliability-Aware Cooperative Node Sleeping and Clustering in Duty-Cycled Sensors Networks

    Directory of Open Access Journals (Sweden)

    Jeungeun Song

    2018-01-01

    Full Text Available Duty-cycled sensor networks provide a new perspective for improvement of energy efficiency and reliability assurance of multi-hop cooperative sensor networks. In this paper, we consider the energy-efficient cooperative node sleeping and clustering problems in cooperative sensor networks where clusters of relay nodes jointly transmit sensory data to the next hop. Our key idea for guaranteeing reliability is to exploit the on-demand number of cooperative nodes, facilitating the prediction of personalized end-to-end (ETE reliability. Namely, a novel reliability-aware cooperative routing (RCR scheme is proposed to select k-cooperative nodes at every hop (RCR-selection. After selecting k cooperative nodes at every hop, all of the non-cooperative nodes will go into sleep status. In order to solve the cooperative node clustering problem, we propose the RCR-based optimal relay assignment and cooperative data delivery (RCR-delivery scheme to provide a low-communication-overhead data transmission and an optimal duty cycle for a given number of cooperative nodes when the network is dynamic, which enables part of cooperative nodes to switch into idle status for further energy saving. Through the extensive OPNET-based simulations, we show that the proposed scheme significantly outperforms the existing geographic routing schemes and beaconless geographic routings in wireless sensor networks with a highly dynamic wireless channel and controls energy consumption, while ETE reliability is effectively guaranteed.

  6. A Multi-Sensor RSS Spatial Sensing-Based Robust Stochastic Optimization Algorithm for Enhanced Wireless Tethering

    CERN Document Server

    Parasuraman, Ramviyas; Molinari, Luca; Kershaw, Keith; Di Castro, Mario; Masi, Alessandro; Ferre, Manuel

    2014-01-01

    The reliability of wireless communication in a network of mobile wireless robot nodes depends on the received radio signal strength (RSS). When the robot nodes are deployed in hostile environments with ionizing radiations (such as in some scientific facilities), there is a possibility that some electronic components may fail randomly (due to radiation effects), which causes problems in wireless connectivity. The objective of this paper is to maximize robot mission capabilities by maximizing the wireless network capacity and to reduce the risk of communication failure. Thus, in this paper, we consider a multi-node wireless tethering structure called the “server-relay-client” framework that uses (multiple) relay nodes in between a server and a client node. We propose a robust stochastic optimization (RSO) algorithm using a multi-sensor-based RSS sampling method at the relay nodes to efficiently improve and balance the RSS between the source and client nodes to improve the network capacity and to provide red...

  7. Transmit Power Optimisation in Wireless Network

    Directory of Open Access Journals (Sweden)

    Besnik Terziu

    2011-09-01

    Full Text Available Transmit power optimisation in wireless networks based on beamforming have emerged as a promising technique to enhance the spectrum efficiency of present and future wireless communication systems. The aim of this study is to minimise the access point power consumption in cellular networks while maintaining a targeted quality of service (QoS for the mobile terminals. In this study, the targeted quality of service is delivered to a mobile station by providing a desired level of Signal to Interference and Noise Ratio (SINR. Base-stations are coordinated across multiple cells in a multi-antenna beamforming system. This study focuses on a multi-cell multi-antenna downlink scenario where each mobile user is equipped with a single antenna, but where multiple mobile users may be active simultaneously in each cell and are separated via spatial multiplexing using beamforming. The design criteria is to minimize the total weighted transmitted power across the base-stations subject to SINR constraints at the mobile users. The main contribution of this study is to define an iterative algorithm that is capable of finding the joint optimal beamformers for all basestations, based on a correlation-based channel model, the full-correlation model. Among all correlated channel models, the correlated channel model used in this study is the most accurate, giving the best performance in terms of power consumption. The environment here in this study is chosen to be Non-Light of- Sight (NLOS condition, where a signal from a wireless transmitter passes several obstructions before arriving at a wireless receiver. Moreover there are many scatterers local to the mobile, and multiple reflections can occur among them before energy arrives at the mobile. The proposed algorithm is based on uplink-downlink duality using the Lagrangian duality theory. Time-Division Duplex (TDD is chosen as the platform for this study since it has been adopted to the latest technologies in Fourth

  8. McMAC: Towards a MAC Protocol with Multi-Constrained QoS Provisioning for Diverse Traffic in Wireless Body Area Networks

    OpenAIRE

    Monowar, Muhammad; Hassan, Mohammad; Bajaber, Fuad; Al-Hussein, Musaed; Alamri, Atif

    2012-01-01

    The emergence of heterogeneous applications with diverse requirements for resource-constrained Wireless Body Area Networks (WBANs) poses significant challenges for provisioning Quality of Service (QoS) with multi-constraints (delay and reliability) while preserving energy efficiency. To address such challenges, this paper proposes McMAC, a MAC protocol with multi-constrained QoS provisioning for diverse traffic classes in WBANs. McMAC classifies traffic based on their multi-constrained QoS de...

  9. Adaptive multi-node multiple input and multiple output (MIMO) transmission for mobile wireless multimedia sensor networks.

    Science.gov (United States)

    Cho, Sunghyun; Choi, Ji-Woong; You, Cheolwoo

    2013-10-02

    Mobile wireless multimedia sensor networks (WMSNs), which consist of mobile sink or sensor nodes and use rich sensing information, require much faster and more reliable wireless links than static wireless sensor networks (WSNs). This paper proposes an adaptive multi-node (MN) multiple input and multiple output (MIMO) transmission to improve the transmission reliability and capacity of mobile sink nodes when they experience spatial correlation. Unlike conventional single-node (SN) MIMO transmission, the proposed scheme considers the use of transmission antennas from more than two sensor nodes. To find an optimal antenna set and a MIMO transmission scheme, a MN MIMO channel model is introduced first, followed by derivation of closed-form ergodic capacity expressions with different MIMO transmission schemes, such as space-time transmit diversity coding and spatial multiplexing. The capacity varies according to the antenna correlation and the path gain from multiple sensor nodes. Based on these statistical results, we propose an adaptive MIMO mode and antenna set switching algorithm that maximizes the ergodic capacity of mobile sink nodes. The ergodic capacity of the proposed scheme is compared with conventional SN MIMO schemes, where the gain increases as the antenna correlation and path gain ratio increase.

  10. Performance Comparison of Wireless Sensor Network Standard Protocols in an Aerospace Environment: ISA100.11a and ZigBee

    Science.gov (United States)

    Wagner, Raymond S.; Barton, Richard J.

    2011-01-01

    Wireless Sensor Networks (WSNs) can provide a substantial benefit in spacecraft systems, reducing launch weight and providing unprecedented flexibility by allowing instrumentation capabilities to grow and change over time. Achieving data transport reliability on par with that of wired systems, however, can prove extremely challenging in practice. Fortunately, much progress has been made in developing standard WSN radio protocols for applications from non-critical home automation to mission-critical industrial process control. The relative performances of candidate protocols must be compared in representative aerospace environments, however, to determine their suitability for spaceflight applications. In this paper, we will present the results of a rigorous laboratory analysis of the performance of two standards-based, low power, low data rate WSN protocols: ZigBee Pro and ISA100.11a. Both are based on IEEE 802.15.4 and augment that standard's specifications to build complete, multi-hop networking stacks. ZigBee Pro targets primarily the home and office automation markets, providing an ad-hoc protocol that is computationally lightweight and easy to implement in inexpensive system-on-a-chip components. As a result of this simplicity, however, ZigBee Pro can be susceptible to radio frequency (RF) interference. ISA100.11a, on the other hand, targets the industrial process control market, providing a robust, centrally-managed protocol capable of tolerating a significant amount of RF interference. To achieve these gains, a coordinated channel hopping mechanism is employed, which entails a greater computational complexity than ZigBee and requires more sophisticated and costly hardware. To guide future aerospace deployments, we must understand how well these standards relatively perform in analog environments under expected operating conditions. Specifically, we are interested in evaluating goodput -- application level throughput -- in a representative crewed environment

  11. Traffic-Adaptive and Energy-Efficient Small Cell Networks-Energy, Delay and Throughput

    OpenAIRE

    Nazrul Alam, Mirza

    2016-01-01

    The low power small cell network has emerged as a promising and feasible solution to address the massive wireless traffic resulting from the aggressive growth of wireless applications. It is also estimated that Internet of things (IoT) will consist of around 50 billion physical objects by 2020. As a result, besides capacity enhancement, other challenges, e.g., energy efficiency, dynamic addressing of UL/DL traffic asymmetry, low latency, multi-hop communications, reliability and coverage have...

  12. Two Hop Adaptive Vector Based Quality Forwarding for Void Hole Avoidance in Underwater WSNs.

    Science.gov (United States)

    Javaid, Nadeem; Ahmed, Farwa; Wadud, Zahid; Alrajeh, Nabil; Alabed, Mohamad Souheil; Ilahi, Manzoor

    2017-08-01

    Underwater wireless sensor networks (UWSNs) facilitate a wide range of aquatic applications in various domains. However, the harsh underwater environment poses challenges like low bandwidth, long propagation delay, high bit error rate, high deployment cost, irregular topological structure, etc. Node mobility and the uneven distribution of sensor nodes create void holes in UWSNs. Void hole creation has become a critical issue in UWSNs, as it severely affects the network performance. Avoiding void hole creation benefits better coverage over an area, less energy consumption in the network and high throughput. For this purpose, minimization of void hole probability particularly in local sparse regions is focused on in this paper. The two-hop adaptive hop by hop vector-based forwarding (2hop-AHH-VBF) protocol aims to avoid the void hole with the help of two-hop neighbor node information. The other protocol, quality forwarding adaptive hop by hop vector-based forwarding (QF-AHH-VBF), selects an optimal forwarder based on the composite priority function. QF-AHH-VBF improves network good-put because of optimal forwarder selection. QF-AHH-VBF aims to reduce void hole probability by optimally selecting next hop forwarders. To attain better network performance, mathematical problem formulation based on linear programming is performed. Simulation results show that by opting these mechanisms, significant reduction in end-to-end delay and better throughput are achieved in the network.

  13. Neighbor Discovery Algorithm in Wireless Local Area Networks Using Multi-beam Directional Antennas

    Science.gov (United States)

    Wang, Jin; Peng, Wei; Liu, Song

    2017-10-01

    Neighbor discovery is an important step for Wireless Local Area Networks (WLAN) and the use of multi-beam directional antennas can greatly improve the network performance. However, most neighbor discovery algorithms in WLAN, based on multi-beam directional antennas, can only work effectively in synchronous system but not in asynchro-nous system. And collisions at AP remain a bottleneck for neighbor discovery. In this paper, we propose two asynchrono-us neighbor discovery algorithms: asynchronous hierarchical scanning (AHS) and asynchronous directional scanning (ADS) algorithm. Both of them are based on three-way handshaking mechanism. AHS and ADS reduce collisions at AP to have a good performance in a hierarchical way and directional way respectively. In the end, the performance of the AHS and ADS are tested on OMNeT++. Moreover, it is analyzed that different application scenarios and the factors how to affect the performance of these algorithms. The simulation results show that AHS is suitable for the densely populated scenes around AP while ADS is suitable for that most of the neighborhood nodes are far from AP.

  14. Wireless network pricing

    CERN Document Server

    Huang, Jianwei

    2013-01-01

    Today's wireless communications and networking practices are tightly coupled with economic considerations, to the extent that it is almost impossible to make a sound technology choice without understanding the corresponding economic implications. This book aims at providing a foundational introduction on how microeconomics, and pricing theory in particular, can help us to understand and build better wireless networks. The book can be used as lecture notes for a course in the field of network economics, or a reference book for wireless engineers and applied economists to understand how pricing

  15. Multi-Channel Multi-Radio Using 802.11 Based Media Access for Sink Nodes in Wireless Sensor Networks

    OpenAIRE

    Campbell, Carlene E.-A.; Khan, Shafiullah; Singh, Dhananjay; Loo, Kok-Keong

    2011-01-01

    The next generation surveillance and multimedia systems will become increasingly deployed as wireless sensor networks in order to monitor parks, public places and for business usage. The convergence of data and telecommunication over IP-based networks has paved the way for wireless networks. Functions are becoming more intertwined by the compelling force of innovation and technology. For example, many closed-circuit TV premises surveillance systems now rely on transmitting their images and da...

  16. Wireless network system based multi-non-invasive sensors for smart home

    Science.gov (United States)

    Issa Ahmed, Rudhwan

    There are several techniques that have been implemented for smart homes usage; however, most of these techniques are limited to a few sensors. Many of these methods neither meet the needs of the user nor are cost-effective. This thesis discusses the design, development, and implementation of a wireless network system, based on multi-non-invasive sensors for smart home environments. This system has the potential to be used as a means to accurately, and remotely, determine the activities of daily living by continuously monitoring relatively simple parameters that measure the interaction between users and their surrounding environment. We designed and developed a prototype system to meet the specific needs of the elderly population. Unlike audio-video based health monitoring systems (which have associated problems such as the encroachment of privacy), the developed system's distinct features ensure privacy and are almost invisible to the occupants, thus increasing the acceptance levels of this system in household environments. The developed system not only achieved high levels of accuracy, but it is also portable, easy to use, cost-effective, and requires low data rates and less power compared to other wireless devices such as Wi-Fi, Bluetooth, wireless USB, Ultra wideband (UWB), or Infrared (IR) wireless. Field testing of the prototype system was conducted at different locations inside and outside of the Minto Building (Centre for Advanced Studies in Engineering at Carleton University) as well as other locations, such as the washroom, kitchen, and living room of a prototype apartment. The main goal of the testing was to determine the range of the prototype system and the functionality of each sensor in different environments. After it was verified that the system operated well in all of the tested environments, data were then collected at the different locations for analysis and interpretation in order to identify the activities of daily living of an occupant.

  17. Cooperative networking in a heterogeneous wireless medium

    CERN Document Server

    Ismail, Muhammad

    2013-01-01

    This brief focuses on radio resource allocation in a heterogeneous wireless medium. It presents radio resource allocation algorithms with decentralized implementation, which support both single-network and multi-homing services. The brief provides a set of cooperative networking algorithms, which rely on the concepts of short-term call traffic load prediction, network cooperation, convex optimization, and decomposition theory. In the proposed solutions, mobile terminals play an active role in the resource allocation operation, instead of their traditional role as passive service recipients in the networking environment.

  18. Multi-Destination Cognitive Radio Relay Network with SWIPT and Multiple Primary Receivers

    KAUST Repository

    Al-Habob, Ahmed A.

    2017-05-12

    In this paper, we study the performance of simultaneous wireless information and power transfer (SWIPT) technique in a multi-destination dual-hop underlay cognitive relay network with multiple primary receivers. Information transmission from the secondary source to destinations is performed entirely via a decode- and-forward (DF) relay. The relay is assumed to have no embedded power source and to harvest energy from the source signal using a power splitting (PS) protocol and employing opportunistic scheduling to forward the information to the selected destination. We derive analytical expressions for the outage probability assuming Rayleigh fading channels and considering the energy harvesting efficiency at relay, the source maximum transmit power and primary receivers interference constraints. The system performance is also studied at high signal-to-noise ratio (SNR) values where approximate expressions for the outage probability are provided and analyzed in terms of diversity order and coding gain. Monte-Carlo simulations and some numerical examples are provided to validate the derived expressions and to illustrate the effect of various system parameters on the system performance. In contrast to their conventional counterparts where a multi- destination diversity is usually achieved, the results show that the multi-destination cognitive radio relay networks with the SWIPT technique achieve a constant diversity order of one.

  19. Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Roy Sohini

    2015-09-01

    Full Text Available Wireless Sensor Network (WSN has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC.

  20. Energy-efficient Organization of Wireless Sensor Networks with Adaptive Forecasting

    Directory of Open Access Journals (Sweden)

    Dao-Wei Bi

    2008-04-01

    Full Text Available Due to the wide potential applications of wireless sensor networks, this topic has attracted great attention. The strict energy constraints of sensor nodes result in great challenges for energy efficiency. This paper proposes an energy-efficient organization method. The organization of wireless sensor networks is formulated for target tracking. Target localization is achieved by collaborative sensing with multi-sensor fusion. The historical localization results are utilized for adaptive target trajectory forecasting. Combining autoregressive moving average (ARMA model and radial basis function networks (RBFNs, robust target position forecasting is performed. Moreover, an energyefficient organization method is presented to enhance the energy efficiency of wireless sensor networks. The sensor nodes implement sensing tasks are awakened in a distributed manner. When the sensor nodes transfer their observations to achieve data fusion, the routing scheme is obtained by ant colony optimization. Thus, both the operation and communication energy consumption can be minimized. Experimental results verify that the combination of ARMA model and RBFN can estimate the target position efficiently and energy saving is achieved by the proposed organization method in wireless sensor networks.

  1. Optimizing Energy and Modulation Selection in Multi-Resolution Modulation For Wireless Video Broadcast/Multicast

    KAUST Repository

    She, James

    2009-11-01

    Emerging technologies in Broadband Wireless Access (BWA) networks and video coding have enabled high-quality wireless video broadcast/multicast services in metropolitan areas. Joint source-channel coded wireless transmission, especially using hierarchical/superposition coded modulation at the channel, is recognized as an effective and scalable approach to increase the system scalability while tackling the multi-user channel diversity problem. The power allocation and modulation selection problem, however, is subject to a high computational complexity due to the nonlinear formulation and huge solution space. This paper introduces a dynamic programming framework with conditioned parsing, which significantly reduces the search space. The optimized result is further verified with experiments using real video content. The proposed approach effectively serves as a generalized and practical optimization framework that can gauge and optimize a scalable wireless video broadcast/multicast based on multi-resolution modulation in any BWA network.

  2. Optimizing Energy and Modulation Selection in Multi-Resolution Modulation For Wireless Video Broadcast/Multicast

    KAUST Repository

    She, James; Ho, Pin-Han; Shihada, Basem

    2009-01-01

    Emerging technologies in Broadband Wireless Access (BWA) networks and video coding have enabled high-quality wireless video broadcast/multicast services in metropolitan areas. Joint source-channel coded wireless transmission, especially using hierarchical/superposition coded modulation at the channel, is recognized as an effective and scalable approach to increase the system scalability while tackling the multi-user channel diversity problem. The power allocation and modulation selection problem, however, is subject to a high computational complexity due to the nonlinear formulation and huge solution space. This paper introduces a dynamic programming framework with conditioned parsing, which significantly reduces the search space. The optimized result is further verified with experiments using real video content. The proposed approach effectively serves as a generalized and practical optimization framework that can gauge and optimize a scalable wireless video broadcast/multicast based on multi-resolution modulation in any BWA network.

  3. Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks.

    Science.gov (United States)

    Kim, Daehee; Kim, Dongwan; An, Sunshin

    2016-07-09

    Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption.

  4. Performance evaluation of multi-channel wireless mesh networks with embedded systems.

    Science.gov (United States)

    Lam, Jun Huy; Lee, Sang-Gon; Tan, Whye Kit

    2012-01-01

    Many commercial wireless mesh network (WMN) products are available in the marketplace with their own proprietary standards, but interoperability among the different vendors is not possible. Open source communities have their own WMN implementation in accordance with the IEEE 802.11s draft standard, Linux open80211s project and FreeBSD WMN implementation. While some studies have focused on the test bed of WMNs based on the open80211s project, none are based on the FreeBSD. In this paper, we built an embedded system using the FreeBSD WMN implementation that utilizes two channels and evaluated its performance. This implementation allows the legacy system to connect to the WMN independent of the type of platform and distributes the load between the two non-overlapping channels. One channel is used for the backhaul connection and the other one is used to connect to the stations to wireless mesh network. By using the power efficient 802.11 technology, this device can also be used as a gateway for the wireless sensor network (WSN).

  5. Dealing with Wormhole Attacks in Wireless Sensor Networks Through Discovering Separate Routes Between Nodes

    Directory of Open Access Journals (Sweden)

    F. Rezaei

    2017-08-01

    Full Text Available One of the most common attacks against Wireless Sensor Networks is the wormhole attack. In this attack, the enemy deploys two malicious nodes in two different areas of the network and establishes a high-speed dedicated channel between these two. This will cause the normal nodes in two different areas wrongly think that they are two-hop neighbors. Therefore, this attack will greatly affect the routing algorithms. In this paper, a new distributed algorithm is provided to deal with the wormhole attack. The main idea of the proposed algorithm is to discover separate routes between pairs of two-hop neighboring nodes. The proposed algorithm was implemented and evaluated in terms of true and false detection rate by performing a series of experiments and the results were compared with the base algorithm. The test results showed that the proposed algorithm has desirable efficacy.

  6. Nearest neighbor imputation using spatial-temporal correlations in wireless sensor networks.

    Science.gov (United States)

    Li, YuanYuan; Parker, Lynne E

    2014-01-01

    Missing data is common in Wireless Sensor Networks (WSNs), especially with multi-hop communications. There are many reasons for this phenomenon, such as unstable wireless communications, synchronization issues, and unreliable sensors. Unfortunately, missing data creates a number of problems for WSNs. First, since most sensor nodes in the network are battery-powered, it is too expensive to have the nodes retransmit missing data across the network. Data re-transmission may also cause time delays when detecting abnormal changes in an environment. Furthermore, localized reasoning techniques on sensor nodes (such as machine learning algorithms to classify states of the environment) are generally not robust enough to handle missing data. Since sensor data collected by a WSN is generally correlated in time and space, we illustrate how replacing missing sensor values with spatially and temporally correlated sensor values can significantly improve the network's performance. However, our studies show that it is important to determine which nodes are spatially and temporally correlated with each other. Simple techniques based on Euclidean distance are not sufficient for complex environmental deployments. Thus, we have developed a novel Nearest Neighbor (NN) imputation method that estimates missing data in WSNs by learning spatial and temporal correlations between sensor nodes. To improve the search time, we utilize a k d-tree data structure, which is a non-parametric, data-driven binary search tree. Instead of using traditional mean and variance of each dimension for k d-tree construction, and Euclidean distance for k d-tree search, we use weighted variances and weighted Euclidean distances based on measured percentages of missing data. We have evaluated this approach through experiments on sensor data from a volcano dataset collected by a network of Crossbow motes, as well as experiments using sensor data from a highway traffic monitoring application. Our experimental

  7. Design of Early Warning System Based on Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Gan Bo

    2018-01-01

    Full Text Available In order to solve the shortcomings of the landslide monitoring technology method, a set of landslides monitoring and early warning system is designed. It can achieve real-time sensor data acquisition, remote transmission and query display. In addition, aiming at the harsh environment of landslide monitoring and the performance requirements of the monitoring system, an improved minimum hop routing protocol is proposed. It can reduce network energy consumption, enhance network robustness, and improve node layout and networking flexibility. In order to realize the remote transmission of data, GPRS wireless communication is used to transmit monitoring data. Combined with remote monitoring center, real-time data display, query, preservation and landslide warning and prediction are realized. The results show that the sensor data acquisition system is accurate, the system is stable, and the node network is flexible. Therefore, the monitoring system has a good use value.

  8. Wireless network security theories and applications

    CERN Document Server

    Chen, Lei; Zhang, Zihong

    2013-01-01

    Wireless Network Security Theories and Applications discusses the relevant security technologies, vulnerabilities, and potential threats, and introduces the corresponding security standards and protocols, as well as provides solutions to security concerns. Authors of each chapter in this book, mostly top researchers in relevant research fields in the U.S. and China, presented their research findings and results about the security of the following types of wireless networks: Wireless Cellular Networks, Wireless Local Area Networks (WLANs), Wireless Metropolitan Area Networks (WMANs), Bluetooth

  9. Feedback Reduction in Broadcast and two Hop Multiuser Networks: A Compressed Sensing Approach

    KAUST Repository

    Shibli, Hussain J.

    2013-05-21

    In multiuser wireless networks, the base stations (BSs) rely on the channel state information (CSI) of the users to in order to perform user scheduling and downlink transmission. While the downlink channels can be easily estimated at all user terminals via a single broadcast, several key challenges are faced during uplink (feedback) transmission. Firstly, the noisy and fading feedback channels are usually unknown at the base station, and therefore, channel training is usually required from all users. Secondly, the amount of air-time required for feedback transmission grows linearly with the number of users. This domination of the network resources by feedback information leads to increased scheduling delay and outdated CSI at the BS. In this thesis, we tackle the above challenges and propose feedback reduction algorithms based on the theory of compressive sensing (CS). The proposed algorithms encompass both single and dual hop wireless networks, and; i) permit the BS to obtain CSI with acceptable recovery guarantees under substantially reduced feedback overhead, ii) are agnostic to the statistics of the feedback channels, and iii) utilize the apriori statistics of the additive noise to identify strong users. Numerical results show that the proposed algorithms are able to reduce the feedback overhead, improve detection at the BS, and achieve a sum-rate close to that obtained by noiseless dedicated feedback algorithms.

  10. Multi-Channel Wireless Sensor Networks: Protocols, Design and Evaluation

    NARCIS (Netherlands)

    Durmaz, O.

    2009-01-01

    Pervasive systems, which are described as networked embedded systems integrated with everyday environments, are considered to have the potential to change our daily lives by creating smart surroundings and by their ubiquity, just as the Internet. In the last decade, “Wireless Sensor Networks��? have

  11. Recognizing Multi-user Activities using Body Sensor Networks

    DEFF Research Database (Denmark)

    Gu, Tao; Wang, Liang; Chen, Hanhua

    2011-01-01

    The advances of wireless networking and sensor technology open up an interesting opportunity to infer human activities in a smart home environment. Existing work in this paradigm focuses mainly on recognizing activities of a single user. In this work, we address the fundamental problem...... activity classes of data—for building activity models and design a scalable, noise-resistant, Emerging Pattern based Multi-user Activity Recognizer (epMAR) to recognize both single- and multi-user activities. We develop a multi-modal, wireless body sensor network for collecting real-world traces in a smart...... home environment, and conduct comprehensive empirical studies to evaluate our system. Results show that epMAR outperforms existing schemes in terms of accuracy, scalability and robustness....

  12. Source Authentication for Code Dissemination Supporting Dynamic Packet Size in Wireless Sensor Networks

    Science.gov (United States)

    Kim, Daehee; Kim, Dongwan; An, Sunshin

    2016-01-01

    Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption. PMID:27409616

  13. On-Demand Routing in Multi-hop Wireless Mobile Ad Hoc Networks

    National Research Council Canada - National Science Library

    Maltz, David A

    2001-01-01

    .... Routing protocols used in ad hoc networks must automatically adjust to environments that can vary between the extremes of high mobility with low bandwidth, and low mobility with high bandwidth...

  14. Full-diversity partial interference cancellation for multi-user wireless relaying networks

    KAUST Repository

    El Astal, M. T O

    2013-12-01

    We focus on the uplink channel of multi-user wireless relaying networks in a coverage extension scenario. The network consists of two users, a single half duplex (HD) relay and a destination, all equipped with multiple antennas. Perfect channel state information (CSI) is assumed to be available exclusively at the receiving nodes (i.e., the relay and the destination) while the users are assumed to be completely blind. The communication through the considered network takes place over two phases. During the first phase, both users send their information concurrently to the relay. The second phase consists of decoding the received data and forwarding it simultaneously to the destination. A transmission scheme that achieves full-diversity under partial interference cancellation (PIC) group decoding is proposed. Unlike many existing schemes, it allows the concurrent transmission in both phases while achieving the full-diversity gain of full time division multiple access (TDMA) transmission regardless of the number of antennas at each node. Numerical comparison with existing schemes in the literature is provided to corroborate our theoretical claims. It is found that our interference cancellation (IC) scheme clearly outperforms existing schemes at the expense of an affordable increase in decoding complexity at both of the relay and destination. © 2013 IEEE.

  15. Full-diversity partial interference cancellation for multi-user wireless relaying networks

    KAUST Repository

    El Astal, M. T O; Ismail, Amr; Alouini, Mohamed-Slim; Olivier, Jan Corné

    2013-01-01

    We focus on the uplink channel of multi-user wireless relaying networks in a coverage extension scenario. The network consists of two users, a single half duplex (HD) relay and a destination, all equipped with multiple antennas. Perfect channel state information (CSI) is assumed to be available exclusively at the receiving nodes (i.e., the relay and the destination) while the users are assumed to be completely blind. The communication through the considered network takes place over two phases. During the first phase, both users send their information concurrently to the relay. The second phase consists of decoding the received data and forwarding it simultaneously to the destination. A transmission scheme that achieves full-diversity under partial interference cancellation (PIC) group decoding is proposed. Unlike many existing schemes, it allows the concurrent transmission in both phases while achieving the full-diversity gain of full time division multiple access (TDMA) transmission regardless of the number of antennas at each node. Numerical comparison with existing schemes in the literature is provided to corroborate our theoretical claims. It is found that our interference cancellation (IC) scheme clearly outperforms existing schemes at the expense of an affordable increase in decoding complexity at both of the relay and destination. © 2013 IEEE.

  16. Capacity Analysis of Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    M. I. Gumel

    2012-06-01

    Full Text Available The next generation wireless networks experienced a great development with emergence of wireless mesh networks (WMNs, which can be regarded as a realistic solution that provides wireless broadband access. The limited available bandwidth makes capacity analysis of the network very essential. While the network offers broadband wireless access to community and enterprise users, the problems that limit the network capacity must be addressed to exploit the optimum network performance. The wireless mesh network capacity analysis shows that the throughput of each mesh node degrades in order of l/n with increasing number of nodes (n in a linear topology. The degradation is found to be higher in a fully mesh network as a result of increase in interference and MAC layer contention in the network.

  17. Wireless rechargeable sensor networks

    CERN Document Server

    Yang, Yuanyuan

    2015-01-01

    This SpringerBrief provides a concise guide to applying wireless energy transfer techniques in traditional battery-powered sensor networks. It examines the benefits and challenges of wireless power including efficiency and reliability. The authors build a wireless rechargeable sensor networks from scratch and aim to provide perpetual network operation. Chapters cover a wide range of topics from the collection of energy information and recharge scheduling to joint design with typical sensing applications such as data gathering. Problems are approached using a natural combination of probability

  18. Emerging wireless networks concepts, techniques and applications

    CERN Document Server

    Makaya, Christian

    2011-01-01

    An authoritative collection of research papers and surveys, Emerging Wireless Networks: Concepts, Techniques, and Applications explores recent developments in next-generation wireless networks (NGWNs) and mobile broadband networks technologies, including 4G (LTE, WiMAX), 3G (UMTS, HSPA), WiFi, mobile ad hoc networks, mesh networks, and wireless sensor networks. Focusing on improving the performance of wireless networks and provisioning better quality of service and quality of experience for users, it reports on the standards of different emerging wireless networks, applications, and service fr

  19. Novel Concepts of Cooperative Wireless Networking

    DEFF Research Database (Denmark)

    Zhang, Qi

    2008-01-01

    ; secondly, the increasing density of the wireless devices makes cooperation possible; last, the cost of information exchange (i.e. transmission power, transmission time, spectrum, etc.) is very low if information exchange over short-range link is needed. Cooperation changes the way of information delivery......Although wireless networks have achieved great success in the lastest two decades, the current wireless networks have difficulties to fulll users' ever-increasing expectations and needs. It is mainly due to available spectrum resource scarcity, limited battery capacity of wireless device......, unreliable wireless radio link, etc. To tackle these issues, a new telecommunication paradigm has been proposed, referred to as cooperative wireless networking [1]. The basic idea of cooperative wireless networking is that wireless devices work together to achieve their individual goals or one common goal...

  20. A feedback-retransmission based asynchronous frequency hopping MAC protocol for military aeronautical ad hoc networks

    Directory of Open Access Journals (Sweden)

    Jinhui TANG

    2018-05-01

    Full Text Available Attacking time-sensitive targets has rigid demands for the timeliness and reliability of information transmission, while typical Media Access Control (MAC designed for this application works well only in very light-load scenarios; as a consequence, the performances of system throughput and channel utilization are degraded. For this problem, a feedback-retransmission based asynchronous FRequency hopping Media Access (FRMA control protocol is proposed. Burst communication, asynchronous Frequency Hopping (FH, channel coding, and feedback retransmission are utilized in FRMA. With the mechanism of asynchronous FH, immediate packet transmission and multi-packet reception can be realized, and thus the timeliness is improved. Furthermore, reliability can be achieved via channel coding and feedback retransmission. With theories of queuing theory, Markov model, packets collision model, and discrete Laplace transformation, the formulas of packet success probability, system throughput, average packet end-to-end delay, and delay distribution are obtained. The approximation accuracy of theoretical derivation is verified by experimental results. Within a light-load network, the proposed FRMA has the ability of millisecond delay and 99% reliability as well as outperforms the non-feedback-retransmission based asynchronous frequency hopping media access control protocol. Keywords: Ad hoc networks, Aeronautical communications, Frequency hopping, Media Access Control (MAC, Time-sensitive

  1. Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sohail Jabbar

    2015-01-01

    Full Text Available Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

  2. Sustainable wireless networks

    CERN Document Server

    Zheng, Zhongming; Xuemin

    2013-01-01

    This brief focuses on network planning and resource allocation by jointly considering cost and energy sustainability in wireless networks with sustainable energy. The characteristics of green energy and investigating existing energy-efficient green approaches for wireless networks with sustainable energy is covered in the first part of this brief. The book then addresses the random availability and capacity of the energy supply. The authors explore how to maximize the energy sustainability of the network and minimize the failure probability that the mesh access points (APs) could deplete their

  3. Lifetime Optimization of a Multiple Sink Wireless Sensor Network through Energy Balancing

    Directory of Open Access Journals (Sweden)

    Tapan Kumar Jain

    2015-01-01

    Full Text Available The wireless sensor network consists of small limited energy sensors which are connected to one or more sinks. The maximum energy consumption takes place in communicating the data from the nodes to the sink. Multiple sink WSN has an edge over the single sink WSN where very less energy is utilized in sending the data to the sink, as the number of hops is reduced. If the energy consumed by a node is balanced between the other nodes, the lifetime of the network is considerably increased. The network lifetime optimization is achieved by restructuring the network by modifying the neighbor nodes of a sink. Only those nodes are connected to a sink which makes the total energy of the sink less than the threshold. This energy balancing through network restructuring optimizes the network lifetime. This paper depicts this fact through simulations done in MATLAB.

  4. Application for vibration monitoring of aspheric surface machining based on wireless sensor networks

    Science.gov (United States)

    Han, Chun Guang; Guo, Yin Biao; Jiang, Chen

    2010-05-01

    Any kinds of tiny vibration of machine tool parts will have a great influence on surface quality of the workpiece at ultra-precise machining process of aspheric surface. At present the major way for decreasing influence of vibration is machining compensation technology. Therefore it is important for machining compensation control to acquire and transmit these vibration signals effectively. This paper presents a vibration monitoring system of aspheric surface machining machine tool based on wireless sensor networks (WSN). Some key issues of wireless sensor networks for vibration monitoring system of aspheric surface machining are discussed. The reliability of data transmission, network communication protocol and synchronization mechanism of wireless sensor networks are studied for the vibration monitoring system. The proposed system achieves multi-sensors vibration monitoring involving the grinding wheel, the workpiece and the workbench spindle. The wireless transmission of vibration signals is achieved by the combination with vibration sensor nodes and wireless network. In this paper, these vibration sensor nodes are developed. An experimental platform is structured which employs wireless sensor networks to the vibration monitoring system in order to test acquisition and wireless transmission of vibration signal. The test results show that the proposed system can achieve vibration data transmission effectively and reliability and meet the monitoring requirements of aspheric surface machining machine tool.

  5. Is a Multi-Hop Relay Scheme Gainful in an IEEE 802.22-Based Cognitive Radio System?

    Science.gov (United States)

    Shin, Jungchae; Lee, Dong-Kyu; Cho, Ho-Shin

    In this paper, we formulate a plan to operate multi-hop relays in IEEE 802.22-based cognitive radio (CR) systems and evaluate system performance to consider the propriety of a multi-hop relay scheme in CR systems. A centralized radio resource management and a simple deployment of relay stations (RSs) are assessed to make relay operations feasible under CR conditions. Simulation results show that the proposed multi-hop relay scheme significantly increases system throughput compared to a no-relay CR system as the incumbent user (IU) traffic gets heavier. Furthermore, the optimal number of hops can be determined given the traffic conditions.

  6. Intrusion detection in wireless ad-hoc networks

    CERN Document Server

    Chaki, Nabendu

    2014-01-01

    Presenting cutting-edge research, Intrusion Detection in Wireless Ad-Hoc Networks explores the security aspects of the basic categories of wireless ad-hoc networks and related application areas. Focusing on intrusion detection systems (IDSs), it explains how to establish security solutions for the range of wireless networks, including mobile ad-hoc networks, hybrid wireless networks, and sensor networks.This edited volume reviews and analyzes state-of-the-art IDSs for various wireless ad-hoc networks. It includes case studies on honesty-based intrusion detection systems, cluster oriented-based

  7. An Integrated Environment Monitoring System for Underground Coal Mines—Wireless Sensor Network Subsystem with Multi-Parameter Monitoring

    OpenAIRE

    Zhang, Yu; Yang, Wei; Han, Dongsheng; Kim, Young-Il

    2014-01-01

    Environment monitoring is important for the safety of underground coal mine production, and it is also an important application of Wireless Sensor Networks (WSNs). We put forward an integrated environment monitoring system for underground coal mine, which uses the existing Cable Monitoring System (CMS) as the main body and the WSN with multi-parameter monitoring as the supplementary technique. As CMS techniques are mature, this paper mainly focuses on the WSN and the interconnection between t...

  8. Voice Quality Estimation in Wireless Networks

    Directory of Open Access Journals (Sweden)

    Petr Zach

    2015-01-01

    Full Text Available This article deals with the impact of Wireless (Wi-Fi networks on the perceived quality of voice services. The Quality of Service (QoS metrics must be monitored in the computer network during the voice data transmission to ensure proper voice service quality the end-user has paid for, especially in the wireless networks. In addition to the QoS, research area called Quality of Experience (QoE provides metrics and methods for quality evaluation from the end-user’s perspective. This article focuses on a QoE estimation of Voice over IP (VoIP calls in the wireless networks using network simulator. Results contribute to voice quality estimation based on characteristics of the wireless network and location of a wireless client.

  9. An Energy Efficient Cooperative Hierarchical MIMO Clustering Scheme for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sungyoung Lee

    2011-12-01

    Full Text Available In this work, we present an energy efficient hierarchical cooperative clustering scheme for wireless sensor networks. Communication cost is a crucial factor in depleting the energy of sensor nodes. In the proposed scheme, nodes cooperate to form clusters at each level of network hierarchy ensuring maximal coverage and minimal energy expenditure with relatively uniform distribution of load within the network. Performance is enhanced by cooperative multiple-input multiple-output (MIMO communication ensuring energy efficiency for WSN deployments over large geographical areas. We test our scheme using TOSSIM and compare the proposed scheme with cooperative multiple-input multiple-output (CMIMO clustering scheme and traditional multihop Single-Input-Single-Output (SISO routing approach. Performance is evaluated on the basis of number of clusters, number of hops, energy consumption and network lifetime. Experimental results show significant energy conservation and increase in network lifetime as compared to existing schemes.

  10. Security For Wireless Sensor Network

    OpenAIRE

    Saurabh Singh,; Dr. Harsh Kumar Verma

    2011-01-01

    Wireless sensor network is highly vulnerable to attacks because it consists of various resourceconstrained devices with their low battery power, less memory, and associated low energy. Sensor nodescommunicate among themselves via wireless links. However, there are still a lot of unresolved issues in wireless sensor networks of which security is one of the hottest research issues. Sensor networks aredeployed in hostile environments. Environmental conditions along with resource-constraints give...

  11. Efficient Information Dissemination in Wireless Sensor Networks using Mobile Sinks

    National Research Council Canada - National Science Library

    Vincze, Zoltan; Vidacs, Attila; Vida, Rolland

    2006-01-01

    ...; therefore, relaying information between sensors and a sink node, possibly over multiple wireless hops, in an energy-efficient manner is a challenging task that preoccupies the research community for some time now...

  12. Medium Access Control for Opportunistic Concurrent Transmissions under Shadowing Channels.

    Science.gov (United States)

    Son, In Keun; Mao, Shiwen; Hur, Seung Min

    2009-01-01

    We study the problem of how to alleviate the exposed terminal effect in multi-hop wireless networks in the presence of log-normal shadowing channels. Assuming node location information, we propose an extension of the IEEE 802.11 MAC protocol that sched-ules concurrent transmissions in the presence of log-normal shadowing, thus mitigating the exposed terminal problem and improving network throughput and delay performance. We observe considerable improvements in throughput and delay achieved over the IEEE 802.11 MAC under various network topologies and channel conditions in ns-2 simulations, which justify the importance of considering channel randomness in MAC protocol design for multi-hop wireless networks.

  13. Totally opportunistic routing algorithm (TORA) for underwater wireless sensor network

    Science.gov (United States)

    Hashim, Fazirulhisyam; Rasid, Mohd Fadlee A.; Othman, Mohamed

    2018-01-01

    Underwater Wireless Sensor Network (UWSN) has emerged as promising networking techniques to monitor and explore oceans. Research on acoustic communication has been conducted for decades, but had focused mostly on issues related to physical layer such as high latency, low bandwidth, and high bit error. However, data gathering process is still severely limited in UWSN due to channel impairment. One way to improve data collection in UWSN is the design of routing protocol. Opportunistic Routing (OR) is an emerging technique that has the ability to improve the performance of wireless network, notably acoustic network. In this paper, we propose an anycast, geographical and totally opportunistic routing algorithm for UWSN, called TORA. Our proposed scheme is designed to avoid horizontal transmission, reduce end to end delay, overcome the problem of void nodes and maximize throughput and energy efficiency. We use TOA (Time of Arrival) and range based equation to localize nodes recursively within a network. Once nodes are localized, their location coordinates and residual energy are used as a matrix to select the best available forwarder. All data packets may or may not be acknowledged based on the status of sender and receiver. Thus, the number of acknowledgments for a particular data packet may vary from zero to 2-hop. Extensive simulations were performed to evaluate the performance of the proposed scheme for high network traffic load under very sparse and very dense network scenarios. Simulation results show that TORA significantly improves the network performance when compared to some relevant existing routing protocols, such as VBF, HHVBF, VAPR, and H2DAB, for energy consumption, packet delivery ratio, average end-to-end delay, average hop-count and propagation deviation factor. TORA reduces energy consumption by an average of 35% of VBF, 40% of HH-VBF, 15% of VAPR, and 29% of H2DAB, whereas the packet delivery ratio has been improved by an average of 43% of VBF, 26

  14. Totally opportunistic routing algorithm (TORA) for underwater wireless sensor network.

    Science.gov (United States)

    Rahman, Ziaur; Hashim, Fazirulhisyam; Rasid, Mohd Fadlee A; Othman, Mohamed

    2018-01-01

    Underwater Wireless Sensor Network (UWSN) has emerged as promising networking techniques to monitor and explore oceans. Research on acoustic communication has been conducted for decades, but had focused mostly on issues related to physical layer such as high latency, low bandwidth, and high bit error. However, data gathering process is still severely limited in UWSN due to channel impairment. One way to improve data collection in UWSN is the design of routing protocol. Opportunistic Routing (OR) is an emerging technique that has the ability to improve the performance of wireless network, notably acoustic network. In this paper, we propose an anycast, geographical and totally opportunistic routing algorithm for UWSN, called TORA. Our proposed scheme is designed to avoid horizontal transmission, reduce end to end delay, overcome the problem of void nodes and maximize throughput and energy efficiency. We use TOA (Time of Arrival) and range based equation to localize nodes recursively within a network. Once nodes are localized, their location coordinates and residual energy are used as a matrix to select the best available forwarder. All data packets may or may not be acknowledged based on the status of sender and receiver. Thus, the number of acknowledgments for a particular data packet may vary from zero to 2-hop. Extensive simulations were performed to evaluate the performance of the proposed scheme for high network traffic load under very sparse and very dense network scenarios. Simulation results show that TORA significantly improves the network performance when compared to some relevant existing routing protocols, such as VBF, HHVBF, VAPR, and H2DAB, for energy consumption, packet delivery ratio, average end-to-end delay, average hop-count and propagation deviation factor. TORA reduces energy consumption by an average of 35% of VBF, 40% of HH-VBF, 15% of VAPR, and 29% of H2DAB, whereas the packet delivery ratio has been improved by an average of 43% of VBF, 26

  15. Decentralized Enterprise Systems: A Multi-platform Wireless Sensor Networks Approach

    NARCIS (Netherlands)

    Marin Perianu, Mihai; Meratnia, Nirvana; Havinga, Paul J.M.; Moreira Sá de Souza, L.; Müller, J.; Spiess, P.; Haller, S.; Riedel, T.; Decker, C.; Stromberg, G.

    2007-01-01

    Massively deployed wireless sensor and actuator networks, co-existing with RFID technology, can bring clear benefits to large-scale enterprise systems, by delegating parts of the business functionality closer to the point of action. However, a major impediment in the integration process is

  16. Evolution of Heterogeneous Wireless Networks

    DEFF Research Database (Denmark)

    Zhang, Q.; Fitzek, Frank; Katz, Marcos

    2006-01-01

    Mobile and wireless content, services and networks - Short-term and long-term development trends......Mobile and wireless content, services and networks - Short-term and long-term development trends...

  17. Proxy SDN Controller for Wireless Networks

    Directory of Open Access Journals (Sweden)

    Won-Suk Kim

    2016-01-01

    Full Text Available Management of wireless networks as well as wired networks by using software-defined networking (SDN has been highlighted continually. However, control features of a wireless network differ from those of a wired network in several aspects. In this study, we identify the various inefficient points when controlling and managing wireless networks by using SDN and propose SDN-based control architecture called Proxcon to resolve these problems. Proxcon introduces the concept of a proxy SDN controller (PSC for the wireless network control, and the PSC entrusted with the role of a main controller performs control operations and provides the latest network state for a network administrator. To address the control inefficiency, Proxcon supports offloaded SDN operations for controlling wireless networks by utilizing the PSC, such as local control by each PSC, hybrid control utilizing the PSC and the main controller, and locally cooperative control utilizing the PSCs. The proposed architecture and the newly supported control operations can enhance scalability and response time when the logically centralized control plane responds to the various wireless network events. Through actual experiments, we verified that the proposed architecture could address the various control issues such as scalability, response time, and control overhead.

  18. Interference Information Based Power Control for Cognitive Radio with Multi-Hop Cooperative Sensing

    Science.gov (United States)

    Yu, Youngjin; Murata, Hidekazu; Yamamoto, Koji; Yoshida, Susumu

    Reliable detection of other radio systems is crucial for systems that share the same frequency band. In wireless communication channels, there is uncertainty in the received signal level due to multipath fading and shadowing. Cooperative sensing techniques in which radio stations share their sensing information can improve the detection probability of other systems. In this paper, a new cooperative sensing scheme that reduces the false detection probability while maintaining the outage probability of other systems is investigated. In the proposed system, sensing information is collected using multi-hop transmission from all sensing stations that detect other systems, and transmission decisions are based on the received sensing information. The proposed system also controls the transmit power based on the received CINRs from the sensing stations. Simulation results reveal that the proposed system can reduce the outage probability of other systems, or improve its link success probability.

  19. Attacks on IEEE 802.11 wireless networks

    Directory of Open Access Journals (Sweden)

    Dejan Milan Tepšić

    2013-06-01

    Full Text Available Security of wireless computer networks was initially secured with the WEP security protocol, which relies on the RC4 encryption algorithm and the CRC algorithm to check the integrity. The basic problems of the WEP are a short initialization vector, unsafe data integrity checking, using a common key, the lack of mechanisms for management and exchange of keys, the lack of protection from the endless insertion of the same package into the network, the lack of authentication of access points and the like. The consequences of these failures are easy attacks against the WEP network, namely their complete insecurity. Therefore, the work began on the IEEE 802.11i protocol, which should radically improve the security of wireless networks. Since the development of a protocol lasted, the WPA standard was released to offset the security gap caused by the WEP. The WPA also relies on RC4 and CRC algorithms, but brings temporary keys and the MIC algorithm for data integrity. The 802.1X authentication was introduced and common keys are no longer needed, since it is possible to use an authentication server. The length of the initialization vector was increased and the vector is obtained based on the packet serial number, in order to prevent the insertion of the same packet into the network. The weakness of the WPA security mechanism is the use of a common key. WPA2 (802.11i later appeared. Unlike the WPA mechanism that worked on old devices with the replacement of software, WPA2 requires new network devices that can perform AES encryption. AES replaces the RC4 algorithm and delivers much greater security. Data integrity is protected by encryption. Despite progress, there are still weaknesses in wireless networks. Attacks for denial of service are possible as well as spoofing package headers attacks. For now, it is not advisable to use wireless networks in environments where unreliability and unavailability are not tolerated. Introduction In the entire history of

  20. WSN ene rgy balance multi-hop lc ustering routing algorithm%能量均衡多跳分簇路由算法

    Institute of Scientific and Technical Information of China (English)

    叶润; 王缓缓

    2014-01-01

    The lifetime of ZigBee wireless sensor network is directly related to energy consumption of nodes .In order to extend the life of the network, the clustering routing methods are used.The improved clustering routing algo-rithm-EBMHC ( energy balance multi-hop clustering routing algorithm) , which adopts centralized rotation-cluste-ring method and distributed competition method of cluster head.This makes the network’ s idle nodes sleep and cluster head node work acting as multiple transmission.It also has data fusion and routing maintenance in a single cycle, so as to make full and effective use of network energy.Hierarchical management can solve imbalance of net-work node energy consumption.The simulation shows that EBMHC algorithm outperforms LEACH and SEP, making the network energy consumption more balanced and prolonging the network lifetime.%ZigBee无线传感器网络的生存寿命与节点的能耗直接相关。为了延长网络的寿命,通常采用分簇路由方法。通过集中成簇管理以及分布簇头竞争的能量均衡多跳分簇路由算法EBMHC( energy balance multi-hop clustering rou-ting algorithm),在一个周期内,使得网络空闲节点休眠,簇头节点担任多条传输、数据融合以及路由维护的功能,以充分有效利用网络能量。分层管理方式可以缓解网络节点能耗不均衡问题。通过仿真表明, EBMHC算法优于LEACH和SEP算法,使网络能耗更均衡,延长了网络生存周期。

  1. Decentralized Enterprise Systems: A Multi-platform Wireless Sensor Networks Approach

    NARCIS (Netherlands)

    Marin Perianu, Mihai; Meratnia, Nirvana; Havinga, Paul J.M.; Moreira Sá de Souza, L.; Müller, J.; Spiess, P.; Haller, S.; Riedel, T.; Decker, C.; Stromberg, G.

    2007-01-01

    Massively deployed wireless sensor and actuator networks (WSAN), co-existing with RFID technology, can bring clear benefits to large-scale enterprise systems, by delegating parts of the business functionality closer to the point of action. However, a major impediment in the integration process is

  2. Multi-Channel Scheduling for Fast Convergecast in Wireless Sensor Networks

    NARCIS (Netherlands)

    Durmaz, O.; Ghosh, A.; Krishnamachari, B.; Chintalapudi, K.

    We explore the following fundamental question - how fast can information be collected from a wireless sensor network? We consider a number of design parameters such as, power control, time and frequency scheduling, and routing. There are essentially two factors that hinder efficient data collection

  3. Wireless Networks: New Meaning to Ubiquitous Computing.

    Science.gov (United States)

    Drew, Wilfred, Jr.

    2003-01-01

    Discusses the use of wireless technology in academic libraries. Topics include wireless networks; standards (IEEE 802.11); wired versus wireless; why libraries implement wireless technology; wireless local area networks (WLANs); WLAN security; examples of wireless use at Indiana State University and Morrisville College (New York); and useful…

  4. OPNET Modeler simulations of performance for multi nodes wireless systems

    Directory of Open Access Journals (Sweden)

    Krupanek Beata

    2016-01-01

    Full Text Available Paper presents a study under the Quality of Service in modern wireless sensor networks. Such a networks are characterized by small amount of data transmitted in fixed periods. Very often this data must by transmitted in real time so data transmission delays should be well known. This article shows multimode network simulated in packet OPNET Modeler. Also nowadays the quality of services is very important especially in multi-nodes systems such a home automation or measurement systems.

  5. Cooperative Spatial Reuse with Transmit Beamforming in Multi-rate Wireless Networks

    DEFF Research Database (Denmark)

    Lu, Chenguang; Fitzek, Frank; Eggers, Patrick Claus F.

    2009-01-01

    We present a cooperative spatial reuse (CSR) scheme as a cooperative extension of the current TDMA-based MAC to enable spatial reuse in multi-rate wireless networks. We model spatial reuse as a cooperation problem on utilizing the time slots obtained from the TDMA-based MAC. In CSR, there are two...... operation modes. One is TDMA mode while the other is spatial reuse mode in which links transmit simultaneously. Links contribute their own time slots to form a cooperative group to do spatial reuse. Each link joins the group only if it can benefit in capacity or energy efficiency. Otherwise, the link...... will leave spatial reuse mode and switch back to TDMA. In this work, we focus on the transmit beamforming techniques to enable CSR by interference cancellation on MISO (Multiple Input Single Output) links. We compare the CSR scheme using zero-forcing (ZF) transmit beamforming, namely ZF-CSR, to the TDMA...

  6. Real-time visual communication to aid disaster recovery in a multi-segment hybrid wireless networking system

    Science.gov (United States)

    Al Hadhrami, Tawfik; Wang, Qi; Grecos, Christos

    2012-06-01

    When natural disasters or other large-scale incidents occur, obtaining accurate and timely information on the developing situation is vital to effective disaster recovery operations. High-quality video streams and high-resolution images, if available in real time, would provide an invaluable source of current situation reports to the incident management team. Meanwhile, a disaster often causes significant damage to the communications infrastructure. Therefore, another essential requirement for disaster management is the ability to rapidly deploy a flexible incident area communication network. Such a network would facilitate the transmission of real-time video streams and still images from the disrupted area to remote command and control locations. In this paper, a comprehensive end-to-end video/image transmission system between an incident area and a remote control centre is proposed and implemented, and its performance is experimentally investigated. In this study a hybrid multi-segment communication network is designed that seamlessly integrates terrestrial wireless mesh networks (WMNs), distributed wireless visual sensor networks, an airborne platform with video camera balloons, and a Digital Video Broadcasting- Satellite (DVB-S) system. By carefully integrating all of these rapidly deployable, interworking and collaborative networking technologies, we can fully exploit the joint benefits provided by WMNs, WSNs, balloon camera networks and DVB-S for real-time video streaming and image delivery in emergency situations among the disaster hit area, the remote control centre and the rescue teams in the field. The whole proposed system is implemented in a proven simulator. Through extensive simulations, the real-time visual communication performance of this integrated system has been numerically evaluated, towards a more in-depth understanding in supporting high-quality visual communications in such a demanding context.

  7. A spatiotemporal analysis of hydrological patterns based on a wireless sensor network system

    Science.gov (United States)

    Plaza, F.; Slater, T. A.; Zhong, X.; Li, Y.; Liang, Y.; Liang, X.

    2017-12-01

    Understanding complicated spatiotemporal patterns of eco-hydrological variables at a small scale plays a profound role in improving predictability of high resolution distributed hydrological models. However, accurate and continuous monitoring of these complex patterns has become one of the main challenges in the environmental sciences. Wireless sensor networks (WSNs) have emerged as one of the most widespread potential solutions to achieve this. This study presents a spatiotemporal analysis of hydrological patterns (e.g., soil moisture, soil water potential, soil temperature and transpiration) based on observational data collected from a dense multi-hop wireless sensor network (WSN) in a steep-forested testbed located in Southwestern Pennsylvania, USA. At this WSN testbed with an approximate area of 3000 m2, environmental variables are collected from over 240 sensors that are connected to more than 100 heterogeneous motes. The sensors include the soil moisture of EC-5, soil temperature and soil water potential of MPS-1 and MPS-2, and sap flow sensors constructed in house. The motes consist of MICAz, IRIS and TelosB. In addition, several data loggers have been installed along the site to provide a comparative reference to the WSN measurements for the purpose of checking the WSN data quality. The edaphic properties monitored by the WSN sensors show strong agreement with the data logger measurements. Moreover, sap flow measurements, scaled to tree stand transpiration, are found to be reasonable. This study also investigates the feasibility and roles that these sensor measurements play in improving the performance of high-resolution distributed hydrological models. In particular, we explore this using a modified version of the Distributed Hydrological Soil Vegetation Model (DHSVM).

  8. Threshold-Based Relay Selection for Detect-and-Forward Relaying in Cooperative Wireless Networks

    Directory of Open Access Journals (Sweden)

    Fan Yijia

    2010-01-01

    Full Text Available This paper studies two-hop cooperative demodulate-and-forward relaying using multiple relays in wireless networks. A threshold based relay selection scheme is considered, in which the reliable relays are determined by comparing source-relay SNR to a threshold, and one of the reliable relays is selected by the destination based on relay-destination SNR. The exact bit error rate of this scheme is derived, and a simple threshold function is proposed. It is shown that the network achieves full diversity order ( under the proposed threshold, where is the number of relays in the network. Unlike some other full diversity achieving protocols in the literature, the requirement that the instantaneous/average SNRs of the source-relay links be known at the destination is eliminated using the appropriate SNR threshold.

  9. Mutual trust method for forwarding information in wireless sensor networks using random secret pre-distribution

    Directory of Open Access Journals (Sweden)

    Chih-Hsueh Lin

    2016-04-01

    Full Text Available In wireless sensor networks, sensing information must be transmitted from sensor nodes to the base station by multiple hopping. Every sensor node is a sender and a relay node that forwards the sensing information that is sent by other nodes. Under an attack, the sensing information may be intercepted, modified, interrupted, or fabricated during transmission. Accordingly, the development of mutual trust to enable a secure path to be established for forwarding information is an important issue. Random key pre-distribution has been proposed to establish mutual trust among sensor nodes. This article modifies the random key pre-distribution to a random secret pre-distribution and incorporates identity-based cryptography to establish an effective method of establishing mutual trust for a wireless sensor network. In the proposed method, base station assigns an identity and embeds n secrets into the private secret keys for every sensor node. Based on the identity and private secret keys, the mutual trust method is utilized to explore the types of trust among neighboring sensor nodes. The novel method can resist malicious attacks and satisfy the requirements of wireless sensor network, which are resistance to compromising attacks, masquerading attacks, forger attacks, replying attacks, authentication of forwarding messages, and security of sensing information.

  10. Security Threats on Wireless Sensor Network Protocols

    OpenAIRE

    H. Gorine; M. Ramadan Elmezughi

    2016-01-01

    In this paper, we investigate security issues and challenges facing researchers in wireless sensor networks and countermeasures to resolve them. The broadcast nature of wireless communication makes Wireless Sensor Networks prone to various attacks. Due to resources limitation constraint in terms of limited energy, computation power and memory, security in wireless sensor networks creates different challenges than wired network security. We will discuss several attempts at addressing the issue...

  11. Multi-hop Relaying: An End-to-End Delay Analysis

    KAUST Repository

    Chaaban, Anas; Sezgin, Aydin

    2015-01-01

    The impact of multi-hopping schemes on the communication latency in a relay channel is studied. The main aim is to characterize conditions under which such schemes decrease the communication latency given a reliability requirement. Both decode

  12. Smart Control of Multiple Evaporator Systems with Wireless Sensor and Actuator Networks

    Directory of Open Access Journals (Sweden)

    Apolinar González-Potes

    2016-02-01

    Full Text Available This paper describes the complete integration of a fuzzy control of multiple evaporator systems with the IEEE 802.15.4 standard, in which we study several important aspects for this kind of system, like a detailed analysis of the end-to-end real-time flows over wireless sensor and actuator networks (WSAN, a real-time kernel with an earliest deadline first (EDF scheduler, periodic and aperiodic tasking models for the nodes, lightweight and flexible compensation-based control algorithms for WSAN that exhibit packet dropouts, an event-triggered sampling scheme and design methodologies. We address the control problem of the multi-evaporators with the presence of uncertainties, which was tackled through a wireless fuzzy control approach, showing the advantages of this concept where it can easily perform the optimization for a set of multiple evaporators controlled by the same smart controller, which should have an intelligent and flexible architecture based on multi-agent systems (MAS that allows one to add or remove new evaporators online, without the need for reconfiguring, while maintaining temporal and functional restrictions in the system. We show clearly how we can get a greater scalability, the self-configuration of the network and the least overhead with a non-beacon or unslotted mode of the IEEE 802.15.4 protocol, as well as wireless communications and distributed architectures, which could be extremely helpful in the development process of networked control systems in large spatially-distributed plants, which involve many sensors and actuators. For this purpose, a fuzzy scheme is used to control a set of parallel evaporator air-conditioning systems, with temperature and relative humidity control as a multi-input and multi-output closed loop system; in addition, a general architecture is presented, which implements multiple control loops closed over a communication network, integrating the analysis and validation method for multi

  13. Introduction to wireless sensor networks

    CERN Document Server

    Forster, Anna

    2016-01-01

    Explores real-world wireless sensor network development, deployment, and applications. The book begins with an introduction to wireless sensor networks and their fundamental concepts. Hardware components, operating systems, protocols, and algorithms that make up the anatomy of a sensor node are described in chapter two. Properties of wireless communications, medium access protocols, wireless links, and link estimation protocols are described in chapter three and chapter four. Routing basics and metrics, clustering techniques, time synchronization and localization protocols, as well as sensing techniques are introduced in chapter five to nine. The concluding chapter summarizes the learnt methods and shows how to use them to deploy real-world sensor networks in a structured way.

  14. Cross-Layer QoS Control for Video Communications over Wireless Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Pei Yong

    2005-01-01

    Full Text Available Assuming a wireless ad hoc network consisting of homogeneous video users with each of them also serving as a possible relay node for other users, we propose a cross-layer rate-control scheme based on an analytical study of how the effective video transmission rate is affected by the prevailing operating parameters, such as the interference environment, the number of transmission hops to a destination, and the packet loss rate. Furthermore, in order to provide error-resilient video delivery over such wireless ad hoc networks, a cross-layer joint source-channel coding (JSCC approach, to be used in conjunction with rate-control, is proposed and investigated. This approach attempts to optimally apply the appropriate channel coding rate given the constraints imposed by the effective transmission rate obtained from the proposed rate-control scheme, the allowable real-time video play-out delay, and the prevailing channel conditions. Simulation results are provided which demonstrate the effectiveness of the proposed cross-layer combined rate-control and JSCC approach.

  15. 802.11 Wireless Networks The Definitive Guide

    CERN Document Server

    Gast, Matthew S

    2005-01-01

    As we all know by now, wireless networks offer many advantages over fixed (or wired) networks. Foremost on that list is mobility, since going wireless frees you from the tether of an Ethernet cable at a desk. But that's just the tip of the cable-free iceberg. Wireless networks are also more flexible, faster and easier for you to use, and more affordable to deploy and maintain. The de facto standard for wireless networking is the 802.11 protocol, which includes Wi-Fi (the wireless standard known as 802.11b) and its faster cousin, 802.11g. With easy-to-install 802.11 network hardware avail

  16. How to model wireless mesh networks topology

    International Nuclear Information System (INIS)

    Sanni, M L; Hashim, A A; Anwar, F; Ali, S; Ahmed, G S M

    2013-01-01

    The specification of network connectivity model or topology is the beginning of design and analysis in Computer Network researches. Wireless Mesh Networks is an autonomic network that is dynamically self-organised, self-configured while the mesh nodes establish automatic connectivity with the adjacent nodes in the relay network of wireless backbone routers. Researches in Wireless Mesh Networks range from node deployment to internetworking issues with sensor, Internet and cellular networks. These researches require modelling of relationships and interactions among nodes including technical characteristics of the links while satisfying the architectural requirements of the physical network. However, the existing topology generators model geographic topologies which constitute different architectures, thus may not be suitable in Wireless Mesh Networks scenarios. The existing methods of topology generation are explored, analysed and parameters for their characterisation are identified. Furthermore, an algorithm for the design of Wireless Mesh Networks topology based on square grid model is proposed in this paper. The performance of the topology generated is also evaluated. This research is particularly important in the generation of a close-to-real topology for ensuring relevance of design to the intended network and validity of results obtained in Wireless Mesh Networks researches

  17. Sinkhole Avoidance Routing in Wireless Sensor Networks

    Science.gov (United States)

    2011-05-09

    COVERED (From- To) 09-05-2011 4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Sinkhole Avoidance Routing in Wireless Sensor Networks 5b . GRANT NUMBER . 5c...reliability of wireless sensor networks. 15. SUBJECT TERMS wireless sensor networks, sinkhole attack, routing protocol 16. SECURITY CLASSIFICATION...Include area code) Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std . Z39.18 1 Sinkhole Avoidance Routing in Wireless Sensor Networks MIDN 1/C

  18. PERFORMANCE ANALYSIS OF ARQ AND HYBRID ARQ OVER SINGLE-HOP, DUAL-HOP, AND MULTIBRANCH DUAL-HOP NETWORKS

    KAUST Repository

    Hadjtaieb, Amir

    2014-01-01

    During the last decade, relay networks have attracted a lot of interest due to their numerous benefits. The relaying technique allows extending the coverage zone of wireless networks and offers a higher reliability for communication systems

  19. Throughput Analysis on 3-Dimensional Underwater Acoustic Network with One-Hop Mobile Relay

    Science.gov (United States)

    Zhong, Xuefeng; Fan, Jiasheng; Guan, Quansheng; Ji, Fei; Yu, Hua

    2018-01-01

    Underwater acoustic communication network (UACN) has been considered as an essential infrastructure for ocean exploitation. Performance analysis of UACN is important in underwater acoustic network deployment and management. In this paper, we analyze the network throughput of three-dimensional randomly deployed transmitter–receiver pairs. Due to the long delay of acoustic channels, complicated networking protocols with heavy signaling overhead may not be appropriate. In this paper, we consider only one-hop or two-hop transmission, to save the signaling cost. That is, we assume the transmitter sends the data packet to the receiver by one-hop direct transmission, or by two-hop transmission via mobile relays. We derive the closed-form formulation of packet delivery rate with respect to the transmission delay and the number of transmitter–receiver pairs. The correctness of the derivation results are verified by computer simulations. Our analysis indicates how to obtain a precise tradeoff between the delay constraint and the network capacity. PMID:29337911

  20. Throughput Analysis on 3-Dimensional Underwater Acoustic Network with One-Hop Mobile Relay.

    Science.gov (United States)

    Zhong, Xuefeng; Chen, Fangjiong; Fan, Jiasheng; Guan, Quansheng; Ji, Fei; Yu, Hua

    2018-01-16

    Underwater acoustic communication network (UACN) has been considered as an essential infrastructure for ocean exploitation. Performance analysis of UACN is important in underwater acoustic network deployment and management. In this paper, we analyze the network throughput of three-dimensional randomly deployed transmitter-receiver pairs. Due to the long delay of acoustic channels, complicated networking protocols with heavy signaling overhead may not be appropriate. In this paper, we consider only one-hop or two-hop transmission, to save the signaling cost. That is, we assume the transmitter sends the data packet to the receiver by one-hop direct transmission, or by two-hop transmission via mobile relays. We derive the closed-form formulation of packet delivery rate with respect to the transmission delay and the number of transmitter-receiver pairs. The correctness of the derivation results are verified by computer simulations. Our analysis indicates how to obtain a precise tradeoff between the delay constraint and the network capacity.

  1. Towards Controlling Latency in Wireless Networks

    KAUST Repository

    Bouacida, Nader

    2017-04-24

    Wireless networks are undergoing an unprecedented revolution in the last decade. With the explosion of delay-sensitive applications in the Internet (i.e., online gaming and VoIP), latency becomes a major issue for the development of wireless technology. Taking advantage of the significant decline in memory prices, industrialists equip the network devices with larger buffering capacities to improve the network throughput by limiting packets drops. Over-buffering results in increasing the time that packets spend in the queues and, thus, introducing more latency in networks. This phenomenon is known as “bufferbloat”. While throughput is the dominant performance metric, latency also has a huge impact on user experience not only for real-time applications but also for common applications like web browsing, which is sensitive to latencies in order of hundreds of milliseconds. Concerns have arisen about designing sophisticated queue management schemes to mitigate the effects of such phenomenon. My thesis research aims to solve bufferbloat problem in both traditional half-duplex and cutting-edge full-duplex wireless systems by reducing delay while maximizing wireless links utilization and fairness. Our work shed lights on buffer management algorithms behavior in wireless networks and their ability to reduce latency resulting from excessive queuing delays inside oversized static network buffers without a significant loss in other network metrics. First of all, we address the problem of buffer management in wireless full-duplex networks by using Wireless Queue Management (WQM), which is an active queue management technique for wireless networks. Our solution is based on Relay Full-Duplex MAC (RFD-MAC), an asynchronous media access control protocol designed for relay full-duplexing. Compared to the default case, our solution reduces the end-to-end delay by two orders of magnitude while achieving similar throughput in most of the cases. In the second part of this thesis

  2. Analyzing Multimode Wireless Sensor Networks Using the Network Calculus

    Directory of Open Access Journals (Sweden)

    Xi Jin

    2015-01-01

    Full Text Available The network calculus is a powerful tool to analyze the performance of wireless sensor networks. But the original network calculus can only model the single-mode wireless sensor network. In this paper, we combine the original network calculus with the multimode model to analyze the maximum delay bound of the flow of interest in the multimode wireless sensor network. There are two combined methods A-MM and N-MM. The method A-MM models the whole network as a multimode component, and the method N-MM models each node as a multimode component. We prove that the maximum delay bound computed by the method A-MM is tighter than or equal to that computed by the method N-MM. Experiments show that our proposed methods can significantly decrease the analytical delay bound comparing with the separate flow analysis method. For the large-scale wireless sensor network with 32 thousands of sensor nodes, our proposed methods can decrease about 70% of the analytical delay bound.

  3. Algorithms for energy efficiency in wireless sensor networks

    Energy Technology Data Exchange (ETDEWEB)

    Busse, M

    2007-01-21

    The recent advances in microsensor and semiconductor technology have opened a new field within computer science: the networking of small-sized sensors which are capable of sensing, processing, and communicating. Such wireless sensor networks offer new applications in the areas of habitat and environment monitoring, disaster control and operation, military and intelligence control, object tracking, video surveillance, traffic control, as well as in health care and home automation. It is likely that the deployed sensors will be battery-powered, which will limit the energy capacity significantly. Thus, energy efficiency becomes one of the main challenges that need to be taken into account, and the design of energy-efficient algorithms is a major contribution of this thesis. As the wireless communication in the network is one of the main energy consumers, we first consider in detail the characteristics of wireless communication. By using the embedded sensor board (ESB) platform recently developed by the Free University of Berlin, we analyze the means of forward error correction and propose an appropriate resync mechanism, which improves the communication between two ESB nodes substantially. Afterwards, we focus on the forwarding of data packets through the network. We present the algorithms energy-efficient forwarding (EEF), lifetime-efficient forwarding (LEF), and energy-efficient aggregation forwarding (EEAF). While EEF is designed to maximize the number of data bytes delivered per energy unit, LEF additionally takes into account the residual energy of forwarding nodes. In so doing, LEF further prolongs the lifetime of the network. Energy savings due to data aggregation and in-network processing are exploited by EEAF. Besides single-link forwarding, in which data packets are sent to only one forwarding node, we also study the impact of multi-link forwarding, which exploits the broadcast characteristics of the wireless medium by sending packets to several (potential

  4. Algorithms for energy efficiency in wireless sensor networks

    Energy Technology Data Exchange (ETDEWEB)

    Busse, M.

    2007-01-21

    The recent advances in microsensor and semiconductor technology have opened a new field within computer science: the networking of small-sized sensors which are capable of sensing, processing, and communicating. Such wireless sensor networks offer new applications in the areas of habitat and environment monitoring, disaster control and operation, military and intelligence control, object tracking, video surveillance, traffic control, as well as in health care and home automation. It is likely that the deployed sensors will be battery-powered, which will limit the energy capacity significantly. Thus, energy efficiency becomes one of the main challenges that need to be taken into account, and the design of energy-efficient algorithms is a major contribution of this thesis. As the wireless communication in the network is one of the main energy consumers, we first consider in detail the characteristics of wireless communication. By using the embedded sensor board (ESB) platform recently developed by the Free University of Berlin, we analyze the means of forward error correction and propose an appropriate resync mechanism, which improves the communication between two ESB nodes substantially. Afterwards, we focus on the forwarding of data packets through the network. We present the algorithms energy-efficient forwarding (EEF), lifetime-efficient forwarding (LEF), and energy-efficient aggregation forwarding (EEAF). While EEF is designed to maximize the number of data bytes delivered per energy unit, LEF additionally takes into account the residual energy of forwarding nodes. In so doing, LEF further prolongs the lifetime of the network. Energy savings due to data aggregation and in-network processing are exploited by EEAF. Besides single-link forwarding, in which data packets are sent to only one forwarding node, we also study the impact of multi-link forwarding, which exploits the broadcast characteristics of the wireless medium by sending packets to several (potential

  5. Alternative Path Communication in Wide-Scale Cluster-Tree Wireless Sensor Networks Using Inactive Periods.

    Science.gov (United States)

    Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

    2017-05-06

    The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable technology to deploy wide-scale Wireless Sensor Networks (WSNs). These networks are usually designed to support convergecast traffic, where all communication paths go through the PAN (Personal Area Network) coordinator. Nevertheless, peer-to-peer communication relationships may be also required for different types of WSN applications. That is the typical case of sensor and actuator networks, where local control loops must be closed using a reduced number of communication hops. The use of communication schemes optimised just for the support of convergecast traffic may result in higher network congestion and in a potentially higher number of communication hops. Within this context, this paper proposes an Alternative-Route Definition (ARounD) communication scheme for WSNs. The underlying idea of ARounD is to setup alternative communication paths between specific source and destination nodes, avoiding congested cluster-tree paths. These alternative paths consider shorter inter-cluster paths, using a set of intermediate nodes to relay messages during their inactive periods in the cluster-tree network. Simulation results show that the ARounD communication scheme can significantly decrease the end-to-end communication delay, when compared to the use of standard cluster-tree communication schemes. Moreover, the ARounD communication scheme is able to reduce the network congestion around the PAN coordinator, enabling the reduction of the number of message drops due to queue overflows in the cluster-tree network.

  6. Construct mine environment monitoring system based on wireless mesh network

    Science.gov (United States)

    Chen, Xin; Ge, Gengyu; Liu, Yinmei; Cheng, Aimin; Wu, Jun; Fu, Jun

    2018-04-01

    The system uses wireless Mesh network as a network transmission medium, and strive to establish an effective and reliable underground environment monitoring system. The system combines wireless network technology and embedded technology to monitor the internal data collected in the mine and send it to the processing center for analysis and environmental assessment. The system can be divided into two parts: the main control network module and the data acquisition terminal, and the SPI bus technology is used for mutual communication between them. Multi-channel acquisition and control interface design Data acquisition and control terminal in the analog signal acquisition module, digital signal acquisition module, and digital signal output module. The main control network module running Linux operating system, in which the transplant SPI driver, USB card driver and AODV routing protocol. As a result, the internal data collection and reporting of the mine are realized.

  7. Breadth-First Search-Based Single-Phase Algorithms for Bridge Detection in Wireless Sensor Networks

    Science.gov (United States)

    Akram, Vahid Khalilpour; Dagdeviren, Orhan

    2013-01-01

    Wireless sensor networks (WSNs) are promising technologies for exploring harsh environments, such as oceans, wild forests, volcanic regions and outer space. Since sensor nodes may have limited transmission range, application packets may be transmitted by multi-hop communication. Thus, connectivity is a very important issue. A bridge is a critical edge whose removal breaks the connectivity of the network. Hence, it is crucial to detect bridges and take preventions. Since sensor nodes are battery-powered, services running on nodes should consume low energy. In this paper, we propose energy-efficient and distributed bridge detection algorithms for WSNs. Our algorithms run single phase and they are integrated with the Breadth-First Search (BFS) algorithm, which is a popular routing algorithm. Our first algorithm is an extended version of Milic's algorithm, which is designed to reduce the message length. Our second algorithm is novel and uses ancestral knowledge to detect bridges. We explain the operation of the algorithms, analyze their proof of correctness, message, time, space and computational complexities. To evaluate practical importance, we provide testbed experiments and extensive simulations. We show that our proposed algorithms provide less resource consumption, and the energy savings of our algorithms are up by 5.5-times. PMID:23845930

  8. Security for 5G Mobile Wireless Networks

    OpenAIRE

    Fang, Dongfeng; Qian, Yi; Qingyang Hu, Rose

    2017-01-01

    The advanced features of 5G mobile wireless network systems yield new security requirements and challenges. This paper presents a comprehensive survey on security of 5G wireless network systems compared to the traditional cellular networks. The paper starts with a review on 5G wireless networks particularities as well as on the new requirements and motivations of 5G wireless security. The potential attacks and security services with the consideration of new service requirements and new use ca...

  9. Secure Connectivity Probability of Multi‐hop Clustered Randomize‐and‐Forward Networks

    Directory of Open Access Journals (Sweden)

    Xiaowei Wang

    2017-10-01

    Full Text Available This work investigates secure cluster‐aided multi‐hop randomize‐and‐forward networks. We present a hop‐by‐hop multi‐hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability (SCP of the hop‐by‐hop transmission scheme. For comparison, we also analyze SCPs of traditional end‐to‐end transmission schemes with two relay‐selection policies. We perform simulations, and our analytical results verify that the proposed hop‐by‐hop scheme is superior to end‐to‐end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop‐by‐hop scheme achieves near‐optimal performance in terms of the SCP.

  10. Opportunistic Beacon Networks: Information Dissemination via Wireless Network Identifiers

    NARCIS (Netherlands)

    Türkes, Okan; Scholten, Johan; Havinga, Paul J.M.

    2016-01-01

    This paper presents OBN, a universal opportunistic ad hoc networking model particularly intended for smart mobile devices. It enables fast and lightweight data dissemination in wireless community networks through the utilization of universally-available wireless network identifiers. As a ubiquitous

  11. MC-LMAC: A Multi-Channel MAC Protocol for Wireless Sensor Networks

    NARCIS (Netherlands)

    Durmaz, O.; Jansen, P.G.; Mullender, Sape J.

    2008-01-01

    In traditional wireless sensor network (WSN) applications, energy efficiency is considered to be the most important concern whereas utilizing the use of bandwidth and maximizing the throughput are of secondary importance. However, recent applications, such as structural health monitoring, require

  12. Optimal Dimensioning of FiWi Networks over Advanced Metering Infrastructure for the Smart Grid

    DEFF Research Database (Denmark)

    Inga, Esteban; Peralta-Sevilla, Arturo; Hincapié, Roberto

    2015-01-01

    —In this paper, we propose a hybrid wireless mesh network infrastructure which connects the smart meters of each consumer with the data aggregation points (DAP). We suppose a set of smart meters that need to send information, and receive information from a central office on electrical enterprises...... through of the meter data management system (MDMS), and so forming the advanced metering infrastructure (AMI) stage of smart grids. We consider a multi-hop system, where information is routed through several nodes which act as DAP. Wireless mesh networks are known to extend coverage and increase...... deployment efficiency, so they could be an alternative for the connection between Home Area Network (HAN) and the Neighborhood Area Network (NAN). However, the NAN data must be send through wider area cabled networks to Metropolitan Area Network (MAN), and based on the WDM-PON architecture. We consider...

  13. Socially Aware Heterogeneous Wireless Networks.

    Science.gov (United States)

    Kosmides, Pavlos; Adamopoulou, Evgenia; Demestichas, Konstantinos; Theologou, Michael; Anagnostou, Miltiades; Rouskas, Angelos

    2015-06-11

    The development of smart cities has been the epicentre of many researchers' efforts during the past decade. One of the key requirements for smart city networks is mobility and this is the reason stable, reliable and high-quality wireless communications are needed in order to connect people and devices. Most research efforts so far, have used different kinds of wireless and sensor networks, making interoperability rather difficult to accomplish in smart cities. One common solution proposed in the recent literature is the use of software defined networks (SDNs), in order to enhance interoperability among the various heterogeneous wireless networks. In addition, SDNs can take advantage of the data retrieved from available sensors and use them as part of the intelligent decision making process contacted during the resource allocation procedure. In this paper, we propose an architecture combining heterogeneous wireless networks with social networks using SDNs. Specifically, we exploit the information retrieved from location based social networks regarding users' locations and we attempt to predict areas that will be crowded by using specially-designed machine learning techniques. By recognizing possible crowded areas, we can provide mobile operators with recommendations about areas requiring datacell activation or deactivation.

  14. Adaptive Probabilistic Broadcasting over Dense Wireless Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Victor Gau

    2010-01-01

    Full Text Available We propose an idle probability-based broadcasting method, iPro, which employs an adaptive probabilistic mechanism to improve performance of data broadcasting over dense wireless ad hoc networks. In multisource one-hop broadcast scenarios, the modeling and simulation results of the proposed iPro are shown to significantly outperform the standard IEEE 802.11 under saturated condition. Moreover, the results also show that without estimating the number of competing nodes and changing the contention window size, the performance of the proposed iPro can still approach the theoretical bound. We further apply iPro to multihop broadcasting scenarios, and the experiment results show that within the same elapsed time after the broadcasting, the proposed iPro has significantly higher Packet-Delivery Ratios (PDR than traditional methods.

  15. Achieving Network Level Privacy in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sungyoung Lee

    2010-02-01

    Full Text Available Full network level privacy has often been categorized into four sub-categories: Identity, Route, Location and Data privacy. Achieving full network level privacy is a critical and challenging problem due to the constraints imposed by the sensor nodes (e.g., energy, memory and computation power, sensor networks (e.g., mobility and topology and QoS issues (e.g., packet reach-ability and timeliness. In this paper, we proposed two new identity, route and location privacy algorithms and data privacy mechanism that addresses this problem. The proposed solutions provide additional trustworthiness and reliability at modest cost of memory and energy. Also, we proved that our proposed solutions provide protection against various privacy disclosure attacks, such as eavesdropping and hop-by-hop trace back attacks.

  16. Integration of RFID and Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    Miodrag; Bolic; Amiya; Nayak; Ivan; Stojmenovi.

    2007-01-01

    Radio Frequency Identification (RFID) and Wireless Sensor Network (WSN) are two important wireless technologies that have wide variety of applications and provide limitless future potentials. However,RFID and sensor networks almost are under development in parallel way. Integration of RFID and wireless sensor networks attracts little attention from research community. This paper first presents a brief introduction on RFID,and then investigates recent research works,new products/patents and applications that integrate RFID with sensor networks. Four types of integration are discussed. They are integrating tags with sensors,integrating tags with wireless sensor nodes,integrating readers with wireless sensor nodes and wire-less devices,and mix of RFID and sensors. New challenges and future works are discussed in the end.

  17. A two-hop wireless power transfer system with an efficiency-enhanced power receiver for motion-free capsule endoscopy inspection.

    Science.gov (United States)

    Sun, Tianjia; Xie, Xiang; Li, Guolin; Gu, Yingke; Deng, Yangdong; Wang, Zhihua

    2012-11-01

    This paper presents a wireless power transfer system for a motion-free capsule endoscopy inspection. Conventionally, a wireless power transmitter in a specifically designed jacket has to be connected to a strong power source with a long cable. To avoid the power cable and allow patients to walk freely in a room, this paper proposes a two-hop wireless power transfer system. First, power is transferred from a floor to a power relay in the patient's jacket via strong coupling. Next, power is delivered from the power relay to the capsule via loose coupling. Besides making patients much more conformable, the proposed techniques eliminate the sources of reliability issues arisen from the moving cable and connectors. In the capsule, it is critical to enhance the power conversion efficiency. This paper develops a switch-mode rectifier (rectifying efficiency of 93.6%) and a power combination circuit (enhances combining efficiency by 18%). Thanks to the two-hop transfer mechanism and the novel circuit techniques, this system is able to transfer an average power of 24 mW and a peak power of 90 mW from the floor to a 13 mm × 27 mm capsule over a distance of 1 m with the maximum dc-to-dc power efficiency of 3.04%.

  18. Wireless home networking for dummies

    CERN Document Server

    Briere, Danny; Ferris, Edward

    2010-01-01

    The perennial bestseller shows you how share your files and Internet connection across a wireless network. Fully updated for Windows 7 and Mac OS X Snow Leopard, this new edition of this bestseller returns with all the latest in wireless standards and security. This fun and friendly guide shows you how to integrate your iPhone, iPod touch, smartphone, or gaming system into your home network. Veteran authors escort you through the various financial and logisitical considerations that you need to take into account before building a wireless network at home.: Covers the basics of planning, instal

  19. Design architecture for multi-zone HVAC control systems from existing single-zone systems using wireless sensor networks

    Science.gov (United States)

    Redfern, Andrew; Koplow, Michael; Wright, Paul

    2007-01-01

    Most residential heating, ventilating, and air-conditioning (HVAC) systems utilize a single zone for conditioning air throughout the entire house. While inexpensive, these systems lead to wide temperature distributions and inefficient cooling due to the difference in thermal loads in different rooms. The end result is additional cost to the end user because the house is over conditioned. To reduce the total amount of energy used in a home and to increase occupant comfort there is a need for a better control system using multiple temperature zones. Typical multi-zone systems are costly and require extensive infrastructure to function. Recent advances in wireless sensor networks (WSNs) have enabled a low cost drop-in wireless vent register control system. The register control system is controlled by a master controller unit, which collects sensor data from a distributed wireless sensor network. Each sensor node samples local settings (occupancy, light, humidity and temperature) and reports the data back to the master control unit. The master control unit compiles the incoming data and then actuates the vent resisters to control the airflow throughout the house. The control system also utilizes a smart thermostat with a movable set point to enable the user to define their given comfort levels. The new system can reduce the run time of the HVAC system and thus decreasing the amount of energy used and increasing the comfort of the home occupations.

  20. Unified Multi-Layer among Software Defined Multi-Domain Optical Networks (Invited

    Directory of Open Access Journals (Sweden)

    Hui Yang

    2015-06-01

    Full Text Available The software defined networking (SDN enabled by OpenFlow protocol has gained popularity which can enable the network to be programmable and accommodate both fixed and flexible bandwidth services. In this paper, we present a unified multi-layer (UML architecture with multiple controllers and a dynamic orchestra plane (DOP for software defined multi-domain optical networks. The proposed architecture can shield the differences among various optical devices from multi-vendors and the details of connecting heterogeneous networks. The cross-domain services with on-demand bandwidth can be deployed via unified interfaces provided by the dynamic orchestra plane. Additionally, the globalization strategy and practical capture of signal processing are presented based on the architecture. The overall feasibility and efficiency of the proposed architecture is experimentally verified on the control plane of our OpenFlow-based testbed. The performance of globalization strategy under heavy traffic load scenario is also quantitatively evaluated based on UML architecture compared with other strategies in terms of blocking probability, average hops, and average resource consumption.

  1. A Game-Theoretic Response Strategy for Coordinator Attack in Wireless Sensor Networks

    Science.gov (United States)

    Liu, Jianhua; Yue, Guangxue; Shang, Huiliang; Li, Hongjie

    2014-01-01

    The coordinator is a specific node that controls the whole network and has a significant impact on the performance in cooperative multihop ZigBee wireless sensor networks (ZWSNs). However, the malicious node attacks coordinator nodes in an effort to waste the resources and disrupt the operation of the network. Attacking leads to a failure of one round of communication between the source nodes and destination nodes. Coordinator selection is a technique that can considerably defend against attack and reduce the data delivery delay, and increase network performance of cooperative communications. In this paper, we propose an adaptive coordinator selection algorithm using game and fuzzy logic aiming at both minimizing the average number of hops and maximizing network lifetime. The proposed game model consists of two interrelated formulations: a stochastic game for dynamic defense and a best response policy using evolutionary game formulation for coordinator selection. The stable equilibrium best policy to response defense is obtained from this game model. It is shown that the proposed scheme can improve reliability and save energy during the network lifetime with respect to security. PMID:25105171

  2. The art of wireless sensor networks

    CERN Document Server

    2014-01-01

    During the last one and a half decades, wireless sensor networks have witnessed significant growth and tremendous development in both academia and industry.   “The Art of Wireless Sensor Networks: Volume 1: Fundamentals” focuses on the fundamentals concepts in the design, analysis, and implementation of wireless sensor networks. It covers the various layers of the lifecycle of this type of network from the physical layer up to the application layer. Its rationale is that the first volume covers contemporary design issues, tools, and protocols for radio-based two-dimensional terrestrial sensor networks. All the book chapters in this volume include up-to-date research work spanning various classic facets of the physical properties and functional behavior of wireless sensor networks, including physical layer, medium access control, data routing, topology management, mobility management, localization, task management, data management, data gathering, security, middleware, sensor technology, standards, and ...

  3. The Optimization Based Dynamic and Cyclic Working Strategies for Rechargeable Wireless Sensor Networks with Multiple Base Stations and Wireless Energy Transfer Devices

    Science.gov (United States)

    Ding, Xu; Han, Jianghong; Shi, Lei

    2015-01-01

    In this paper, the optimal working schemes for wireless sensor networks with multiple base stations and wireless energy transfer devices are proposed. The wireless energy transfer devices also work as data gatherers while charging sensor nodes. The wireless sensor network is firstly divided into sub networks according to the concept of Voronoi diagram. Then, the entire energy replenishing procedure is split into the pre-normal and normal energy replenishing stages. With the objective of maximizing the sojourn time ratio of the wireless energy transfer device, a continuous time optimization problem for the normal energy replenishing cycle is formed according to constraints with which sensor nodes and wireless energy transfer devices should comply. Later on, the continuous time optimization problem is reshaped into a discrete multi-phased optimization problem, which yields the identical optimality. After linearizing it, we obtain a linear programming problem that can be solved efficiently. The working strategies of both sensor nodes and wireless energy transfer devices in the pre-normal replenishing stage are also discussed in this paper. The intensive simulations exhibit the dynamic and cyclic working schemes for the entire energy replenishing procedure. Additionally, a way of eliminating “bottleneck” sensor nodes is also developed in this paper. PMID:25785305

  4. The optimization based dynamic and cyclic working strategies for rechargeable wireless sensor networks with multiple base stations and wireless energy transfer devices.

    Science.gov (United States)

    Ding, Xu; Han, Jianghong; Shi, Lei

    2015-03-16

    In this paper, the optimal working schemes for wireless sensor networks with multiple base stations and wireless energy transfer devices are proposed. The wireless energy transfer devices also work as data gatherers while charging sensor nodes. The wireless sensor network is firstly divided into sub networks according to the concept of Voronoi diagram. Then, the entire energy replenishing procedure is split into the pre-normal and normal energy replenishing stages. With the objective of maximizing the sojourn time ratio of the wireless energy transfer device, a continuous time optimization problem for the normal energy replenishing cycle is formed according to constraints with which sensor nodes and wireless energy transfer devices should comply. Later on, the continuous time optimization problem is reshaped into a discrete multi-phased optimization problem, which yields the identical optimality. After linearizing it, we obtain a linear programming problem that can be solved efficiently. The working strategies of both sensor nodes and wireless energy transfer devices in the pre-normal replenishing stage are also discussed in this paper. The intensive simulations exhibit the dynamic and cyclic working schemes for the entire energy replenishing procedure. Additionally, a way of eliminating "bottleneck" sensor nodes is also developed in this paper.

  5. Traffic Profiling in Wireless Sensor Networks

    National Research Council Canada - National Science Library

    Kirykos, Georgios

    2006-01-01

    .... Wireless sensor networks pose unique challenges and limitations to the traditional schemes, which are used in the other wireless networks for security protection, and are due mainly to the increased...

  6. Fiber-wireless convergence in next-generation communication networks systems, architectures, and management

    CERN Document Server

    Chang, Gee-Kung; Ellinas, Georgios

    2017-01-01

    This book investigates new enabling technologies for Fi-Wi convergence. The editors discuss Fi-Wi technologies at the three major network levels involved in the path towards convergence: system level, network architecture level, and network management level. The main topics will be: a. At system level: Radio over Fiber (digitalized vs. analogic, standardization, E-band and beyond) and 5G wireless technologies; b. Network architecture level: NGPON, WDM-PON, BBU Hotelling, Cloud Radio Access Networks (C-RANs), HetNets. c. Network management level: SDN for convergence, Next-generation Point-of-Presence, Wi-Fi LTE Handover, Cooperative MultiPoint. • Addresses the Fi-Wi convergence issues at three different levels, namely at the system level, network architecture level, and network management level • Provides approaches in communication systems, network architecture, and management that are expected to steer the evolution towards fiber-wireless convergence • Contributions from leading experts in the field of...

  7. Future Wireless Networks and Information Systems Volume 1

    CERN Document Server

    2012-01-01

    This volume contains revised and extended research articles written by prominent researchers participating in ICFWI 2011 conference. The 2011 International Conference on Future Wireless Networks and Information Systems (ICFWI 2011) has been held on November 30 ~ December 1, 2011, Macao, China. Topics covered include Wireless Information Networks, Wireless Networking Technologies, Mobile Software and Services, intelligent computing, network management, power engineering, control engineering, Signal and Image Processing, Machine Learning, Control Systems and Applications, The book will offer the states of arts of tremendous advances in Wireless Networks and Information Systems and also serve as an excellent reference work for researchers and graduate students working on Wireless Networks and Information Systems.

  8. A wireless multi-channel bioimpedance measurement system for personalized healthcare and lifestyle.

    Science.gov (United States)

    Ramos, Javier; Ausín, José Luis; Lorido, Antonio Manuel; Redondo, Francisco; Duque-Carrillo, Juan Francisco

    2013-01-01

    Miniaturized, noninvasive, wearable sensors constitute a fundamental prerequisite for pervasive, predictive, and preventive healthcare systems. In this sense, this paper presents the design, realization, and evaluation of a wireless multi-channel measurement system based on a cost-effective high-performance integrated circuit for electrical bioimpedance (EBI) measurements in the frequency range from 1 kHz to 1 MHz. The resulting on-chip spectrometer provides high measuring EBI capabilities and together with a low-cost, commercially available radio frequency transceiver device. It provides reliable wireless communication, constitutes the basic node to build EBI wireless sensor networks (EBI-WSNs). The proposed EBI-WSN behaves as a high-performance wireless multi-channel EBI spectrometer, where the number of channels is completely scalable and independently configurable to satisfy specific measurement requirements of each individual. A prototype of the EBI node leads to a very small printed circuit board of approximately 8 cm2 including chip-antenna, which can operate several years on one 3-V coin cell battery and make it suitable for long-term preventive healthcare monitoring.

  9. Deployment Design of Wireless Sensor Network for Simple Multi-Point Surveillance of a Moving Target

    Science.gov (United States)

    Tsukamoto, Kazuya; Ueda, Hirofumi; Tamura, Hitomi; Kawahara, Kenji; Oie, Yuji

    2009-01-01

    In this paper, we focus on the problem of tracking a moving target in a wireless sensor network (WSN), in which the capability of each sensor is relatively limited, to construct large-scale WSNs at a reasonable cost. We first propose two simple multi-point surveillance schemes for a moving target in a WSN and demonstrate that one of the schemes can achieve high tracking probability with low power consumption. In addition, we examine the relationship between tracking probability and sensor density through simulations, and then derive an approximate expression representing the relationship. As the results, we present guidelines for sensor density, tracking probability, and the number of monitoring sensors that satisfy a variety of application demands. PMID:22412326

  10. A 15-meter Multi-Gigabit W-band Bidirectional Wireless Bridge in Fiber-Optic Access Networks

    DEFF Research Database (Denmark)

    Pang, Xiaodan; Vegas Olmos, Juan José; Lebedev, Alexander

    2013-01-01

    . The down-converted signal is re-modulated on to the lightwave and transmit further through the fiber-optic system. In the uplink, both up-and down-conversion are performed by electrical means. Furthermore, we investigate both passive and active wireless transmitters in this work for both downlink......We present a bidirectional wireless bridge in the W-band enabling the seamless convergence between the wireless and fiber-optic access networks. In the downlink, a 16 Gbit/s QPSK signal is photonically up-converted at the wireless transmitter and electrically down-converted at the wireless receiver...... and uplink transmissions. With an active wireless transmitter, up to 15 meters wireless transmission is successfully achieved with a BER below the 7% FEC limit in the downlink....

  11. Filtering and control of wireless networked systems

    CERN Document Server

    Zhang, Dan; Yu, Li

    2017-01-01

    This self-contained book, written by leading experts, offers a cutting-edge, in-depth overview of the filtering and control of wireless networked systems. It addresses the energy constraint and filter/controller gain variation problems, and presents both the centralized and the distributed solutions. The first two chapters provide an introduction to networked control systems and basic information on system analysis. Chapters (3–6) then discuss the centralized filtering of wireless networked systems, presenting different approaches to deal with energy efficiency and filter/controller gain variation problems. The next part (chapters 7–10) explores the distributed filtering of wireless networked systems, addressing the main problems of energy constraint and filter gain variation. The final part (chapters 11–14) focuses on the distributed control of wireless networked systems. wireless networked systems for communication and control applications, the bo...

  12. Flexible network wireless transceiver and flexible network telemetry transceiver

    Science.gov (United States)

    Brown, Kenneth D.

    2008-08-05

    A transceiver for facilitating two-way wireless communication between a baseband application and other nodes in a wireless network, wherein the transceiver provides baseband communication networking and necessary configuration and control functions along with transmitter, receiver, and antenna functions to enable the wireless communication. More specifically, the transceiver provides a long-range wireless duplex communication node or channel between the baseband application, which is associated with a mobile or fixed space, air, water, or ground vehicle or other platform, and other nodes in the wireless network or grid. The transceiver broadly comprises a communication processor; a flexible telemetry transceiver including a receiver and a transmitter; a power conversion and regulation mechanism; a diplexer; and a phased array antenna system, wherein these various components and certain subcomponents thereof may be separately enclosed and distributable relative to the other components and subcomponents.

  13. Low-Power Wireless Sensor Network Infrastructures

    DEFF Research Database (Denmark)

    Hansen, Morten Tranberg

    Advancements in wireless communication and electronics improving form factor and hardware capabilities has expanded the applicability of wireless sensor networks. Despite these advancements, devices are still limited in terms of energy which creates the need for duty-cycling and low-power protocols...... peripherals need to by duty-cycled and the low-power wireless radios are severely influenced by the environmental effects causing bursty and unreliable wireless channels. This dissertation presents a communication stack providing services for low-power communication, secure communication, data collection......, and network management which enables construction of low-power wireless sensor network applications. More specifically, these services are designed with the extreme low-power scenarios of the SensoByg project in mind and are implemented as follows. First, low-power communication is implemented with Auto...

  14. Energy reduction using multi-channels optical wireless communication based OFDM

    Science.gov (United States)

    Darwesh, Laialy; Arnon, Shlomi

    2017-10-01

    In recent years, an increasing number of data center networks (DCNs) have been built to provide various cloud applications. Major challenges in the design of next generation DC networks include reduction of the energy consumption, high flexibility and scalability, high data rates, minimum latency and high cyber security. Use of optical wireless communication (OWC) to augment the DC network could help to confront some of these challenges. In this paper we present an OWC multi channels communication method that could lead to significant energy reduction of the communication equipment. The method is to convert a high speed serial data stream to many slower and parallel streams and vies versa at the receiver. We implement this concept of multi channels using optical orthogonal frequency division multiplexing (O-OFDM) method. In our scheme, we use asymmetrically clipped optical OFDM (ACO-OFDM). Our results show that the realization of multi channels OFDM (ACO-OFDM) methods reduces the total energy consumption exponentially, as the number of channels transmitted through them rises.

  15. The benefits of soft sensor and multi-rate control for the implementation of Wireless Networked Control Systems.

    Science.gov (United States)

    Mansano, Raul K; Godoy, Eduardo P; Porto, Arthur J V

    2014-12-18

    Recent advances in wireless networking technology and the proliferation of industrial wireless sensors have led to an increasing interest in using wireless networks for closed loop control. The main advantages of Wireless Networked Control Systems (WNCSs) are the reconfigurability, easy commissioning and the possibility of installation in places where cabling is impossible. Despite these advantages, there are two main problems which must be considered for practical implementations of WNCSs. One problem is the sampling period constraint of industrial wireless sensors. This problem is related to the energy cost of the wireless transmission, since the power supply is limited, which precludes the use of these sensors in several closed-loop controls. The other technological concern in WNCS is the energy efficiency of the devices. As the sensors are powered by batteries, the lowest possible consumption is required to extend battery lifetime. As a result, there is a compromise between the sensor sampling period, the sensor battery lifetime and the required control performance for the WNCS. This paper develops a model-based soft sensor to overcome these problems and enable practical implementations of WNCSs. The goal of the soft sensor is generating virtual data allowing an actuation on the process faster than the maximum sampling period available for the wireless sensor. Experimental results have shown the soft sensor is a solution to the sampling period constraint problem of wireless sensors in control applications, enabling the application of industrial wireless sensors in WNCSs. Additionally, our results demonstrated the soft sensor potential for implementing energy efficient WNCS through the battery saving of industrial wireless sensors.

  16. Intelligent Wireless Sensor Network

    OpenAIRE

    Saeed, Bakhtiar I.; Mehrdadi, Bruce

    2010-01-01

    In recent years, there has been significant increase in utilisation of embedded-microcontrollers in broad range of applications extending from commercial products to industrial process system monitoring. Furthermore, improvements in speed, size and power consumption of microcontrollers with added wireless capabilities has provided new generation of applications. These include versatile and\\ud low cost solutions in wireless sensor networking applications such as wireless system monitoring and ...

  17. Real-time network traffic classification technique for wireless local area networks based on compressed sensing

    Science.gov (United States)

    Balouchestani, Mohammadreza

    2017-05-01

    Network traffic or data traffic in a Wireless Local Area Network (WLAN) is the amount of network packets moving across a wireless network from each wireless node to another wireless node, which provide the load of sampling in a wireless network. WLAN's Network traffic is the main component for network traffic measurement, network traffic control and simulation. Traffic classification technique is an essential tool for improving the Quality of Service (QoS) in different wireless networks in the complex applications such as local area networks, wireless local area networks, wireless personal area networks, wireless metropolitan area networks, and wide area networks. Network traffic classification is also an essential component in the products for QoS control in different wireless network systems and applications. Classifying network traffic in a WLAN allows to see what kinds of traffic we have in each part of the network, organize the various kinds of network traffic in each path into different classes in each path, and generate network traffic matrix in order to Identify and organize network traffic which is an important key for improving the QoS feature. To achieve effective network traffic classification, Real-time Network Traffic Classification (RNTC) algorithm for WLANs based on Compressed Sensing (CS) is presented in this paper. The fundamental goal of this algorithm is to solve difficult wireless network management problems. The proposed architecture allows reducing False Detection Rate (FDR) to 25% and Packet Delay (PD) to 15 %. The proposed architecture is also increased 10 % accuracy of wireless transmission, which provides a good background for establishing high quality wireless local area networks.

  18. Wireless Sensor Network Based Smart Parking System

    Directory of Open Access Journals (Sweden)

    Jeffrey JOSEPH

    2014-01-01

    Full Text Available Ambient Intelligence is a vision in which various devices come together and process information from multiple sources in order to exert control on the physical environment. In addition to computation and control, communication plays a crucial role in the overall functionality of such a system. Wireless Sensor Networks are one such class of networks, which meet these criteria. These networks consist of spatially distributed sensor motes which work in a co-operative manner to sense and control the environment. In this work, an implementation of an energy-efficient and cost-effective, wireless sensor networks based vehicle parking system for a multi-floor indoor parking facility has been introduced. The system monitors the availability of free parking slots and guides the vehicle to the nearest free slot. The amount of time the vehicle has been parked is monitored for billing purposes. The status of the motes (dead/alive is also recorded. Information like slot allocated, directions to the slot and billing data is sent as a message to customer’s mobile phones. This paper extends our previous work 1 with the development of a low cost sensor mote, about one tenth the cost of a commercially available mote, keeping in mind the price sensitive markets of the developing countries.

  19. Fast frequency hopping codes applied to SAC optical CDMA network

    Science.gov (United States)

    Tseng, Shin-Pin

    2015-06-01

    This study designed a fast frequency hopping (FFH) code family suitable for application in spectral-amplitude-coding (SAC) optical code-division multiple-access (CDMA) networks. The FFH code family can effectively suppress the effects of multiuser interference and had its origin in the frequency hopping code family. Additional codes were developed as secure codewords for enhancing the security of the network. In considering the system cost and flexibility, simple optical encoders/decoders using fiber Bragg gratings (FBGs) and a set of optical securers using two arrayed-waveguide grating (AWG) demultiplexers (DeMUXs) were also constructed. Based on a Gaussian approximation, expressions for evaluating the bit error rate (BER) and spectral efficiency (SE) of SAC optical CDMA networks are presented. The results indicated that the proposed SAC optical CDMA network exhibited favorable performance.

  20. Design and implementation about the campus wireless network

    International Nuclear Information System (INIS)

    Qi Fazhi; An Dehai; Wang Yanming; Cui Tao; Chen Gang; Liu Baoxu

    2007-01-01

    With the development of network applications, flexibility and wieldy is becoming more and more important for network users. Based on the analysis of the needs of campus wireless network. This article design and analysis the deployment mechanism, register system and protection system of wireless network. Built a wireless network system base on IHEP network environment, realization the 'always and everywhere' access the network in the IHEP campus area. (authors)

  1. Performance Analysis of IIUM Wireless Campus Network

    International Nuclear Information System (INIS)

    Latif, Suhaimi Abd; Masud, Mosharrof H; Anwar, Farhat

    2013-01-01

    International Islamic University Malaysia (IIUM) is one of the leading universities in the world in terms of quality of education that has been achieved due to providing numerous facilities including wireless services to every enrolled student. The quality of this wireless service is controlled and monitored by Information Technology Division (ITD), an ISO standardized organization under the university. This paper aims to investigate the constraints of wireless campus network of IIUM. It evaluates the performance of the IIUM wireless campus network in terms of delay, throughput and jitter. QualNet 5.2 simulator tool has employed to measure these performances of IIUM wireless campus network. The observation from the simulation result could be one of the influencing factors in improving wireless services for ITD and further improvement

  2. Mobility Models for Next Generation Wireless Networks Ad Hoc, Vehicular and Mesh Networks

    CERN Document Server

    Santi, Paolo

    2012-01-01

    Mobility Models for Next Generation Wireless Networks: Ad Hoc, Vehicular and Mesh Networks provides the reader with an overview of mobility modelling, encompassing both theoretical and practical aspects related to the challenging mobility modelling task. It also: Provides up-to-date coverage of mobility models for next generation wireless networksOffers an in-depth discussion of the most representative mobility models for major next generation wireless network application scenarios, including WLAN/mesh networks, vehicular networks, wireless sensor networks, and

  3. Information Assurance in Wireless Networks

    Science.gov (United States)

    Kabara, Joseph; Krishnamurthy, Prashant; Tipper, David

    2001-09-01

    Emerging wireless networks will contain a hybrid infrastructure based on fixed, mobile and ad hoc topologies and technologies. In such a dynamic architecture, we define information assurance as the provisions for both information security and information availability. The implications of this definition are that the wireless network architecture must (a) provide sufficient security measures, (b) be survivable under node or link attack or failure and (c) be designed such that sufficient capacity remains for all critical services (and preferably most other services) in the event of attack or component failure. We have begun a research project to investigate the provision of information assurance for wireless networks viz. survivability, security and availability and here discuss the issues and challenges therein.

  4. QoS and energy aware cooperative routing protocol for wildfire monitoring wireless sensor networks.

    Science.gov (United States)

    Maalej, Mohamed; Cherif, Sofiane; Besbes, Hichem

    2013-01-01

    Wireless sensor networks (WSN) are presented as proper solution for wildfire monitoring. However, this application requires a design of WSN taking into account the network lifetime and the shadowing effect generated by the trees in the forest environment. Cooperative communication is a promising solution for WSN which uses, at each hop, the resources of multiple nodes to transmit its data. Thus, by sharing resources between nodes, the transmission quality is enhanced. In this paper, we use the technique of reinforcement learning by opponent modeling, optimizing a cooperative communication protocol based on RSSI and node energy consumption in a competitive context (RSSI/energy-CC), that is, an energy and quality-of-service aware-based cooperative communication routing protocol. Simulation results show that the proposed algorithm performs well in terms of network lifetime, packet delay, and energy consumption.

  5. Applying Physical-Layer Network Coding in Wireless Networks

    Directory of Open Access Journals (Sweden)

    Liew SoungChang

    2010-01-01

    Full Text Available A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes, simultaneously. Rather than a blessing, this feature is treated more as an interference-inducing nuisance in most wireless networks today (e.g., IEEE 802.11. This paper shows that the concept of network coding can be applied at the physical layer to turn the broadcast property into a capacity-boosting advantage in wireless ad hoc networks. Specifically, we propose a physical-layer network coding (PNC scheme to coordinate transmissions among nodes. In contrast to "straightforward" network coding which performs coding arithmetic on digital bit streams after they have been received, PNC makes use of the additive nature of simultaneously arriving electromagnetic (EM waves for equivalent coding operation. And in doing so, PNC can potentially achieve 100% and 50% throughput increases compared with traditional transmission and straightforward network coding, respectively, in 1D regular linear networks with multiple random flows. The throughput improvements are even larger in 2D regular networks: 200% and 100%, respectively.

  6. Intrusion detection and monitoring for wireless networks.

    Energy Technology Data Exchange (ETDEWEB)

    Thomas, Eric D.; Van Randwyk, Jamie A.; Lee, Erik J.; Stephano, Amanda (Indiana University); Tabriz, Parisa (University of Illinois at Urbana-Champaign); Pelon, Kristen (Cedarville University); McCoy, Damon (University of Colorado, Boulder); Lodato, Mark (Lafayette College); Hemingway, Franklin (University of New Mexico); Custer, Ryan P.; Averin, Dimitry (Polytechnic University); Franklin, Jason (Carnegie Mellon University); Kilman, Dominique Marie

    2005-11-01

    Wireless computer networks are increasing exponentially around the world. They are being implemented in both the unlicensed radio frequency (RF) spectrum (IEEE 802.11a/b/g) and the licensed spectrum (e.g., Firetide [1] and Motorola Canopy [2]). Wireless networks operating in the unlicensed spectrum are by far the most popular wireless computer networks in existence. The open (i.e., proprietary) nature of the IEEE 802.11 protocols and the availability of ''free'' RF spectrum have encouraged many producers of enterprise and common off-the-shelf (COTS) computer networking equipment to jump into the wireless arena. Competition between these companies has driven down the price of 802.11 wireless networking equipment and has improved user experiences with such equipment. The end result has been an increased adoption of the equipment by businesses and consumers, the establishment of the Wi-Fi Alliance [3], and widespread use of the Alliance's ''Wi-Fi'' moniker to describe these networks. Consumers use 802.11 equipment at home to reduce the burden of running wires in existing construction, facilitate the sharing of broadband Internet services with roommates or neighbors, and increase their range of ''connectedness''. Private businesses and government entities (at all levels) are deploying wireless networks to reduce wiring costs, increase employee mobility, enable non-employees to access the Internet, and create an added revenue stream to their existing business models (coffee houses, airports, hotels, etc.). Municipalities (Philadelphia; San Francisco; Grand Haven, MI) are deploying wireless networks so they can bring broadband Internet access to places lacking such access; offer limited-speed broadband access to impoverished communities; offer broadband in places, such as marinas and state parks, that are passed over by traditional broadband providers; and provide themselves with higher quality, more

  7. Bluetooth-based wireless sensor networks

    Science.gov (United States)

    You, Ke; Liu, Rui Qiang

    2007-11-01

    In this work a Bluetooth-based wireless sensor network is proposed. In this bluetooth-based wireless sensor networks, information-driven star topology and energy-saved mode are used, through which a blue master node can control more than seven slave node, the energy of each sensor node is reduced and secure management of each sensor node is improved.

  8. Networking wireless sensors

    National Research Council Canada - National Science Library

    Krishnamachari, Bhaskar

    2005-01-01

    ... by networking techniques across multiple layers. The topics covered include network deployment, localization, time synchronization, wireless radio characteristics, medium-access, topology control, routing, data-centric techniques, and transport protocols. Ideal for researchers and designers seeking to create new algorithms and protocols and enginee...

  9. Research on Linear Wireless Sensor Networks Used for Online Monitoring of Rolling Bearing in Freight Train

    International Nuclear Information System (INIS)

    Wang Nan; Meng Qingfeng; Zheng Bin; Li Tong; Ma Qinghai

    2011-01-01

    This paper presents a Wireless Sensor Networks (WSNs) technique for the purpose of on-line monitoring of rolling bearing in freight train. A new technical scheme including the arrangements of sensors, the design of sensor nodes and base station, routing protocols, signal acquirement, processing and transmission is described, and an on-line monitoring system is established. Considering the approximately linear arrangements of cars and the running state of freight train, a linear topology structure of WSNs is adopted and five linear routing protocols are discussed in detail as to obtain the desired minimum energy consumption of WSNs. By analysing the simulation results, an optimal multi-hop routing protocol named sub-section routing protocol according to equal distance is adopted, in which all sensor nodes are divided into different groups according to the equal transmission distance, the optimal transmission distance and number of hops of routing protocol are also studied. We know that the communication consumes significant power in WSNs, so, in order to save the limit power supply of WSNs, the data compression and coding scheme based on lifting integer wavelet and embedded zerotree wavelet (EZW) algorithms is studied to reduce the amounts of data transmitted. The experimental results of rolling bearing have been given at last to verify the effectiveness of data compression algorithm. The on-line monitoring system of rolling bearing in freight train will be applied to actual application in the near future.

  10. Research on Linear Wireless Sensor Networks Used for Online Monitoring of Rolling Bearing in Freight Train

    Energy Technology Data Exchange (ETDEWEB)

    Wang Nan; Meng Qingfeng; Zheng Bin [Theory of Lubrication and Bearing Institute, Xi' an Jiaotong University Xi' an, 710049 (China); Li Tong; Ma Qinghai, E-mail: heroyoyu.2009@stu.xjtu.edu.cn [Xi' an Rail Bureau, Xi' an, 710054 (China)

    2011-07-19

    This paper presents a Wireless Sensor Networks (WSNs) technique for the purpose of on-line monitoring of rolling bearing in freight train. A new technical scheme including the arrangements of sensors, the design of sensor nodes and base station, routing protocols, signal acquirement, processing and transmission is described, and an on-line monitoring system is established. Considering the approximately linear arrangements of cars and the running state of freight train, a linear topology structure of WSNs is adopted and five linear routing protocols are discussed in detail as to obtain the desired minimum energy consumption of WSNs. By analysing the simulation results, an optimal multi-hop routing protocol named sub-section routing protocol according to equal distance is adopted, in which all sensor nodes are divided into different groups according to the equal transmission distance, the optimal transmission distance and number of hops of routing protocol are also studied. We know that the communication consumes significant power in WSNs, so, in order to save the limit power supply of WSNs, the data compression and coding scheme based on lifting integer wavelet and embedded zerotree wavelet (EZW) algorithms is studied to reduce the amounts of data transmitted. The experimental results of rolling bearing have been given at last to verify the effectiveness of data compression algorithm. The on-line monitoring system of rolling bearing in freight train will be applied to actual application in the near future.

  11. Hopping control channel MAC protocol for opportunistic spectrum access networks

    Institute of Scientific and Technical Information of China (English)

    FU Jing-tuan; JI Hong; MAO Xu

    2010-01-01

    Opportunistic spectrum access (OSA) is considered as a promising approach to mitigate spectrum scarcity by allowing unlicensed users to exploit spectrum opportunities in licensed frequency bands. Derived from the existing channel-hopping multiple access (CHMA) protocol,we introduce a hopping control channel medium access control (MAC) protocol in the context of OSA networks. In our proposed protocol,all nodes in the network follow a common channel-hopping sequence; every frequency channel can be used as control channel and data channel. Considering primary users' occupancy of the channel,we use a primary user (PU) detection model to calculate the channel availability for unlicensed users' access. Then,a discrete Markov chain analytical model is applied to describe the channel states and deduce the system throughput. Through simulation,we present numerical results to demonstrate the throughput performance of our protocol and thus validate our work.

  12. mm-Wave Hybrid Photonic Wireless Links for Ultra-High Speed Wireless Transmissions

    DEFF Research Database (Denmark)

    Rommel, Simon; Vegas Olmos, Juan José; Tafur Monroy, Idelfonso

    Hybrid photonic-wireless transmission schemes in the mm-wave frequency range are promising candidates to enable the multi-gigabit per second data communications required from wireless and mobile networks of the 5th and future generations. Large FCC spectrum allocations for wireless transmission...

  13. Resilient Disaster Network Based on Software Defined Cognitive Wireless Network Technology

    Directory of Open Access Journals (Sweden)

    Goshi Sato

    2015-01-01

    Full Text Available In order to temporally recover the information network infrastructure in disaster areas from the Great East Japan Earthquake in 2011, various wireless network technologies such as satellite IP network, 3G, and Wi-Fi were effectively used. However, since those wireless networks are individually introduced and installed but not totally integrated, some of networks were congested due to the sudden network traffic generation and unbalanced traffic distribution, and eventually the total network could not effectively function. In this paper, we propose a disaster resilient network which integrates various wireless networks into a cognitive wireless network that users can use as an access network to the Internet at the serious disaster occurrence. We designed and developed the disaster resilient network based on software defined network (SDN technology to automatically select the best network link and route among the possible access networks to the Internet by periodically monitoring their network states and evaluate those using extended AHP method. In order to verify the usefulness of our proposed system, a prototype system is constructed and its performance is evaluated.

  14. The Benefits of Soft Sensor and Multi-Rate Control for the Implementation of Wireless Networked Control Systems

    Directory of Open Access Journals (Sweden)

    Raul K. Mansano

    2014-12-01

    Full Text Available Recent advances in wireless networking technology and the proliferation of industrial wireless sensors have led to an increasing interest in using wireless networks for closed loop control. The main advantages of Wireless Networked Control Systems (WNCSs are the reconfigurability, easy commissioning and the possibility of installation in places where cabling is impossible. Despite these advantages, there are two main problems which must be considered for practical implementations of WNCSs. One problem is the sampling period constraint of industrial wireless sensors. This problem is related to the energy cost of the wireless transmission, since the power supply is limited, which precludes the use of these sensors in several closed-loop controls. The other technological concern in WNCS is the energy efficiency of the devices. As the sensors are powered by batteries, the lowest possible consumption is required to extend battery lifetime. As a result, there is a compromise between the sensor sampling period, the sensor battery lifetime and the required control performance for the WNCS. This paper develops a model-based soft sensor to overcome these problems and enable practical implementations of WNCSs. The goal of the soft sensor is generating virtual data allowing an actuation on the process faster than the maximum sampling period available for the wireless sensor. Experimental results have shown the soft sensor is a solution to the sampling period constraint problem of wireless sensors in control applications, enabling the application of industrial wireless sensors in WNCSs. Additionally, our results demonstrated the soft sensor potential for implementing energy efficient WNCS through the battery saving of industrial wireless sensors.

  15. Energy neutral and low power wireless communications

    Science.gov (United States)

    Orhan, Oner

    Wireless sensor nodes are typically designed to have low cost and small size. These design objectives impose restrictions on the capacity and efficiency of the transceiver components and energy storage units that can be used. As a result, energy becomes a bottleneck and continuous operation of the sensor network requires frequent battery replacements, increasing the maintenance cost. Energy harvesting and energy efficient transceiver architectures are able to overcome these challenges by collecting energy from the environment and utilizing the energy in an intelligent manner. However, due to the nature of the ambient energy sources, the amount of useful energy that can be harvested is limited and unreliable. Consequently, optimal management of the harvested energy and design of low power transceivers pose new challenges for wireless network design and operation. The first part of this dissertation is on energy neutral wireless networking, where optimal transmission schemes under different system setups and objectives are investigated. First, throughput maximization for energy harvesting two-hop networks with decode-and-forward half-duplex relays is studied. For a system with two parallel relays, various combinations of the following four transmission modes are considered: Broadcast from the source, multi-access from the relays, and successive relaying phases I and II. Next, the energy cost of the processing circuitry as well as the transmission energy are taken into account for communication over a broadband fading channel powered by an energy harvesting transmitter. Under this setup, throughput maximization, energy maximization, and transmission completion time minimization problems are studied. Finally, source and channel coding for an energy-limited wireless sensor node is investigated under various energy constraints including energy harvesting, processing and sampling costs. For each objective, optimal transmission policies are formulated as the solutions of a

  16. Design and Implementation of an Enhanced 802.11 MAC Architecture for Single-Hop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Ralph Bernasconi

    2007-01-01

    Full Text Available Due to its extreme simplicity and flexibility, the IEEE 802.11 standard is the dominant technology to implement both infrastructure-based WLANs and single-hop ad hoc networks. In spite of its popularity, there is a vast literature demonstrating the shortcomings of using the 802.11 technology in such environments, such as dramatic degradation of network capacity as contention increases and vulnerability to external interferences. Therefore, the design of enhancements and optimizations for the original 802.11 MAC protocol has been a very active research area in the last years. However, all these modifications to the 802.11 MAC protocol were validated only through simulations and/or analytical investigations. In this paper, we present a very unique work as we have designed a flexible hardware/software platform, fully compatible with current implementations of the IEEE 802.11 technology, which we have used to concretely implement and test an enhanced 802.11 backoff algorithm. Our experimental results clearly show that the enhanced mechanism outperforms the standard 802.11 MAC protocol in real scenarios.

  17. Self-Similar Traffic In Wireless Networks

    OpenAIRE

    Jerjomins, R.; Petersons, E.

    2005-01-01

    Many studies have shown that traffic in Ethernet and other wired networks is self-similar. This paper reveals that wireless network traffic is also self-similar and long-range dependant by analyzing big amount of data captured from the wireless router.

  18. A decentralized scheduling algorithm for time synchronized channel hopping

    Directory of Open Access Journals (Sweden)

    Andrew Tinka

    2011-09-01

    Full Text Available Time Synchronized Channel Hopping (TSCH is an existing Medium Access Control scheme which enables robust communication through channel hopping and high data rates through synchronization. It is based on a time-slotted architecture, and its correct functioning depends on a schedule which is typically computed by a central node. This paper presents, to our knowledge, the first scheduling algorithm for TSCH networks which both is distributed and which copes with mobile nodes. Two variations on scheduling algorithms are presented. Aloha-based scheduling allocates one channel for broadcasting advertisements for new neighbors. Reservation- based scheduling augments Aloha-based scheduling with a dedicated timeslot for targeted advertisements based on gossip information. A mobile ad hoc motorized sensor network with frequent connectivity changes is studied, and the performance of the two proposed algorithms is assessed. This performance analysis uses both simulation results and the results of a field deployment of floating wireless sensors in an estuarial canal environment. Reservation-based scheduling performs significantly better than Aloha-based scheduling, suggesting that the improved network reactivity is worth the increased algorithmic complexity and resource consumption.

  19. Topological Analysis of Wireless Networks (TAWN)

    Science.gov (United States)

    2016-05-31

    19b. TELEPHONE NUMBER (Include area code) 31-05-2016 FINAL REPORT 12-02-2015 -- 31-05-2016 Topological Analysis of Wireless Networks (TAWN) Robinson...Release, Distribution Unlimited) N/A The goal of this project was to develop topological methods to detect and localize vulnerabilities of wireless... topology U U U UU 32 Michael Robinson 202-885-3681 Final Report: May 2016 Topological Analysis of Wireless Networks Principal Investigator: Prof. Michael

  20. Towards Optimal Buffer Size in Wi-Fi Networks

    KAUST Repository

    Showail, Ahmad J.

    2016-01-19

    Buffer sizing is an important network configuration parameter that impacts the quality of data traffic. Falling memory cost and the fallacy that ‘more is better’ lead to over provisioning network devices with large buffers. Over-buffering or the so called ‘bufferbloat’ phenomenon creates excessive end-to-end delay in today’s networks. On the other hand, under-buffering results in frequent packet loss and subsequent under-utilization of network resources. The buffer sizing problem has been studied extensively for wired networks. However, there is little work addressing the unique challenges of wireless environment. In this dissertation, we discuss buffer sizing challenges in wireless networks, classify the state-of-the-art solutions, and propose two novel buffer sizing schemes. The first scheme targets buffer sizing in wireless multi-hop networks where the radio spectral resource is shared among a set of con- tending nodes. Hence, it sizes the buffer collectively and distributes it over a set of interfering devices. The second buffer sizing scheme is designed to cope up with recent Wi-Fi enhancements. It adapts the buffer size based on measured link characteristics and network load. Also, it enforces limits on the buffer size to maximize frame aggregation benefits. Both mechanisms are evaluated using simulation as well as testbed implementation over half-duplex and full-duplex wireless networks. Experimental evaluation shows that our proposal reduces latency by an order of magnitude.

  1. Resource slicing in virtual wireless networks: a survey

    OpenAIRE

    Richart, Matias; Baliosian De Lazzari, Javier Ernesto; Serrat Fernández, Juan; Gorricho Moreno, Juan Luis

    2016-01-01

    New architectural and design approaches for radio access networks have appeared with the introduction of network virtualization in the wireless domain. One of these approaches splits the wireless network infrastructure into isolated virtual slices under their own management, requirements, and characteristics. Despite the advances in wireless virtualization, there are still many open issues regarding the resource allocation and isolation of wireless slices. Because of the dynamics and share...

  2. Cooperative Diversity in Wireless Networks

    Directory of Open Access Journals (Sweden)

    A. Mahmood

    2010-01-01

    Full Text Available Transmit Diversity is an effective methodology for improving the quality and reliability of a wireless network by reducingthe effects of fading. As majority of the wireless devices (i.e. mobile handsets, etc are limited to only one antenna, especiallydue to hardware constraints, size and cost factors; cooperative communication can be utilized in order to generatetransmit diversity [1]. This enables single antenna wireless devices to share their antennas during transmission in such amanner that creates a virtual MIMO (multiple-input and multiple-output system [2] [3]. In this paper, we will analyze therecent developments and trends in this promising area of wireless Ad hoc networks. The article will also discuss variousmain cooperative signaling methods and will also observe their performance.

  3. On the Capacity of a GSM Frequency Hopping network with Intelligent Underlayer-Overlayer

    DEFF Research Database (Denmark)

    Nielsen, Thomas Toftegaard; Wigard, Jeroen; Mogensen, Preben Elgaard

    1997-01-01

    . By combining this reuse partitioning with frequency hopping, an increase in the network capacity in terms of carried traffic per cell is achieved. Simulations have indicated that for slow moving mobiles a gain of approximately 35% is achieved by this new feature when compared with a frequency hopping network...

  4. Sensor Fusion-based Event Detection in Wireless Sensor Networks

    NARCIS (Netherlands)

    Bahrepour, M.; Meratnia, Nirvana; Havinga, Paul J.M.

    2009-01-01

    Recently, Wireless Sensor Networks (WSN) community has witnessed an application focus shift. Although, monitoring was the initial application of wireless sensor networks, in-network data processing and (near) real-time actuation capability have made wireless sensor networks suitable candidate for

  5. Wireless Sensor Network –A Survey

    OpenAIRE

    Nirvika Chouhan; P.D.Vyavahare; Rekha Jain

    2013-01-01

    Wireless sensor networks are the networks consisting of large number of small and tiny sensor nodes. The nodes are supplied with limited power, memory and other resources and perform in-network processing. In this paper, various issues are discussed that actually put the limitations in the well working and the life time of the network. In Wireless sensor network, nodes should consume less power, memoryand so data aggregation should be performed. Security is another aspect which should be pres...

  6. A Nodes Deployment Algorithm in Wireless Sensor Network Based on Distribution

    Directory of Open Access Journals (Sweden)

    Song Yuli

    2014-07-01

    Full Text Available Wireless sensor network coverage is a basic problem of wireless sensor network. In this paper, we propose a wireless sensor network node deployment algorithm base on distribution in order to form an efficient wireless sensor network. The iteratively greedy algorithm is used in this paper to choose priority nodes into active until the entire network is covered by wireless sensor nodes, the whole network to multiply connected. The simulation results show that the distributed wireless sensor network node deployment algorithm can form a multiply connected wireless sensor network.

  7. Wireless Network Penetration Testing and Security Auditing

    Directory of Open Access Journals (Sweden)

    Wang Shao-Long

    2016-01-01

    Full Text Available IEEE802.11 wireless wireless networks have security issues that are vulnerable to a variety of attacks. Due to using radio to transport data, attackers can bypass firewalls, sniff sensitive information, intercept packets and send malicious packets. Security auditing and penetration testing is expected to ensure wireless networks security. The contributions of this work are analyzed the vulnerability and types of attacks pertaining to IEEE 802.11 WLAN, performed well known attacks in a laboratory environment to conduct penetration tests to confirm whether our wireless network is hackable or not. WAIDPS is configured as auditing tool to view wireless attacks, such as WEP/WPA/WPA2 cracking, rouge access points, denial of service attack. WAIDPS is designed to detect wireless intrusion with additional features. Penetration testing and auditing will mitigate the risk and threatening to protect WALN.

  8. Wireless Sensor Networks Database: Data Management and Implementation

    Directory of Open Access Journals (Sweden)

    Ping Liu

    2014-04-01

    Full Text Available As the core application of wireless sensor network technology, Data management and processing have become the research hotspot in the new database. This article studied mainly data management in wireless sensor networks, in connection with the characteristics of the data in wireless sensor networks, discussed wireless sensor network data query, integrating technology in-depth, proposed a mobile database structure based on wireless sensor network and carried out overall design and implementation for the data management system. In order to achieve the communication rules of above routing trees, network manager uses a simple maintenance algorithm of routing trees. Design ordinary node end, server end in mobile database at gathering nodes and mobile client end that can implement the system, focus on designing query manager, storage modules and synchronous module at server end in mobile database at gathering nodes.

  9. Using the PALS Architecture to Verify a Distributed Topology Control Protocol for Wireless Multi-Hop Networks in the Presence of Node Failures

    Directory of Open Access Journals (Sweden)

    José Meseguer

    2010-09-01

    Full Text Available The PALS architecture reduces distributed, real-time asynchronous system design to the design of a synchronous system under reasonable requirements. Assuming logical synchrony leads to fewer system behaviors and provides a conceptually simpler paradigm for engineering purposes. One of the current limitations of the framework is that from a set of independent "synchronous machines", one must compose the entire synchronous system by hand, which is tedious and error-prone. We use Maude's meta-level to automatically generate a synchronous composition from user-provided component machines and a description of how the machines communicate with each other. We then use the new capabilities to verify the correctness of a distributed topology control protocol for wireless networks in the presence of nodes that may fail.

  10. Wireless sensor networks in chemical industry

    International Nuclear Information System (INIS)

    Minhas, A.A.; Jawad, S.

    2010-01-01

    Recent advances in wireless technology are a clear indication of the commercial promise of wireless networks. Industrial wireless sensing has now become more economical, efficient and secure as compared to traditional wired sensing. Wireless Sensor Networks (WSN) are successfully being used for process monitoring and control of many industrial plants. This paper explores how Chemical Industry in particular can benefit from the application of WSN technology. Various examples of successful implementation are cited. In order to address the industrial requirements, we propose a low power and low cost solution for process monitoring by implementing WSN. (author)

  11. On the Conditional Entropy of Wireless Networks

    DEFF Research Database (Denmark)

    Coon, Justin P.; Badiu, Mihai Alin; Gündüz, Deniz

    2018-01-01

    The characterization of topological uncertainty in wireless networks using the formalism of graph entropy has received interest in the spatial networks community. In this paper, we develop lower bounds on the entropy of a wireless network by conditioning on potential network observables. Two appr...... a homogeneous binomial point process in this work) and the network topology....

  12. A versatile infinite-state Markov reward model to study bottlenecks in 2-hop ad hoc networks

    NARCIS (Netherlands)

    Remke, Anne Katharina Ingrid; Haverkort, Boudewijn R.H.M.; Cloth, L.

    2006-01-01

    In a 2-hop IEEE 801.11-based wireless LAN, the distributed coordination function (DCF) tends to equally share the available capacity among the contending stations. Recently alternative capacity sharing strategies have been made possible. We propose a versatile infinite-state Markov reward model to

  13. Battling Latency in Modern Wireless Networks

    KAUST Repository

    Showail, Ahmad

    2018-05-15

    Buffer sizing has a tremendous effect on the performance of Wi-Fi based networks. Choosing the right buffer size is challenging due to the dynamic nature of the wireless environment. Over buffering or ‘bufferbloat’ may produce unacceptable endto-end delays. On the other hand, small buffers may limit the performance gains that can be obtained with various IEEE 802.11n/ac enhancements, such as frame aggregation. We propose Wireless Queue Management (WQM), a novel, practical, and lightweight queue management scheme for wireless networks. WQM adapts the buffer size based on the wireless link characteristics and the network load. Furthermore, it accounts for aggregates length when deciding on the optimal buffer size. We evaluate WQM using our 10 nodes wireless testbed. WQM reduces the end-to-end delay by an order of magnitude compared to the default buffer size in Linux while achieving similar network throughput. Also, WQM outperforms state of the art bufferbloat solutions, namely CoDel and PIE. WQM achieves 7× less latency compared to PIE, and 2× compared to CoDel at the cost of 8% drop in goodput in the worst case. Further, WQM improves network fairness as it limits the ability of a single flow to saturate the buffers.

  14. Battling Latency in Modern Wireless Networks

    KAUST Repository

    Showail, Ahmad; Shihada, Basem

    2018-01-01

    Buffer sizing has a tremendous effect on the performance of Wi-Fi based networks. Choosing the right buffer size is challenging due to the dynamic nature of the wireless environment. Over buffering or ‘bufferbloat’ may produce unacceptable endto-end delays. On the other hand, small buffers may limit the performance gains that can be obtained with various IEEE 802.11n/ac enhancements, such as frame aggregation. We propose Wireless Queue Management (WQM), a novel, practical, and lightweight queue management scheme for wireless networks. WQM adapts the buffer size based on the wireless link characteristics and the network load. Furthermore, it accounts for aggregates length when deciding on the optimal buffer size. We evaluate WQM using our 10 nodes wireless testbed. WQM reduces the end-to-end delay by an order of magnitude compared to the default buffer size in Linux while achieving similar network throughput. Also, WQM outperforms state of the art bufferbloat solutions, namely CoDel and PIE. WQM achieves 7× less latency compared to PIE, and 2× compared to CoDel at the cost of 8% drop in goodput in the worst case. Further, WQM improves network fairness as it limits the ability of a single flow to saturate the buffers.

  15. A Cluster-Based Dual-Adaptive Topology Control Approach in Wireless Sensor Networks.

    Science.gov (United States)

    Gui, Jinsong; Zhou, Kai; Xiong, Naixue

    2016-09-25

    Multi-Input Multi-Output (MIMO) can improve wireless network performance. Sensors are usually single-antenna devices due to the high hardware complexity and cost, so several sensors are used to form virtual MIMO array, which is a desirable approach to efficiently take advantage of MIMO gains. Also, in large Wireless Sensor Networks (WSNs), clustering can improve the network scalability, which is an effective topology control approach. The existing virtual MIMO-based clustering schemes do not either fully explore the benefits of MIMO or adaptively determine the clustering ranges. Also, clustering mechanism needs to be further improved to enhance the cluster structure life. In this paper, we propose an improved clustering scheme for virtual MIMO-based topology construction (ICV-MIMO), which can determine adaptively not only the inter-cluster transmission modes but also the clustering ranges. Through the rational division of cluster head function and the optimization of cluster head selection criteria and information exchange process, the ICV-MIMO scheme effectively reduces the network energy consumption and improves the lifetime of the cluster structure when compared with the existing typical virtual MIMO-based scheme. Moreover, the message overhead and time complexity are still in the same order of magnitude.

  16. Wireless traffic steering for green cellular networks

    CERN Document Server

    Zhang, Shan; Zhou, Sheng; Niu, Zhisheng; Shen, Xuemin (Sherman)

    2016-01-01

    This book introduces wireless traffic steering as a paradigm to realize green communication in multi-tier heterogeneous cellular networks. By matching network resources and dynamic mobile traffic demand, traffic steering helps to reduce on-grid power consumption with on-demand services provided. This book reviews existing solutions from the perspectives of energy consumption reduction and renewable energy harvesting. Specifically, it explains how traffic steering can improve energy efficiency through intelligent traffic-resource matching. Several promising traffic steering approaches for dynamic network planning and renewable energy demand-supply balancing are discussed. This book presents an energy-aware traffic steering method for networks with energy harvesting, which optimizes the traffic allocated to each cell based on the renewable energy status. Renewable energy demand-supply balancing is a key factor in energy dynamics, aimed at enhancing renewable energy sustainability to reduce on-grid energy consum...

  17. A Study on Wireless Charging for Prolonging the Lifetime of Wireless Sensor Networks.

    Science.gov (United States)

    Tu, Weijian; Xu, Xianghua; Ye, Tingcong; Cheng, Zongmao

    2017-07-04

    Wireless charging is an important issue in wireless sensor networks, since it can provide an emerging and effective solution in the absence of other power supplies. The state-of-the-art methods employ a mobile car and a predefined moving path to charge the sensor nodes in the network. Previous studies only consider a factor of the network (i.e., residual energy of sensor node) as a constraint to design the wireless charging strategy. However, other factors, such as the travelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy. In this work, we study wireless charging strategy based on the analysis of a combination of two factors, including the residual energy of sensor nodes and the travelled distance of the charging car. Firstly, we theoretically analyze the limited size of the sensor network to match the capability of a charging car. Then, the networked factors are selected as the weights of traveling salesman problem (TSP) to design the moving path of the charging car. Thirdly, the charging time of each sensor node is computed based on the linear programming problem for the charging car. Finally, a charging period for the network is studied. The experimental results show that the proposed approach can significantly maximize the lifetime of the wireless sensor network.

  18. A Study on Wireless Charging for Prolonging the Lifetime of Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Weijian Tu

    2017-07-01

    Full Text Available Wireless charging is an important issue in wireless sensor networks, since it can provide an emerging and effective solution in the absence of other power supplies. The state-of-the-art methods employ a mobile car and a predefined moving path to charge the sensor nodes in the network. Previous studies only consider a factor of the network (i.e., residual energy of sensor node as a constraint to design the wireless charging strategy. However, other factors, such as the travelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy. In this work, we study wireless charging strategy based on the analysis of a combination of two factors, including the residual energy of sensor nodes and the travelled distance of the charging car. Firstly, we theoretically analyze the limited size of the sensor network to match the capability of a charging car. Then, the networked factors are selected as the weights of traveling salesman problem (TSP to design the moving path of the charging car. Thirdly, the charging time of each sensor node is computed based on the linear programming problem for the charging car. Finally, a charging period for the network is studied. The experimental results show that the proposed approach can significantly maximize the lifetime of the wireless sensor network.

  19. EDITORIAL Wireless sensor networks: design for real-life deployment and deployment experiences Wireless sensor networks: design for real-life deployment and deployment experiences

    Science.gov (United States)

    Gaura, Elena; Roedig, Utz; Brusey, James

    2010-12-01

    modalities and (iv) system solutions with high end-user added value and cost benefits. The common thread is deployment and deployment evaluation. In particular, satisfaction of application requirements, involvement of the end-user in the design and deployment process, satisfactory system performance and user acceptance are concerns addressed in many of the contributions. The contributions form a valuable set, which help to identify the priorities for research in this burgeoning area: Robust, reliable and efficient data collection in embedded wireless multi-hop networks are essential elements in creating a true deploy-and-forget user experience. Maintaining full connectivity within a WSN, in a real world environment populated by other WSNs, WiFi networks or Bluetooth devices that constitute sources of interference is a key element in any application, but more so for those that are safety-critical, such as disaster response. Awareness of the effects of wireless channel, physical position and line-of-sight on received signal strength in real-world, outdoor environments will shape the design of many outdoor applications. Thus, the quantification of such effects is valuable knowledge for designers. Sensors' failure detection, scalability and commercialization are common challenges in many long-term monitoring applications; transferable solutions are evidenced here in the context of pollutant detection and water quality. Innovative, alternative thinking is often needed to achieve the desired long-lived networks when power-hungry sensors are foreseen components; in some instances, the very problems of wireless technology, such as RF irregularity, can be transformed into advantages. The importance of an iterative design and evaluation methodology—from analysis to simulation to real-life deployment—should be well understood by all WSN developers. The value of this is highlighted in the context of a challenging WPAN video-surveillance application based on a novel Nomadic Access

  20. Maximizing lifetime of wireless sensor networks using genetic approach

    DEFF Research Database (Denmark)

    Wagh, Sanjeev; Prasad, Ramjee

    2014-01-01

    The wireless sensor networks are designed to install the smart network applications or network for emergency solutions, where human interaction is not possible. The nodes in wireless sensor networks have to self organize as per the users requirements through monitoring environments. As the sensor......-objective parameters are considered to solve the problem using genetic algorithm of evolutionary approach.......The wireless sensor networks are designed to install the smart network applications or network for emergency solutions, where human interaction is not possible. The nodes in wireless sensor networks have to self organize as per the users requirements through monitoring environments. As the sensor...

  1. Concave switching in single-hop and multihop networks

    NARCIS (Netherlands)

    Walton, N.

    2015-01-01

    Switched queueing networks model wireless networks, input-queued switches, and numerous other networked communications systems. We consider an (\\(\\alpha ,g\\))-switch policy; these policies provide a generalization of the MaxWeight policies of Tassiulas and Ephremides (IEEE Trans Autom Control

  2. A Multi-Sensor RSS Spatial Sensing-Based Robust Stochastic Optimization Algorithm for Enhanced Wireless Tethering

    Science.gov (United States)

    Parasuraman, Ramviyas; Fabry, Thomas; Molinari, Luca; Kershaw, Keith; Di Castro, Mario; Masi, Alessandro; Ferre, Manuel

    2014-01-01

    The reliability of wireless communication in a network of mobile wireless robot nodes depends on the received radio signal strength (RSS). When the robot nodes are deployed in hostile environments with ionizing radiations (such as in some scientific facilities), there is a possibility that some electronic components may fail randomly (due to radiation effects), which causes problems in wireless connectivity. The objective of this paper is to maximize robot mission capabilities by maximizing the wireless network capacity and to reduce the risk of communication failure. Thus, in this paper, we consider a multi-node wireless tethering structure called the “server-relay-client” framework that uses (multiple) relay nodes in between a server and a client node. We propose a robust stochastic optimization (RSO) algorithm using a multi-sensor-based RSS sampling method at the relay nodes to efficiently improve and balance the RSS between the source and client nodes to improve the network capacity and to provide redundant networking abilities. We use pre-processing techniques, such as exponential moving averaging and spatial averaging filters on the RSS data for smoothing. We apply a receiver spatial diversity concept and employ a position controller on the relay node using a stochastic gradient ascent method for self-positioning the relay node to achieve the RSS balancing task. The effectiveness of the proposed solution is validated by extensive simulations and field experiments in CERN facilities. For the field trials, we used a youBot mobile robot platform as the relay node, and two stand-alone Raspberry Pi computers as the client and server nodes. The algorithm has been proven to be robust to noise in the radio signals and to work effectively even under non-line-of-sight conditions. PMID:25615734

  3. A Multi-Sensor RSS Spatial Sensing-Based Robust Stochastic Optimization Algorithm for Enhanced Wireless Tethering

    Directory of Open Access Journals (Sweden)

    Ramviyas Parasuraman

    2014-12-01

    Full Text Available The reliability of wireless communication in a network of mobile wireless robot nodes depends on the received radio signal strength (RSS. When the robot nodes are deployed in hostile environments with ionizing radiations (such as in some scientific facilities, there is a possibility that some electronic components may fail randomly (due to radiation effects, which causes problems in wireless connectivity. The objective of this paper is to maximize robot mission capabilities by maximizing the wireless network capacity and to reduce the risk of communication failure. Thus, in this paper, we consider a multi-node wireless tethering structure called the “server-relay-client” framework that uses (multiple relay nodes in between a server and a client node. We propose a robust stochastic optimization (RSO algorithm using a multi-sensor-based RSS sampling method at the relay nodes to efficiently improve and balance the RSS between the source and client nodes to improve the network capacity and to provide redundant networking abilities. We use pre-processing techniques, such as exponential moving averaging and spatial averaging filters on the RSS data for smoothing. We apply a receiver spatial diversity concept and employ a position controller on the relay node using a stochastic gradient ascent method for self-positioning the relay node to achieve the RSS balancing task. The effectiveness of the proposed solution is validated by extensive simulations and field experiments in CERN facilities. For the field trials, we used a youBot mobile robot platform as the relay node, and two stand-alone Raspberry Pi computers as the client and server nodes. The algorithm has been proven to be robust to noise in the radio signals and to work effectively even under non-line-of-sight conditions.

  4. Cognitive Radio Wireless Sensor Networks: Applications, Challenges and Research Trends

    Science.gov (United States)

    Joshi, Gyanendra Prasad; Nam, Seung Yeob; Kim, Sung Won

    2013-01-01

    A cognitive radio wireless sensor network is one of the candidate areas where cognitive techniques can be used for opportunistic spectrum access. Research in this area is still in its infancy, but it is progressing rapidly. The aim of this study is to classify the existing literature of this fast emerging application area of cognitive radio wireless sensor networks, highlight the key research that has already been undertaken, and indicate open problems. This paper describes the advantages of cognitive radio wireless sensor networks, the difference between ad hoc cognitive radio networks, wireless sensor networks, and cognitive radio wireless sensor networks, potential application areas of cognitive radio wireless sensor networks, challenges and research trend in cognitive radio wireless sensor networks. The sensing schemes suited for cognitive radio wireless sensor networks scenarios are discussed with an emphasis on cooperation and spectrum access methods that ensure the availability of the required QoS. Finally, this paper lists several open research challenges aimed at drawing the attention of the readers toward the important issues that need to be addressed before the vision of completely autonomous cognitive radio wireless sensor networks can be realized. PMID:23974152

  5. Cognitive Radio Wireless Sensor Networks: Applications, Challenges and Research Trends

    Directory of Open Access Journals (Sweden)

    Gyanendra Prasad Joshi

    2013-08-01

    Full Text Available A cognitive radio wireless sensor network is one of the candidate areas where cognitive techniques can be used for opportunistic spectrum access. Research in this area is still in its infancy, but it is progressing rapidly. The aim of this study is to classify the existing literature of this fast emerging application area of cognitive radio wireless sensor networks, highlight the key research that has already been undertaken, and indicate open problems. This paper describes the advantages of cognitive radio wireless sensor networks, the difference between ad hoc cognitive radio networks, wireless sensor networks, and cognitive radio wireless sensor networks, potential application areas of cognitive radio wireless sensor networks, challenges and research trend in cognitive radio wireless sensor networks. The sensing schemes suited for cognitive radio wireless sensor networks scenarios are discussed with an emphasis on cooperation and spectrum access methods that ensure the availability of the required QoS. Finally, this paper lists several open research challenges aimed at drawing the attention of the readers toward the important issues that need to be addressed before the vision of completely autonomous cognitive radio wireless sensor networks can be realized.

  6. Cognitive radio wireless sensor networks: applications, challenges and research trends.

    Science.gov (United States)

    Joshi, Gyanendra Prasad; Nam, Seung Yeob; Kim, Sung Won

    2013-08-22

    A cognitive radio wireless sensor network is one of the candidate areas where cognitive techniques can be used for opportunistic spectrum access. Research in this area is still in its infancy, but it is progressing rapidly. The aim of this study is to classify the existing literature of this fast emerging application area of cognitive radio wireless sensor networks, highlight the key research that has already been undertaken, and indicate open problems. This paper describes the advantages of cognitive radio wireless sensor networks, the difference between ad hoc cognitive radio networks, wireless sensor networks, and cognitive radio wireless sensor networks, potential application areas of cognitive radio wireless sensor networks, challenges and research trend in cognitive radio wireless sensor networks. The sensing schemes suited for cognitive radio wireless sensor networks scenarios are discussed with an emphasis on cooperation and spectrum access methods that ensure the availability of the required QoS. Finally, this paper lists several open research challenges aimed at drawing the attention of the readers toward the important issues that need to be addressed before the vision of completely autonomous cognitive radio wireless sensor networks can be realized.

  7. Future Wireless Network: MyNET Platform and End-to-End Network Slicing

    OpenAIRE

    Zhang, Hang

    2016-01-01

    Future wireless networks are facing new challenges. These new challenges require new solutions and strategies of the network deployment, management, and operation. Many driving factors are decisive in the re-definition and re-design of the future wireless network architecture. In the previously published paper "5G Wireless Network - MyNET and SONAC", MyNET and SONAC, a future network architecture, are described. This paper elaborates MyNET platform with more details. The design principles of ...

  8. Average Throughput Performance of Myopic Policy in Energy Harvesting Wireless Sensor Networks.

    Science.gov (United States)

    Gul, Omer Melih; Demirekler, Mubeccel

    2017-09-26

    This paper considers a single-hop wireless sensor network where a fusion center collects data from M energy harvesting wireless sensors. The harvested energy is stored losslessly in an infinite-capacity battery at each sensor. In each time slot, the fusion center schedules K sensors for data transmission over K orthogonal channels. The fusion center does not have direct knowledge on the battery states of sensors, or the statistics of their energy harvesting processes. The fusion center only has information of the outcomes of previous transmission attempts. It is assumed that the sensors are data backlogged, there is no battery leakage and the communication is error-free. An energy harvesting sensor can transmit data to the fusion center whenever being scheduled only if it has enough energy for data transmission. We investigate average throughput of Round-Robin type myopic policy both analytically and numerically under an average reward (throughput) criterion. We show that Round-Robin type myopic policy achieves optimality for some class of energy harvesting processes although it is suboptimal for a broad class of energy harvesting processes.

  9. Wireless Power Transfer in Cooperative DF Relaying Networks with Log-Normal Fading

    KAUST Repository

    Rabie, Khaled M.; Adebisi, Bamidele; Alouini, Mohamed-Slim

    2017-01-01

    Energy-harvesting (EH) and wireless power transfer in cooperative relaying networks have recently attracted a considerable amount of research attention. Most of the existing work on this topic however focuses on Rayleigh fading channels which represents outdoor environments. Unlike these studies, in this paper we analyze the performance of wireless power transfer in two-hop decode-and- forward (DF) cooperative relaying systems in indoor channels characterized by log-normal fading. Three well-known EH protocols are considered in our evaluations: a) time switching relaying (TSR), b) power splitting relaying (PSR) and c) ideal relaying receiver (IRR). The performance is evaluated in terms of the ergodic outage probability for which we derive accurate analytical expressions for the three systems under consideration. Results reveal that careful selection of the EH time and power splitting factors in the TSR- and PSR-based system are important to optimize performance. It is also presented that the optimized PSR system has near- ideal performance and that increasing the source transmit power and/or the energy harvester efficiency can further improve performance.

  10. Wireless Power Transfer in Cooperative DF Relaying Networks with Log-Normal Fading

    KAUST Repository

    Rabie, Khaled M.

    2017-02-07

    Energy-harvesting (EH) and wireless power transfer in cooperative relaying networks have recently attracted a considerable amount of research attention. Most of the existing work on this topic however focuses on Rayleigh fading channels which represents outdoor environments. Unlike these studies, in this paper we analyze the performance of wireless power transfer in two-hop decode-and- forward (DF) cooperative relaying systems in indoor channels characterized by log-normal fading. Three well-known EH protocols are considered in our evaluations: a) time switching relaying (TSR), b) power splitting relaying (PSR) and c) ideal relaying receiver (IRR). The performance is evaluated in terms of the ergodic outage probability for which we derive accurate analytical expressions for the three systems under consideration. Results reveal that careful selection of the EH time and power splitting factors in the TSR- and PSR-based system are important to optimize performance. It is also presented that the optimized PSR system has near- ideal performance and that increasing the source transmit power and/or the energy harvester efficiency can further improve performance.

  11. Capacity of wireless ad-hoc broadcast networks under realistic channel models

    NARCIS (Netherlands)

    Atici, C.; Sunay, M.O.

    2009-01-01

    In a wireless broadcasting scenario, some of the nodes can help the source node by forwarding the received information. Due to the interference from multiple transmissions, selection of these nodes directly affects the performance of the system under a given total power and hop constraint. In this

  12. Wireless coexistence and interference test method for low-power wireless sensor networks

    NARCIS (Netherlands)

    Serra, R.; Nabi, Majid

    2015-01-01

    Wireless sensor networks (WSNs) are being increasingly introduced for critical applications such as safety, security and health. One the main characteristic requirements of such networks are that they should function with relative low power. Therefore the wireless links are more vulnerable.

  13. Experiment of Wireless Sensor Network to Monitor Field Data

    Directory of Open Access Journals (Sweden)

    Kwang Sik Kim

    2009-08-01

    Full Text Available Recently the mobile wireless network has been drastically enhanced and one of the most efficient ways to realize the ubiquitous network will be to develop the converged network by integrating the mobile wireless network with other IP fixed network like NGN (Next Generation Network. So in this paper the term of the wireless ubiquitous network is used to describe this approach. In this paper, first, the wireless ubiquitous network architecture is described based on IMS which has been standardized by 3GPP (3rd Generation Partnership Program. Next, the field data collection system to match the satellite data using location information is proposed based on the concept of the wireless ubiquitous network architecture. The purpose of the proposed system is to provide more accurate analyzing method with the researchers in the remote sensing area.

  14. A Routing Protocol Based on Received Signal Strength for Underwater Wireless Sensor Networks (UWSNs

    Directory of Open Access Journals (Sweden)

    Meiju Li

    2017-11-01

    Full Text Available Underwater wireless sensor networks (UWSNs are featured by long propagation delay, limited energy, narrow bandwidth, high BER (Bit Error Rate and variable topology structure. These features make it very difficult to design a short delay and high energy-efficiency routing protocol for UWSNs. In this paper, a routing protocol independent of location information is proposed based on received signal strength (RSS, which is called RRSS. In RRSS, a sensor node firstly establishes a vector from the node to a sink node; the length of the vector indicates the RSS of the beacon signal (RSSB from the sink node. A node selects the next-hop along the vector according to RSSB and the RSS of a hello packet (RSSH. The node nearer to the vector has higher priority to be a candidate next-hop. To avoid data packets being delivered to the neighbor nodes in a void area, a void-avoiding algorithm is introduced. In addition, residual energy is considered when selecting the next-hop. Meanwhile, we establish mathematic models to analyze the robustness and energy efficiency of RRSS. Lastly, we conduct extensive simulations, and the simulation results show RRSS can save energy consumption and decrease end-to-end delay.

  15. Adaptive Naive Bayes classification for wireless sensor networks

    NARCIS (Netherlands)

    Zwartjes, G.J.

    2017-01-01

    Wireless Sensor Networks are tiny devices equipped with sensors and wireless communication. These devices observe environments and communicatie about these observations. Machine Learning techniques are of interest for Wireless Sensor Network applications since they can reduce the amount of needed

  16. Secure positioning in wireless networks

    DEFF Research Database (Denmark)

    Capkun, Srdjan; Hubaux, Jean-Pierre

    2006-01-01

    So far, the problem of positioning in wireless networks has been studied mainly in a non-adversarial settings. In this work, we analyze the resistance of positioning techniques to position and distance spoofing attacks. We propose a mechanism for secure positioning of wireless devices, that we call...... Verifiable Multilateration. We then show how this mechanism can be used to secure positioning in sensor networks. We analyze our system through simulations....

  17. Physical parameters collection based on wireless senor network

    Science.gov (United States)

    Chen, Xin; Wu, Hong; Ji, Lei

    2013-12-01

    With the development of sensor technology, wireless senor network has been applied in the medical, military, entertainment field and our daily life. But the existing available wireless senor networks applied in human monitoring system still have some problems, such as big power consumption, low security and so on. To improve senor network applied in health monitoring system, the paper introduces a star wireless senor networks based on msp430 and DSP. We design a low-cost heart-rate monitor senor node. The communication between senor node and sink node is realized according to the newest protocol proposed by the IEEE 802.15.6 Task Group. This wireless senor network will be more energy-efficient and faster compared to traditional senor networks.

  18. Coded Cooperation for Multiway Relaying in Wireless Sensor Networks.

    Science.gov (United States)

    Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar

    2015-06-29

    Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

  19. A hybrid MAC protocol design for energy-efficient very-high-throughput millimeter wave, wireless sensor communication networks

    Science.gov (United States)

    Jian, Wei; Estevez, Claudio; Chowdhury, Arshad; Jia, Zhensheng; Wang, Jianxin; Yu, Jianguo; Chang, Gee-Kung

    2010-12-01

    This paper presents an energy-efficient Medium Access Control (MAC) protocol for very-high-throughput millimeter-wave (mm-wave) wireless sensor communication networks (VHT-MSCNs) based on hybrid multiple access techniques of frequency division multiplexing access (FDMA) and time division multiplexing access (TDMA). An energy-efficient Superframe for wireless sensor communication network employing directional mm-wave wireless access technologies is proposed for systems that require very high throughput, such as high definition video signals, for sensing, processing, transmitting, and actuating functions. Energy consumption modeling for each network element and comparisons among various multi-access technologies in term of power and MAC layer operations are investigated for evaluating the energy-efficient improvement of proposed MAC protocol.

  20. Energy-Efficient Algorithm for Sensor Networks with Non-Uniform Maximum Transmission Range

    Directory of Open Access Journals (Sweden)

    Yimin Yu

    2011-06-01

    Full Text Available In wireless sensor networks (WSNs, the energy hole problem is a key factor affecting the network lifetime. In a circular multi-hop sensor network (modeled as concentric coronas, the optimal transmission ranges of all coronas can effectively improve network lifetime. In this paper, we investigate WSNs with non-uniform maximum transmission ranges, where sensor nodes deployed in different regions may differ in their maximum transmission range. Then, we propose an Energy-efficient algorithm for Non-uniform Maximum Transmission range (ENMT, which can search approximate optimal transmission ranges of all coronas in order to prolong network lifetime. Furthermore, the simulation results indicate that ENMT performs better than other algorithms.

  1. Two-Way Multi-Antenna Relaying with Simultaneous Wireless Information and Power Transfer

    Directory of Open Access Journals (Sweden)

    Thanaphat Srivantana

    2017-03-01

    Full Text Available In this paper, we propose various kinds of two-way multi-antenna relaying with simultaneous wireless information and power transfer (SWIPT and investigate their performance. Specifically, we first consider a two-way relay network where two single-antenna end nodes communicate with each other through a multi-antenna relay node that is energy constrained. This relay node harvests energy from the two end nodes and use the harvested energy for forwarding their information. Six relaying schemes that support the considered network then build on the power splitting-based relaying and time switching-based relaying protocols. The average bit error rates of these schemes are evaluated and compared by computer simulations considering several network parameters, including the number of relay antennas, power splitting ratio, and energy harvesting time. Such evaluation and comparison provide useful insights into the performance of SWIPT-based two-way multi-antenna relaying.

  2. Wireless sensor communications and internet connectivity for sensor networks

    Energy Technology Data Exchange (ETDEWEB)

    Dunbar, M. [Crossbow Technology, Inc., San Jose, CA (United States)

    2001-07-01

    A wireless sensor network architecture is an integrated hardware/software solution that has the potential to change the way sensors are used in a virtually unlimited range of industries and applications. By leveraging Bluetooth wireless technology for low-cost, short-range radio links, wireless sensor networks such as CrossNet{sup TM} enable users to create wireless sensor networks. These wireless networks can link dozens or hundreds of sensors of disparate types and brands with data acquisition/analysis systems, such as handheld devices, internet-enabled laptop or desktop PCs. The overwhelming majority of sensor applications are hard-wired at present, and since wiring is often the most time-consuming, tedious, trouble-prone and expensive aspect of sensor applications, users in many fields will find compelling reasons to adopt the wireless sensor network solution. (orig.)

  3. Green Wireless Power Transfer Networks

    NARCIS (Netherlands)

    Liu, Q.; Golinnski, M.; Pawelczak, P.; Warnier, M.

    2016-01-01

    wireless power transfer network (WPTN) aims to support devices with cable-less energy on-demand. Unfortunately, wireless power transfer itself-especially through radio frequency radiation rectification-is fairly inefficient due to decaying power with distance, antenna polarization, etc.

  4. MB-OFDM-UWB Based Wireless Multimedia Sensor Networks for Underground Coalmine: A Survey

    Science.gov (United States)

    Han, Ruisong; Yang, Wei; You, Kaiming

    2016-01-01

    Safety production of coalmines is a task of top priority which plays an important role in guaranteeing, supporting and promoting the continuous development of the coal industry. Since traditional wireless sensor networks (WSNs) cannot fully meet the requirements of comprehensive environment monitoring of underground coalmines, wireless multimedia sensor networks (WMSNs), enabling the retrieval of multimedia information, are introduced to realize fine-grained and precise environment surveillance. In this paper, a framework for designing underground coalmine WMSNs based on Multi-Band Orthogonal Frequency-Division Multiplexing Ultra-wide Band (MB-OFDM-UWB) is presented. The selection of MB-OFDM-UWB wireless transmission solution is based on the characteristics of underground coalmines. Network structure and design challenges are analyzed first, which is the foundation for further discussion. Then, key supporting technologies and open research areas in different layers are surveyed, and we provide a detailed literature review of the state of the art strategies, algorithms and general solutions in these issues. Finally, other research issues like localization, information processing, and network management are discussed. PMID:27999258

  5. MB-OFDM-UWB Based Wireless Multimedia Sensor Networks for Underground Coalmine: A Survey.

    Science.gov (United States)

    Han, Ruisong; Yang, Wei; You, Kaiming

    2016-12-16

    Safety production of coalmines is a task of top priority which plays an important role in guaranteeing, supporting and promoting the continuous development of the coal industry. Since traditional wireless sensor networks (WSNs) cannot fully meet the requirements of comprehensive environment monitoring of underground coalmines, wireless multimedia sensor networks (WMSNs), enabling the retrieval of multimedia information, are introduced to realize fine-grained and precise environment surveillance. In this paper, a framework for designing underground coalmine WMSNs based on Multi-Band Orthogonal Frequency-Division Multiplexing Ultra-wide Band (MB-OFDM-UWB) is presented. The selection of MB-OFDM-UWB wireless transmission solution is based on the characteristics of underground coalmines. Network structure and design challenges are analyzed first, which is the foundation for further discussion. Then, key supporting technologies and open research areas in different layers are surveyed, and we provide a detailed literature review of the state of the art strategies, algorithms and general solutions in these issues. Finally, other research issues like localization, information processing, and network management are discussed.

  6. Network coding at different layers in wireless networks

    CERN Document Server

    2016-01-01

    This book focuses on how to apply network coding at different layers in wireless networks – including MAC, routing, and TCP – with special focus on cognitive radio networks. It discusses how to select parameters in network coding (e.g., coding field, number of packets involved, and redundant information ration) in order to be suitable for the varying wireless environments. The book explores how to deploy network coding in MAC to improve network performance and examines joint network coding with opportunistic routing to improve the successful rate of routing. In regards to TCP and network coding, the text considers transport layer protocol working with network coding to overcome the transmission error rate, particularly with how to use the ACK feedback of TCP to enhance the efficiency of network coding. The book pertains to researchers and postgraduate students, especially whose interests are in opportunistic routing and TCP in cognitive radio networks.

  7. BackTrack testing wireless network security

    CERN Document Server

    Cardwell, Kevin

    2013-01-01

    Written in an easy-to-follow step-by-step format, you will be able to get started in next to no time with minimal effort and zero fuss.BackTrack: Testing Wireless Network Security is for anyone who has an interest in security and who wants to know more about wireless networks.All you need is some experience with networks and computers and you will be ready to go.

  8. Independent motion control of a tower crane through wireless sensor and actuator networks.

    Science.gov (United States)

    Koumboulis, Fotis N; Kouvakas, Nikolaos D; Giannaris, George L; Vouyioukas, Demosthenes

    2016-01-01

    The problem of independent control of the performance variables of a tower crane through a wireless sensor and actuator network is investigated. The complete nonlinear mathematical model of the tower crane is developed. Based on appropriate data driven norms an accurate linear approximant of the system, including an upper bound of the communication delays, is derived. Using this linear approximant, a dynamic measurable output multi delay controller for independent control of the performance outputs of the system is proposed. The controller performs satisfactory despite the nonlinearities of the model and the communication delays of the wireless network. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

  9. Node localization algorithm of wireless sensor networks for large electrical equipment monitoring application

    DEFF Research Database (Denmark)

    Chen, Qinyin; Hu, Y.; Chen, Zhe

    2016-01-01

    Node localization technology is an important technology for the Wireless Sensor Networks (WSNs) applications. An improved 3D node localization algorithm is proposed in this paper, which is based on a Multi-dimensional Scaling (MDS) node localization algorithm for large electrical equipment monito...

  10. On Applicability of Network Coding Technique for 6LoWPAN-based Sensor Networks.

    Science.gov (United States)

    Amanowicz, Marek; Krygier, Jaroslaw

    2018-05-26

    In this paper, the applicability of the network coding technique in 6LoWPAN-based sensor multihop networks is examined. The 6LoWPAN is one of the standards proposed for the Internet of Things architecture. Thus, we can expect the significant growth of traffic in such networks, which can lead to overload and decrease in the sensor network lifetime. The authors propose the inter-session network coding mechanism that can be implemented in resource-limited sensor motes. The solution reduces the overall traffic in the network, and in consequence, the energy consumption is decreased. Used procedures take into account deep header compressions of the native 6LoWPAN packets and the hop-by-hop changes of the header structure. Applied simplifications reduce signaling traffic that is typically occurring in network coding deployments, keeping the solution usefulness for the wireless sensor networks with limited resources. The authors validate the proposed procedures in terms of end-to-end packet delay, packet loss ratio, traffic in the air, total energy consumption, and network lifetime. The solution has been tested in a real wireless sensor network. The results confirm the efficiency of the proposed technique, mostly in delay-tolerant sensor networks.

  11. Multihopping Multilevel Clustering Heterogeneity-Sensitive Optimized Routing Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Muhammad Aslam

    2017-01-01

    Full Text Available Effective utilization of energy resources in Wireless Sensor Networks (WSNs has become challenging under uncertain distributed cluster-formation and single-hop intercluster communication capabilities. So, sensor nodes are forced to operate at expensive full rate transmission power level continuously during whole network operation. These challenging network environments experience unwanted phenomena of drastic energy consumption and packet drop. In this paper, we propose an adaptive immune Multihopping Multilevel Clustering (MHMLC protocol that executes a Hybrid Clustering Algorithm (HCA to perform optimal centralized selection of Cluster-Heads (CHs within radius of centrally located Base Station (BS and distributed CHs selection in the rest of network area. HCA of MHMLC also produces optimal intermediate CHs for intercluster multihop communications that develop heterogeneity-aware economical links. This hybrid cluster-formation facilitates the sensors to function at short range transmission power level that enhances link quality and avoids packet drop. The simulation environments produce fair comparison among proposed MHMLC and existing state-of-the-art routing protocols. Experimental results give significant evidence of better performance of the proposed model in terms of network lifetime, stability period, and data delivery ratio.

  12. Virtual Lab for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    PICOVICI, D.

    2008-06-01

    Full Text Available This article details an experimental system developed to enhance the education and research in the area of wireless networks technologies. The system referred, as Virtual Lab (VL is primarily targeting first time users or users with limited experience in programming and using wireless sensor networks. The VL enables a set of predefined sensor networks to be remotely accessible and controlled for constructive and time-efficient experimentation. In order to facilitate the user's wireless sensor applications, the VL is using three main components: a a Virtual Lab Motes (VLM, representing the wireless sensor, b a Virtual Lab Client (VLC, representing the user's tool to interact with the VLM and c a Virtual Lab Server (VLS representing the software link between the VLM and VLC. The concept has been proven using the moteiv produced Tmote Sky modules. Initial experimental use clearly demonstrates that the VL approach reduces dramatically the learning curve involved in programming and using the associated wireless sensor nodes. In addition the VL allows the user's focus to be directed towards the experiment and not towards the software programming challenges.

  13. Energy efficiency in future wireless broadband networks

    CSIR Research Space (South Africa)

    Masonta, MT

    2012-10-01

    Full Text Available greener economy and environment. In this research, we investigate the concept of green radio communications in wireless networks and discuss approaches for energy efficient solutions in wireless broadband network deployments. These solutions include...

  14. DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs).

    Science.gov (United States)

    Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer

    2018-05-12

    Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.

  15. Cluster-based Dynamic Energy Management for Collaborative Target Tracking in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Dao-Wei Bi

    2007-07-01

    Full Text Available A primary criterion of wireless sensor network is energy efficiency. Focused onthe energy problem of target tracking in wireless sensor networks, this paper proposes acluster-based dynamic energy management mechanism. Target tracking problem isformulated by the multi-sensor detection model as well as energy consumption model. Adistributed adaptive clustering approach is investigated to form a reasonable routingframework which has uniform cluster head distribution. Dijkstra’s algorithm is utilized toobtain optimal intra-cluster routing. Target position is predicted by particle filter. Thepredicted target position is adopted to estimate the idle interval of sensor nodes. Hence,dynamic awakening approach is exploited to prolong sleep time of sensor nodes so that theoperation energy consumption of wireless sensor network can be reduced. The sensornodes around the target wake up on time and act as sensing candidates. With the candidatesensor nodes and predicted target position, the optimal sensor node selection is considered.Binary particle swarm optimization is proposed to minimize the total energy consumptionduring collaborative sensing and data reporting. Experimental results verify that theproposed clustering approach establishes a low-energy communication structure while theenergy efficiency of wireless sensor networks is enhanced by cluster-based dynamic energymanagement.

  16. Wireless Sensor Network Safety Study

    OpenAIRE

    M.Shankar; Dr.M.Sridar; Dr.M.Rajani

    2012-01-01

    Few security mechanisms in wireless sensor networks (WSNs) have been implemented, and even fewer have been applied in real deployments. The limited resources of each sensor node makes security in WSNs hard, as the tradeoff between security and practicality must be carefully considered. These complex systems include in their design different types of information and communication technology systems, such as wireless (mesh) sensor networks, to carry out control processes in real time. This fact...

  17. Analyzing the factors affecting network lifetime cluster-based wireless sensor network

    International Nuclear Information System (INIS)

    Malik, A.S.; Qureshi, A.

    2010-01-01

    Cluster-based wireless sensor networks enable the efficient utilization of the limited energy resources of the deployed sensor nodes and hence prolong the node as well as network lifetime. Low Energy Adaptive Clustering Hierarchy (Leach) is one of the most promising clustering protocol proposed for wireless sensor networks. This paper provides the energy utilization and lifetime analysis for cluster-based wireless sensor networks based upon LEACH protocol. Simulation results identify some important factors that induce unbalanced energy utilization between the sensor nodes and hence affect the network lifetime in these types of networks. These results highlight the need for a standardized, adaptive and distributed clustering technique that can increase the network lifetime by further balancing the energy utilization among sensor nodes. (author)

  18. Bidirectional QoS support for novelty detection applications based on hierarchical wireless sensor network model

    Science.gov (United States)

    Edwards, Mark; Hu, Fei; Kumar, Sunil

    2004-10-01

    The research on the Novelty Detection System (NDS) (called as VENUS) at the authors' universities has generated exciting results. For example, we can detect an abnormal behavior (such as cars thefts from the parking lot) from a series of video frames based on the cognitively motivated theory of habituation. In this paper, we would like to describe the implementation strategies of lower layer protocols for using large-scale Wireless Sensor Networks (WSN) to NDS with Quality-of-Service (QoS) support. Wireless data collection framework, consisting of small and low-power sensor nodes, provides an alternative mechanism to observe the physical world, by using various types of sensing capabilities that include images (and even videos using Panoptos), sound and basic physical measurements such as temperature. We do not want to lose any 'data query command' packets (in the downstream direction: sink-to-sensors) or have any bit-errors in them since they are so important to the whole sensor network. In the upstream direction (sensors-to-sink), we may tolerate the loss of some sensing data packets. But the 'interested' sensing flow should be assigned a higher priority in terms of multi-hop path choice, network bandwidth allocation, and sensing data packet generation frequency (we hope to generate more sensing data packet for that novel event in the specified network area). The focus of this paper is to investigate MAC-level Quality of Service (QoS) issue in Wireless Sensor Networks (WSN) for Novelty Detection applications. Although QoS has been widely studied in other types of networks including wired Internet, general ad hoc networks and mobile cellular networks, we argue that QoS in WSN has its own characteristics. In wired Internet, the main QoS parameters include delay, jitter and bandwidth. In mobile cellular networks, two most common QoS metrics are: handoff call dropping probability and new call blocking probability. Since the main task of WSN is to detect and report

  19. Weighted-DESYNC and Its Application to End-to-End Throughput Fairness in Wireless Multihop Network

    Directory of Open Access Journals (Sweden)

    Ui-Seong Yu

    2017-01-01

    Full Text Available The end-to-end throughput of a routing path in wireless multihop network is restricted by a bottleneck node that has the smallest bandwidth among the nodes on the routing path. In this study, we propose a method for resolving the bottleneck-node problem in multihop networks, which is based on multihop DESYNC (MH-DESYNC algorithm that is a bioinspired resource allocation method developed for use in multihop environments and enables fair resource allocation among nearby (up to two hops neighbors. Based on MH-DESYNC, we newly propose weighted-DESYNC (W-DESYNC as a tool artificially to control the amount of resource allocated to the specific user and thus to achieve throughput fairness over a routing path. Proposed W-DESYNC employs the weight factor of a link to determine the amount of bandwidth allocated to a node. By letting the weight factor be the link quality of a routing path and making it the same across a routing path via Cucker-Smale flocking model, we can obtain throughput fairness over a routing path. The simulation results show that the proposed algorithm achieves throughput fairness over a routing path and can increase total end-to-end throughput in wireless multihop networks.

  20. Ad hoc mobile wireless networks principles, protocols, and applications

    CERN Document Server

    Sarkar, Subir Kumar

    2013-01-01

    The military, the research community, emergency services, and industrial environments all rely on ad hoc mobile wireless networks because of their simple infrastructure and minimal central administration. Now in its second edition, Ad Hoc Mobile Wireless Networks: Principles, Protocols, and Applications explains the concepts, mechanism, design, and performance of these highly valued systems. Following an overview of wireless network fundamentals, the book explores MAC layer, routing, multicast, and transport layer protocols for ad hoc mobile wireless networks. Next, it examines quality of serv

  1. Impact of Radio Link Unreliability on the Connectivity of Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Gorce Jean-Marie

    2007-01-01

    Full Text Available Many works have been devoted to connectivity of ad hoc networks. This is an important feature for wireless sensor networks (WSNs to provide the nodes with the capability of communicating with one or several sinks. In most of these works, radio links are assumed ideal, that is, with no transmission errors. To fulfil this assumption, the reception threshold should be high enough to guarantee that radio links have a low transmission error probability. As a consequence, all unreliable links are dismissed. This approach is suboptimal concerning energy consumption because unreliable links should permit to reduce either the transmission power or the number of active nodes. The aim of this paper is to quantify the contribution of unreliable long hops to an increase of the connectivity of WSNs. In our model, each node is assumed to be connected to each other node in a probabilistic manner. Such a network is modeled as a complete random graph, that is, all edges exist. The instantaneous node degree is then defined as the number of simultaneous valid single-hop receptions of the same message, and finally the mean node degree is computed analytically in both AWGN and block-fading channels. We show the impact on connectivity of two MACs and routing parameters. The first one is the energy detection level such as the one used in carrier sense mechanisms. The second one is the reliability threshold used by the routing layer to select stable links only. Both analytic and simulation results show that using opportunistic protocols is challenging.

  2. Impact of Radio Link Unreliability on the Connectivity of Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jean-Marie Gorce

    2007-06-01

    Full Text Available Many works have been devoted to connectivity of ad hoc networks. This is an important feature for wireless sensor networks (WSNs to provide the nodes with the capability of communicating with one or several sinks. In most of these works, radio links are assumed ideal, that is, with no transmission errors. To fulfil this assumption, the reception threshold should be high enough to guarantee that radio links have a low transmission error probability. As a consequence, all unreliable links are dismissed. This approach is suboptimal concerning energy consumption because unreliable links should permit to reduce either the transmission power or the number of active nodes. The aim of this paper is to quantify the contribution of unreliable long hops to an increase of the connectivity of WSNs. In our model, each node is assumed to be connected to each other node in a probabilistic manner. Such a network is modeled as a complete random graph, that is, all edges exist. The instantaneous node degree is then defined as the number of simultaneous valid single-hop receptions of the same message, and finally the mean node degree is computed analytically in both AWGN and block-fading channels. We show the impact on connectivity of two MACs and routing parameters. The first one is the energy detection level such as the one used in carrier sense mechanisms. The second one is the reliability threshold used by the routing layer to select stable links only. Both analytic and simulation results show that using opportunistic protocols is challenging.

  3. Data dissemination of emergency messages in mobile multi-sink wireless sensor networks

    NARCIS (Netherlands)

    Erman-Tüysüz, A.; Havinga, Paul J.M.

    In wireless sensor networks (WSNs), data dissemination is generally performed from sensor nodes to a static sink. If the data under consideration is an emergency message such as a fire alarm, it must be transmitted as fast and reliably as possible towards the sink of WSN. In such mission critical

  4. Experiences with a Decade of Wireless Sensor Networks in Mountain Cryosphere Research

    Science.gov (United States)

    Beutel, Jan

    2017-04-01

    Research in geoscience depends on high-quality measurements over long periods of time in order to understand processes and to create and validate models. The promise of wireless sensor networks to monitor autonomously at unprecedented spatial and temporal scale motivated the use of this novel technology for studying mountain permafrost in the mid 2000s. Starting from a first experimental deployment to investigate the thermal properties of steep bedrock permafrost in 2006 on the Jungfraujoch, Switzerland at 3500 m asl using prototype wireless sensors the PermaSense project has evolved into a multi-site and multi-discipline initiative. We develop, deploy and operate wireless sensing systems customized for long-term autonomous operation in high-mountain environments. Around this central element, we develop concepts, methods and tools to investigate and to quantify the connection between climate, cryosphere (permafrost, glaciers, snow) and geomorphodynamics. In this presentation, we describe the concepts and system architecture used both for the wireless sensor network as well as for data management and processing. Furthermore, we will discuss the experience gained in over a decade of planning, installing and operating large deployments on field sites spread across a large part of the Swiss and French Alps and applications ranging from academic, experimental research campaigns, long-term monitoring and natural hazard warning in collaboration with government authorities and local industry partners. Reference http://www.permasense.ch Online Open Data Access http://data.permasense.ch

  5. Radio resource management scheme and outage analysis for network-assisted multi-hop D2D communications

    OpenAIRE

    Leila Melki; Sameh Najeh; Hichem Besbes

    2016-01-01

    In a cellular network it's very difficult to make spectrum resource more efficiently. Device-to-Device (D2D) technology enables new service opportunities, and provides high throughput and reliable communication while reducing the base station load. For better total performance, short-range D2D links and cellular links share the same radio resource and the management of interference becomes a crucial task. Here we argue that single-hop D2D technology can be used to further improve cellular net...

  6. Topological properties of random wireless networks

    Indian Academy of Sciences (India)

    Wireless networks in which the node locations are random are best modelled as random geometric graphs (RGGs). In addition to their extensive application in the modelling of wireless networks, RGGs find many new applications and are being studied in their own right. In this paper we first provide a brief introduction to the ...

  7. 47 CFR 27.1305 - Shared wireless broadband network.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 2 2010-10-01 2010-10-01 false Shared wireless broadband network. 27.1305... broadband network. The Shared Wireless Broadband Network developed by the 700 MHz Public/Private Partnership must be designed to meet requirements associated with a nationwide, public safety broadband network. At...

  8. 47 CFR 90.1405 - Shared wireless broadband network.

    Science.gov (United States)

    2010-10-01

    ... 47 Telecommunication 5 2010-10-01 2010-10-01 false Shared wireless broadband network. 90.1405... broadband network. The Shared Wireless Broadband Network developed by the 700 MHz Public/Private Partnership must be designed to meet requirements associated with a nationwide, public safety broadband network. At...

  9. Wireless Sensor Network for Forest Fire Detection 2

    OpenAIRE

    João Gilberto Fernandes Gonçalves Teixeira

    2017-01-01

    The main purpose for this project is the development of a semi-autonomous wireless sensor network for fire detection in remote territory. Making use of the IEEE 802.15.4 standard, a wireless standard for low-power, low-rate wireless sensor networks, a real sensor network and web application will be developed and deployed with the ability to monitor sensor data, detect a fire occurrence and generate early fire alerts.

  10. LTE-A cellular networks multi-hop relay for coverage, capacity and performance enhancement

    CERN Document Server

    Yahya, Abid

    2017-01-01

    In this book, three different methods are presented to enhance the capacity and coverage area in LTE-A cellular networks. The scope involves the evaluation of the effect of the RN location in terms of capacity and the determination of the optimum location of the relay that provides maximum achievable data rate for users with limited interference at the cell boundaries. This book presents a new model to enhance both capacity and coverage area in LTE-A cellular network by determining the optimum location for the RN with limited interference. The new model is designed to enhance the capacity of the relay link by employing two antennas in RN. This design enables the relay link to absorb more users at cell edge regions. An algorithm called the Balance Power Algorithm (BPA) is developed to reduce MR power consumption. The book pertains to postgraduate students and researchers in wireless & mobile communications. Provides a variety of methods for enhancing capacity and coverage in LTE-A cellular networks Develop...

  11. Interface Assignment-Based AODV Routing Protocol to Improve Reliability in Multi-Interface Multichannel Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Won-Suk Kim

    2015-01-01

    Full Text Available The utilization of wireless mesh networks (WMNs has greatly increased, and the multi-interface multichannel (MIMC technic has been widely used for the backbone network. Unfortunately, the ad hoc on-demand distance vector (AODV routing protocol defined in the IEEE 802.11s standard was designed for WMNs using the single-interface single-channel technic. So, we define a problem that happens when the legacy AODV is used in MIMC WMNs and propose an interface assignment-based AODV (IA-AODV in order to resolve that problem. IA-AODV, which is based on multitarget path request, consists of the PREQ prediction scheme, the PREQ loss recovery scheme, and the PREQ sender assignment scheme. A detailed operation according to various network conditions and services is introduced, and the routing efficiency and network reliability of a network using IA-AODV are analyzed over the presented system model. Finally, after a real-world test-bed for MIMC WMNs using the IA-AODV routing protocol is implemented, the various indicators of the network are evaluated through experiments. When the proposed routing protocol is compared with the existing AODV routing protocol, it performs the path update using only 14.33% of the management frames, completely removes the routing malfunction, and reduces the UDP packet loss ratio by 0.0012%.

  12. A Cluster-Based Dual-Adaptive Topology Control Approach in Wireless Sensor Networks

    Science.gov (United States)

    Gui, Jinsong; Zhou, Kai; Xiong, Naixue

    2016-01-01

    Multi-Input Multi-Output (MIMO) can improve wireless network performance. Sensors are usually single-antenna devices due to the high hardware complexity and cost, so several sensors are used to form virtual MIMO array, which is a desirable approach to efficiently take advantage of MIMO gains. Also, in large Wireless Sensor Networks (WSNs), clustering can improve the network scalability, which is an effective topology control approach. The existing virtual MIMO-based clustering schemes do not either fully explore the benefits of MIMO or adaptively determine the clustering ranges. Also, clustering mechanism needs to be further improved to enhance the cluster structure life. In this paper, we propose an improved clustering scheme for virtual MIMO-based topology construction (ICV-MIMO), which can determine adaptively not only the inter-cluster transmission modes but also the clustering ranges. Through the rational division of cluster head function and the optimization of cluster head selection criteria and information exchange process, the ICV-MIMO scheme effectively reduces the network energy consumption and improves the lifetime of the cluster structure when compared with the existing typical virtual MIMO-based scheme. Moreover, the message overhead and time complexity are still in the same order of magnitude. PMID:27681731

  13. A Cluster-Based Dual-Adaptive Topology Control Approach in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jinsong Gui

    2016-09-01

    Full Text Available Multi-Input Multi-Output (MIMO can improve wireless network performance. Sensors are usually single-antenna devices due to the high hardware complexity and cost, so several sensors are used to form virtual MIMO array, which is a desirable approach to efficiently take advantage of MIMO gains. Also, in large Wireless Sensor Networks (WSNs, clustering can improve the network scalability, which is an effective topology control approach. The existing virtual MIMO-based clustering schemes do not either fully explore the benefits of MIMO or adaptively determine the clustering ranges. Also, clustering mechanism needs to be further improved to enhance the cluster structure life. In this paper, we propose an improved clustering scheme for virtual MIMO-based topology construction (ICV-MIMO, which can determine adaptively not only the inter-cluster transmission modes but also the clustering ranges. Through the rational division of cluster head function and the optimization of cluster head selection criteria and information exchange process, the ICV-MIMO scheme effectively reduces the network energy consumption and improves the lifetime of the cluster structure when compared with the existing typical virtual MIMO-based scheme. Moreover, the message overhead and time complexity are still in the same order of magnitude.

  14. Multi-purpose passive debugging for embedded wireless

    DEFF Research Database (Denmark)

    Hansen, Morten Tranberg

    Debugging embedded wireless systems can be cumbersome and hard due to low visibility. To ease the task of debugging we propose a multi-purpose passive debugging framework, called TinyDebug, for developing embedded wireless systems. TinyDebug is designed to be used throughout the entire system...

  15. Availability Issues in Wireless Visual Sensor Networks

    Science.gov (United States)

    Costa, Daniel G.; Silva, Ivanovitch; Guedes, Luiz Affonso; Vasques, Francisco; Portugal, Paulo

    2014-01-01

    Wireless visual sensor networks have been considered for a large set of monitoring applications related with surveillance, tracking and multipurpose visual monitoring. When sensors are deployed over a monitored field, permanent faults may happen during the network lifetime, reducing the monitoring quality or rendering parts or the entire network unavailable. In a different way from scalar sensor networks, camera-enabled sensors collect information following a directional sensing model, which changes the notions of vicinity and redundancy. Moreover, visual source nodes may have different relevancies for the applications, according to the monitoring requirements and cameras' poses. In this paper we discuss the most relevant availability issues related to wireless visual sensor networks, addressing availability evaluation and enhancement. Such discussions are valuable when designing, deploying and managing wireless visual sensor networks, bringing significant contributions to these networks. PMID:24526301

  16. Scheduled Collision Avoidance in wireless sensor network using Zigbee

    DEFF Research Database (Denmark)

    Dnyaneshwar, Mantri; Prasad, Neeli R.; Prasad, Ramjee

    2014-01-01

    Transmission reliability and energy consumptions are two critical concerns associated with wireless sensor network (WSN) design for a long time and continuous operation. With the increase in reliability of the transmission, the energy consumption increases by affecting the efficiency of the network....... This paper proposes the Schedule based Collision Avoidance (SCA) algorithm for finding the tradeoff between reliability and energy efficiency by fusion of CSMA/CA and TDMA techniques in Zigbee/ IEEE802.15.4. It uses the multi-path data propagation for collision avoidance and effective utilization...... of the channel providing efficient energy consumption. It analyses different scheduling schemes to provide an appropriate solution for reducing collisions and improving network lifetime....

  17. Performance analysis of data delivery schemes for a multi-sink wireless sensor network

    NARCIS (Netherlands)

    Tan, H.P.; Gabor, A.F.; Seah, W.K.G.; Lee, P.W.Q.

    2008-01-01

    Wireless sensor networks are expected to be deployed in harsh environments characterised by extremely poor and fluctuating channel conditions. With the commonly adopted single-sink architecture, such conditions are exemplified by contention near the sink as a result of multipath delivery. This may

  18. Wireless Sensor Network Metrics for Real-Time Systems

    Science.gov (United States)

    2009-05-20

    Wireless Sensor Network Metrics for Real-Time Systems Phoebus Wei-Chih Chen Electrical Engineering and Computer Sciences University of California at...3. DATES COVERED 00-00-2009 to 00-00-2009 4. TITLE AND SUBTITLE Wireless Sensor Network Metrics for Real-Time Systems 5a. CONTRACT NUMBER 5b... wireless sensor networks (WSNs) is moving from studies of WSNs in isolation toward studies where the WSN is treated as a component of a larger system

  19. Wireless sensor network adaptive cooling

    Energy Technology Data Exchange (ETDEWEB)

    Mitchell, T. [SynapSense Corp., Folsom, CA (United States)

    2009-07-01

    Options for reducing data centre cooling energy requirements and their cost savings were discussed with particular reference to a wireless control solution developed by SynapSense Corporation. The wireless sensor network reduces cooling energy use at data centres by providing improved air flow management through the installation of cold aisle containment. The use of this low cost, non-invasive wireless sensor network has reduced the cooling energy use in a data center at BC Hydro by 30 per cent. The system also reduced the server and storage fan energy by 3 per cent by maintaining inlet air temperature below ASHRAE recommended operating range. The distribution of low power, low cost wireless sensors has enabled visualization tools that are changing the way that data centres are managed. The annual savings have been estimated at 4,560,000 kWh and the annual carbon dioxide abatement is approximately 1,400 metric tons. tabs., figs.

  20. Open-WiSe: A Solar Powered Wireless Sensor Network Platform

    Science.gov (United States)

    González, Apolinar; Aquino, Raúl; Mata, Walter; Ochoa, Alberto; Saldaña, Pedro; Edwards, Arthur

    2012-01-01

    Because battery-powered nodes are required in wireless sensor networks and energy consumption represents an important design consideration, alternate energy sources are needed to provide more effective and optimal function. The main goal of this work is to present an energy harvesting wireless sensor network platform, the Open Wireless Sensor node (WiSe). The design and implementation of the solar powered wireless platform is described including the hardware architecture, firmware, and a POSIX Real-Time Kernel. A sleep and wake up strategy was implemented to prolong the lifetime of the wireless sensor network. This platform was developed as a tool for researchers investigating Wireless sensor network or system integrators. PMID:22969396

  1. Open-WiSe: a solar powered wireless sensor network platform.

    Science.gov (United States)

    González, Apolinar; Aquino, Raúl; Mata, Walter; Ochoa, Alberto; Saldaña, Pedro; Edwards, Arthur

    2012-01-01

    Because battery-powered nodes are required in wireless sensor networks and energy consumption represents an important design consideration, alternate energy sources are needed to provide more effective and optimal function. The main goal of this work is to present an energy harvesting wireless sensor network platform, the Open Wireless Sensor node (WiSe). The design and implementation of the solar powered wireless platform is described including the hardware architecture, firmware, and a POSIX Real-Time Kernel. A sleep and wake up strategy was implemented to prolong the lifetime of the wireless sensor network. This platform was developed as a tool for researchers investigating Wireless sensor network or system integrators.

  2. Wireless sensor network topology control

    OpenAIRE

    Zuk, Olexandr; Romanjuk, Valeriy; Sova, Oleg

    2010-01-01

    Topology control process for the wireless sensor network is considered. In this article the use of rule base for making decision on the search of optimum network topology is offered for the realization of different aims of network management.

  3. Location based Network Optimizations for Mobile Wireless Networks

    DEFF Research Database (Denmark)

    Nielsen, Jimmy Jessen

    selection in Wi-Fi networks and predictive handover optimization in heterogeneous wireless networks. The investigations in this work have indicated that location based network optimizations are beneficial compared to typical link measurement based approaches. Especially the knowledge of geographical...

  4. Performance Evaluation of Relay Selection Schemes in Beacon-Assisted Dual-Hop Cognitive Radio Wireless Sensor Networks under Impact of Hardware Noises.

    Science.gov (United States)

    Hieu, Tran Dinh; Duy, Tran Trung; Dung, Le The; Choi, Seong Gon

    2018-06-05

    To solve the problem of energy constraints and spectrum scarcity for cognitive radio wireless sensor networks (CR-WSNs), an underlay decode-and-forward relaying scheme is considered, where the energy constrained secondary source and relay nodes are capable of harvesting energy from a multi-antenna power beacon (PB) and using that harvested energy to forward the source information to the destination. Based on the time switching receiver architecture, three relaying protocols, namely, hybrid partial relay selection (H-PRS), conventional opportunistic relay selection (C-ORS), and best opportunistic relay selection (B-ORS) protocols are considered to enhance the end-to-end performance under the joint impact of maximal interference constraint and transceiver hardware impairments. For performance evaluation and comparison, we derive the exact and asymptotic closed-form expressions of outage probability (OP) and throughput (TP) to provide significant insights into the impact of our proposed protocols on the system performance over Rayleigh fading channel. Finally, simulation results validate the theoretical results.

  5. Autonomous management of a recursive area hierarchy for large scale wireless sensor networks using multiple parents

    Energy Technology Data Exchange (ETDEWEB)

    Cree, Johnathan Vee [Washington State Univ., Pullman, WA (United States); Delgado-Frias, Jose [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)

    2016-03-01

    Large scale wireless sensor networks have been proposed for applications ranging from anomaly detection in an environment to vehicle tracking. Many of these applications require the networks to be distributed across a large geographic area while supporting three to five year network lifetimes. In order to support these requirements large scale wireless sensor networks of duty-cycled devices need a method of efficient and effective autonomous configuration/maintenance. This method should gracefully handle the synchronization tasks duty-cycled networks. Further, an effective configuration solution needs to recognize that in-network data aggregation and analysis presents significant benefits to wireless sensor network and should configure the network in a way such that said higher level functions benefit from the logically imposed structure. NOA, the proposed configuration and maintenance protocol, provides a multi-parent hierarchical logical structure for the network that reduces the synchronization workload. It also provides higher level functions with significant inherent benefits such as but not limited to: removing network divisions that are created by single-parent hierarchies, guarantees for when data will be compared in the hierarchy, and redundancies for communication as well as in-network data aggregation/analysis/storage.

  6. Motion-related resource allocation in dynamic wireless visual sensor network environments.

    Science.gov (United States)

    Katsenou, Angeliki V; Kondi, Lisimachos P; Parsopoulos, Konstantinos E

    2014-01-01

    This paper investigates quality-driven cross-layer optimization for resource allocation in direct sequence code division multiple access wireless visual sensor networks. We consider a single-hop network topology, where each sensor transmits directly to a centralized control unit (CCU) that manages the available network resources. Our aim is to enable the CCU to jointly allocate the transmission power and source-channel coding rates for each node, under four different quality-driven criteria that take into consideration the varying motion characteristics of each recorded video. For this purpose, we studied two approaches with a different tradeoff of quality and complexity. The first one allocates the resources individually for each sensor, whereas the second clusters them according to the recorded level of motion. In order to address the dynamic nature of the recorded scenery and re-allocate the resources whenever it is dictated by the changes in the amount of motion in the scenery, we propose a mechanism based on the particle swarm optimization algorithm, combined with two restarting schemes that either exploit the previously determined resource allocation or conduct a rough estimation of it. Experimental simulations demonstrate the efficiency of the proposed approaches.

  7. A Survey on Sensor Coverage and Visual Data Capturing/Processing/Transmission in Wireless Visual Sensor Networks

    Directory of Open Access Journals (Sweden)

    Florence G. H. Yap

    2014-02-01

    Full Text Available Wireless Visual Sensor Networks (WVSNs where camera-equipped sensor nodes can capture, process and transmit image/video information have become an important new research area. As compared to the traditional wireless sensor networks (WSNs that can only transmit scalar information (e.g., temperature, the visual data in WVSNs enable much wider applications, such as visual security surveillance and visual wildlife monitoring. However, as compared to the scalar data in WSNs, visual data is much bigger and more complicated so intelligent schemes are required to capture/process/ transmit visual data in limited resources (hardware capability and bandwidth WVSNs. WVSNs introduce new multi-disciplinary research opportunities of topics that include visual sensor hardware, image and multimedia capture and processing, wireless communication and networking. In this paper, we survey existing research efforts on the visual sensor hardware, visual sensor coverage/deployment, and visual data capture/ processing/transmission issues in WVSNs. We conclude that WVSN research is still in an early age and there are still many open issues that have not been fully addressed. More new novel multi-disciplinary, cross-layered, distributed and collaborative solutions should be devised to tackle these challenging issues in WVSNs.

  8. An Enhanced Backbone-Assisted Reliable Framework for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Amna Ali

    2010-03-01

    Full Text Available An extremely reliable source to sink communication is required for most of the contemporary WSN applications especially pertaining to military, healthcare and disaster-recovery. However, due to their intrinsic energy, bandwidth and computational constraints, Wireless Sensor Networks (WSNs encounter several challenges in reliable source to sink communication. In this paper, we present a novel reliable topology that uses reliable hotlines between sensor gateways to boost the reliability of end-to-end transmissions. This reliable and efficient routing alternative reduces the number of average hops from source to the sink. We prove, with the help of analytical evaluation, that communication using hotlines is considerably more reliable than traditional WSN routing. We use reliability theory to analyze the cost and benefit of adding gateway nodes to a backbone-assisted WSN. However, in hotline assisted routing some scenarios where source and the sink are just a couple of hops away might bring more latency, therefore, we present a Signature Based Routing (SBR scheme. SBR enables the gateways to make intelligent routing decisions, based upon the derived signature, hence providing lesser end-to-end delay between source to the sink communication. Finally, we evaluate our proposed hotline based topology with the help of a simulation tool and show that the proposed topology provides manifold increase in end-to-end reliability.

  9. Connectivity analysis of one-dimensional ad-hoc networks

    DEFF Research Database (Denmark)

    Hansen, Martin Bøgsted; Rasmussen, Jakob Gulddahl; Schwefel, Hans-Peter

    hop-count; (3) the connectivity distance, expressing the geographic distance that a message can be propagated in the network on multi-hop paths; (4) the connectivity hops, which corresponds to the number of hops that are necessary to reach all nodes in the connected network. The paper develops...

  10. Industrial wireless sensor networks applications, protocols, and standards

    CERN Document Server

    Güngör, V Çagri

    2013-01-01

    The collaborative nature of industrial wireless sensor networks (IWSNs) brings several advantages over traditional wired industrial monitoring and control systems, including self-organization, rapid deployment, flexibility, and inherent intelligent processing. In this regard, IWSNs play a vital role in creating more reliable, efficient, and productive industrial systems, thus improving companies' competitiveness in the marketplace. Industrial Wireless Sensor Networks: Applications, Protocols, and Standards examines the current state of the art in industrial wireless sensor networks and outline

  11. Wireless networking and its application in nuclear safeguards.

    Energy Technology Data Exchange (ETDEWEB)

    Goncalves, Joao G. M. (Joint Research Centre, Italy); Smartt, Heidi Anne; Conti, Michele (Joint Research Centre, Italy); Caskey, Susan Adele; Rossini, Angelo (Joint Research Centre, Italy); Glidewell, Donnie Dwight

    2004-07-01

    Wireless networking can provide a cost effective and convenient method for installing and operating an unattended or remote monitoring system in an established facility. There is concern, however, that wireless devices can interfere with each other and with other radio systems within the facility. Additionally, there is concern that these devices add a potential risk to the security of the network. Since all data is transmitted in the air, it is possible for an unauthorized user to intercept the data transmissions and/or insert data onto the network if proper security is not in place. This paper describes a study being undertaken to highlight the benefits of wireless networking, evaluate interference and methods for mitigation, recommend security architectures, and present the results of a wireless network demonstration between Sandia National Laboratories (SNL) and the Joint Research Centre (JRC).

  12. Node counting in wireless ad-hoc networks

    NARCIS (Netherlands)

    Evers, J.H.M.; Kiss, D.; Kowalczyk, W.; Navilarekallu, T.; Renger, D.R.M.; Sella, L.; Timperio, V.; Viorel, A.; Wijk, van A.C.C.; Yzelman, A.J.; Planqué, B.; Bhulai, S.; Hulshof, J.; Kager, W.; Rot, T.

    2012-01-01

    We study wireless ad-hoc networks consisting of small microprocessors with limited memory, where the wireless communication between the processors can be highly unreliable. For this setting, we propose a number of algorithms to estimate the number of nodes in the network, and the number of direct

  13. Self-Learning Power Control in Wireless Sensor Networks.

    Science.gov (United States)

    Chincoli, Michele; Liotta, Antonio

    2018-01-27

    Current trends in interconnecting myriad smart objects to monetize on Internet of Things applications have led to high-density communications in wireless sensor networks. This aggravates the already over-congested unlicensed radio bands, calling for new mechanisms to improve spectrum management and energy efficiency, such as transmission power control. Existing protocols are based on simplistic heuristics that often approach interference problems (i.e., packet loss, delay and energy waste) by increasing power, leading to detrimental results. The scope of this work is to investigate how machine learning may be used to bring wireless nodes to the lowest possible transmission power level and, in turn, to respect the quality requirements of the overall network. Lowering transmission power has benefits in terms of both energy consumption and interference. We propose a protocol of transmission power control through a reinforcement learning process that we have set in a multi-agent system. The agents are independent learners using the same exploration strategy and reward structure, leading to an overall cooperative network. The simulation results show that the system converges to an equilibrium where each node transmits at the minimum power while respecting high packet reception ratio constraints. Consequently, the system benefits from low energy consumption and packet delay.

  14. Handoff Between a Wireless Local Area Network (WLAN and a Wide Area Network (UMTS

    Directory of Open Access Journals (Sweden)

    J. Sánchez–García

    2009-04-01

    Full Text Available With the appearance of wireless data networks with variable coverage, band width and handoff strategies, in addition to the growing need of mobile nodes to freely roam among these networks, the support of an interoperable handoff strategy for hybrid wireless data networks is a requirement that needs to be addressed. The current trend in wireless data networks is to offer multimedia access to mobile users by employing the wireless local area network (WLAN standard IEEE802.11 while the user is located indoors; on the other hand, 3rd generation wireless networks (WAN are being deployed to provide coverage while the user is located outdoors. As a result, the mobile node will require a handoff mechanism to allow the user to roam between WLAN and WAN environments; up to this date several strategies have been proposed (Sattari et al., 2004 and HyoJin, 2007 in the literature, however, none of these have been standardized to date. To support this interoperability, the mobile node must be equipped with configurable wireless inetrfaces to support the handoff between the WLAN and the WAN networks. In this work a new algorithm is proposed to allow a mobile node to roam between a wireless local area network (IEEE802.11 and a WAN base station (UMTS, while employing IP mobility support. The algorithm is implemented in simulation, using the Network Simulator 2.

  15. Reactor building indoor wireless network channel quality estimation using RSSI measurement of wireless sensor network

    International Nuclear Information System (INIS)

    Merat, S.

    2008-01-01

    Expanding wireless communication network reception inside reactor buildings (RB) and service wings (SW) has always been a technical challenge for operations service team. This is driven by the volume of metal equipment inside the Reactor Buildings (RB) that blocks and somehow shields the signal throughout the link. In this study, to improve wireless reception inside the Reactor Building (RB), an experimental model using indoor localization mesh based on IEEE 802.15 is developed to implement a wireless sensor network. This experimental model estimates the distance between different nodes by measuring the RSSI (Received Signal Strength Indicator). Then by using triangulation and RSSI measurement, the validity of the estimation techniques is verified to simulate the physical environmental obstacles, which block the signal transmission. (author)

  16. Reactor building indoor wireless network channel quality estimation using RSSI measurement of wireless sensor network

    Energy Technology Data Exchange (ETDEWEB)

    Merat, S. [Wardrop Engineering Inc., Toronto, Ontario (Canada)

    2008-07-01

    Expanding wireless communication network reception inside reactor buildings (RB) and service wings (SW) has always been a technical challenge for operations service team. This is driven by the volume of metal equipment inside the Reactor Buildings (RB) that blocks and somehow shields the signal throughout the link. In this study, to improve wireless reception inside the Reactor Building (RB), an experimental model using indoor localization mesh based on IEEE 802.15 is developed to implement a wireless sensor network. This experimental model estimates the distance between different nodes by measuring the RSSI (Received Signal Strength Indicator). Then by using triangulation and RSSI measurement, the validity of the estimation techniques is verified to simulate the physical environmental obstacles, which block the signal transmission. (author)

  17. Topology Optimisation of Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Thike Aye Min

    2016-01-01

    Full Text Available Wireless sensor networks are widely used in a variety of fields including industrial environments. In case of a clustered network the location of cluster head affects the reliability of the network operation. Finding of the optimum location of the cluster head, therefore, is critical for the design of a network. This paper discusses the optimisation approach, based on the brute force algorithm, in the context of topology optimisation of a cluster structure centralised wireless sensor network. Two examples are given to verify the approach that demonstrate the implementation of the brute force algorithm to find an optimum location of the cluster head.

  18. Wireless local area network for the dental office.

    Science.gov (United States)

    Mupparapu, Muralidhar

    2004-01-01

    Dental offices are no exception to the implementation of new and advanced technology, especially if it enhances productivity. In a rapidly transforming digital world, wireless technology has a special place, as it has truly "retired the wire" and contributed to the ease and efficient access to patient data and other software-based applications for diagnosis and treatment. If the office or the clinic is networked, access to patient management software, imaging software and treatment planning tools is enhanced. Access will be further enhanced and unrestricted if the entire network is wireless. As with any new, emerging technology, there will be issues that should be kept in mind before adapting to the wireless environment. Foremost is the network security involved in the installation and use of these wireless networks. This short, technical manuscript deals with standards and choices in wireless technology currently available for implementation within a dental office. The benefits of each network security protocol available to protect patient data and boost the efficiency of a modern dental office are discussed.

  19. Wireless sensor network for sodium leak detection

    International Nuclear Information System (INIS)

    Satya Murty, S.A.V.; Raj, Baldev; Sivalingam, Krishna M.; Ebenezer, Jemimah; Chandran, T.; Shanmugavel, M.; Rajan, K.K.

    2012-01-01

    Highlights: ► Early detection of sodium leak is mandatory in any reactor handling liquid sodium. ► Wireless sensor networking technology has been introduced for detecting sodium leak. ► We designed and developed a wireless sensor node in-house. ► We deployed a pilot wireless sensor network for handling nine sodium leak signals. - Abstract: To study the mechanical properties of Prototype Fast Breeder Reactor component materials under the influence of sodium, the IN Sodium Test (INSOT) facility has been erected and commissioned at Indira Gandhi Centre for Atomic Research. Sodium reacts violently with air/moisture leading to fire. Hence early detection of sodium leak if any is mandatory for such plants and almost 140 sodium leak detectors are placed throughout the loop. All these detectors are wired to the control room for data collection and monitoring. To reduce the cost, space and maintenance that are involved in cabling, the wireless sensor networking technology has been introduced in the sodium leak detection system of INSOT. This paper describes about the deployment details of the pilot wireless sensor network and the measures taken for the successful deployment.

  20. Ad hoc mobile wireless networks principles, protocols and applications

    CERN Document Server

    Sarkar, Subir Kumar; Puttamadappa, C

    2007-01-01

    Ad hoc mobile wireless networks have seen increased adaptation in a variety of disciplines because they can be deployed with simple infrastructures and virtually no central administration. In particular, the development of ad hoc wireless and sensor networks provides tremendous opportunities in areas including disaster recovery, defense, health care, and industrial environments. Ad Hoc Mobile Wireless Networks: Principles, Protocols and Applications explains the concepts, mechanisms, design, and performance of these systems. It presents in-depth explanations of the latest wireless technologies

  1. An analytical model for the performance of geographical multi-hop broadcast

    NARCIS (Netherlands)

    Klein Wolterink, W.; Heijenk, G.; Berg, J.L. van den

    2012-01-01

    In this paper we present an analytical model accurately describing the behaviour of a multi-hop broadcast protocol. Our model covers the scenario in which a message is forwarded over a straight road and inter-node distances are distributed exponentially. Intermediate forwarders draw a small random

  2. An Intuitive Dominant Test Algorithm of CP-nets Applied on Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Liu Zhaowei

    2014-07-01

    Full Text Available A wireless sensor network is of spatially distributed with autonomous sensors, just like a multi-Agent system with single Agent. Conditional Preference networks is a qualitative tool for representing ceteris paribus (all other things being equal preference statements, it has been a research hotspot in artificial intelligence recently. But the algorithm and complexity of strong dominant test with respect to binary-valued structure CP-nets have not been solved, and few researchers address the application to other domain. In this paper, strong dominant test and application of CP-nets are studied in detail. Firstly, by constructing induced graph of CP-nets and studying its properties, we make a conclusion that the problem of strong dominant test on binary-valued CP-nets is single source shortest path problem essentially, so strong dominant test problem can be solved by improved Dijkstra’s algorithm. Secondly, we apply the algorithm above mentioned to the completeness of wireless sensor network, and design a completeness judging algorithm based on strong dominant test. Thirdly, we apply the algorithm on wireless sensor network to solve routing problem. In the end, we point out some interesting work in the future.

  3. Coded Cooperation for Multiway Relaying in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zhongwei Si

    2015-06-01

    Full Text Available Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.

  4. Miniaturized wireless sensor network

    OpenAIRE

    Lecointre , Aubin; Dragomirescu , Daniela; Dubuc , David; Grenier , Katia; Pons , Patrick; Aubert , Hervé; Müller , A.; Berthou , Pascal; Gayraud , Thierry; Plana , Robert

    2006-01-01

    This paper addresses an overview of the wireless sensor networks. It is shown that MEMS/NEMS technologies and SIP concept are well suited for advanced architectures. It is also shown analog architectures have to be compatible with digital signal techniques to develop smart network of microsystem.

  5. Adaptive Home System Using Wireless Sensor Network And Multi Agent System

    OpenAIRE

    Jayarani Kamble; Prof.Nandini Dhole

    2014-01-01

    Smart Home is an emerging technology growing continuously which includes number of new technologies which helps to improve human’s quality of living. This paper proposes an adaptive home system for optimum utilization of power, through Artificial Intelligence and Wireless Sensor network. Artificial Intelligence is a technology for developing adaptive system that can perceive the enviornmrnt, learn from the environment and can make decision using Rule based system.Zigbee is a w...

  6. Open-WiSe: A Solar Powered Wireless Sensor Network Platform

    Directory of Open Access Journals (Sweden)

    Arthur Edwards

    2012-06-01

    Full Text Available Because battery-powered nodes are required in wireless sensor networks and energy consumption represents an important design consideration, alternate energy sources are needed to provide more effective and optimal function. The main goal of this work is to present an energy harvesting wireless sensor network platform, the Open Wireless Sensor node (WiSe. The design and implementation of the solar powered wireless platform is described including the hardware architecture, firmware, and a POSIX Real-Time Kernel. A sleep and wake up strategy was implemented to prolong the lifetime of the wireless sensor network. This platform was developed as a tool for researchers investigating Wireless sensor network or system integrators.

  7. An Adaptive Connectivity-based Centroid Algorithm for Node Positioning in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Aries Pratiarso

    2015-06-01

    Full Text Available In wireless sensor network applications, the position of nodes is randomly distributed following the contour of the observation area. A simple solution without any measurement tools is provided by range-free method. However, this method yields the coarse estimating position of the nodes. In this paper, we propose Adaptive Connectivity-based (ACC algorithm. This algorithm is a combination of Centroid as range-free based algorithm, and hop-based connectivity algorithm. Nodes have a possibility to estimate their own position based on the connectivity level between them and their reference nodes. Each node divides its communication range into several regions where each of them has a certain weight depends on the received signal strength. The weighted value is used to obtain the estimated position of nodes. Simulation result shows that the proposed algorithm has up to 3 meter error of estimated position on 100x100 square meter observation area, and up to 3 hop counts for 80 meters' communication range. The proposed algorithm performs an average error positioning up to 10 meters better than Weighted Centroid algorithm. Keywords: adaptive, connectivity, centroid, range-free.

  8. SDN Based User-Centric Framework for Heterogeneous Wireless Networks

    Directory of Open Access Journals (Sweden)

    Zhaoming Lu

    2016-01-01

    Full Text Available Due to the rapid growth of mobile data traffic, more and more basestations and access points (APs have been densely deployed to provide users with ubiquitous network access, which make current wireless network a complex heterogeneous network (HetNet. However, traditional wireless networks are designed with network-centric approaches where different networks have different quality of service (QoS strategies and cannot easily cooperate with each other to serve network users. Massive network infrastructures could not assure users perceived network and service quality, which is an indisputable fact. To address this issue, we design a new framework for heterogeneous wireless networks with the principle of user-centricity, refactoring the network from users’ perspective to suffice their requirements and preferences. Different from network-centric approaches, the proposed framework takes advantage of Software Defined Networking (SDN and virtualization technology, which will bring better perceived services quality for wireless network users. In the proposed user-centric framework, control plane and data plane are decoupled to manage the HetNets in a flexible and coadjutant way, and resource virtualization technology is introduced to abstract physical resources of HetNets into unified virtualized resources. Hence, ubiquitous and undifferentiated network connectivity and QoE (quality of experience driven fine-grained resource management could be achieved for wireless network users.

  9. Hop limited epidemic-like information spreading in mobile social networks with selfish nodes

    Science.gov (United States)

    Wu, Yahui; Deng, Su; Huang, Hongbin

    2013-07-01

    Similar to epidemics, information can be transmitted directly among users in mobile social networks. Different from epidemics, we can control the spreading process by adjusting the corresponding parameters (e.g., hop count) directly. This paper proposes a theoretical model to evaluate the performance of an epidemic-like spreading algorithm, in which the maximal hop count of the information is limited. In addition, our model can be used to evaluate the impact of users’ selfish behavior. Simulations show the accuracy of our theoretical model. Numerical results show that the information hop count can have an important impact. In addition, the impact of selfish behavior is related to the information hop count.

  10. Hop limited epidemic-like information spreading in mobile social networks with selfish nodes

    International Nuclear Information System (INIS)

    Wu, Yahui; Deng, Su; Huang, Hongbin

    2013-01-01

    Similar to epidemics, information can be transmitted directly among users in mobile social networks. Different from epidemics, we can control the spreading process by adjusting the corresponding parameters (e.g., hop count) directly. This paper proposes a theoretical model to evaluate the performance of an epidemic-like spreading algorithm, in which the maximal hop count of the information is limited. In addition, our model can be used to evaluate the impact of users’ selfish behavior. Simulations show the accuracy of our theoretical model. Numerical results show that the information hop count can have an important impact. In addition, the impact of selfish behavior is related to the information hop count. (paper)

  11. Power allocation strategies to minimize energy consumption in wireless body area networks.

    Science.gov (United States)

    Kailas, Aravind

    2011-01-01

    The wide scale deployment of wireless body area networks (WBANs) hinges on designing energy efficient communication protocols to support the reliable communication as well as to prolong the network lifetime. Cooperative communications, a relatively new idea in wireless communications, offers the benefits of multi-antenna systems, thereby improving the link reliability and boosting energy efficiency. In this short paper, the advantages of resorting to cooperative communications for WBANs in terms of minimized energy consumption are investigated. Adopting an energy model that encompasses energy consumptions in the transmitter and receiver circuits, and transmitting energy per bit, it is seen that cooperative transmission can improve energy efficiency of the wireless network. In particular, the problem of optimal power allocation is studied with the constraint of targeted outage probability. Two strategies of power allocation are considered: power allocation with and without posture state information. Using analysis and simulation-based results, two key points are demonstrated: (i) allocating power to the on-body sensors making use of the posture information can reduce the total energy consumption of the WBAN; and (ii) when the channel condition is good, it is better to recruit less relays for cooperation to enhance energy efficiency.

  12. Overlapping coalition formation games in wireless communication networks

    CERN Document Server

    Wang, Tianyu; Saad, Walid; Han, Zhu

    2017-01-01

    This brief introduces overlapping coalition formation games (OCF games), a novel mathematical framework from cooperative game theory that can be used to model, design and analyze cooperative scenarios in future wireless communication networks. The concepts of OCF games are explained, and several algorithmic aspects are studied. In addition, several major application scenarios are discussed. These applications are drawn from a variety of fields that include radio resource allocation in dense wireless networks, cooperative spectrum sensing for cognitive radio networks, and resource management for crowd sourcing. For each application, the use of OCF games is discussed in detail in order to show how this framework can be used to solve relevant wireless networking problems. Overlapping Coalition Formation Games in Wireless Communication Networks provides researchers, students and practitioners with a concise overview of existing works in this emerging area, exploring the relevant fundamental theories, key techniqu...

  13. RACOON: a multiuser QoS design for mobile wireless body area networks.

    Science.gov (United States)

    Cheng, Shihheng; Huang, Chingyao; Tu, Chun Chen

    2011-10-01

    In this study, Random Contention-based Resource Allocation (RACOON) medium access control (MAC) protocol is proposed to support the quality of service (QoS) for multi-user mobile wireless body area networks (WBANs). Different from existing QoS designs that focus on a single WBAN, a multiuser WBAN QoS should further consider both inter-WBAN interference and inter-WBAN priorities. Similar problems have been studied in both overlapped wireless local area networks (WLANs) and Bluetooth piconets that need QoS supports. However, these solutions are designed for non-medical transmissions that do not consider any priority scheme for medical applications. Most importantly, these studies focus on only static or low mobility networks. Network mobility of WBANs will introduce unnecessary inter-network collisions and energy waste, which are not considered by these solutions. The proposed multiuser-QoS protocol, RACOON, simultaneously satisfies the inter WBAN QoS requirements and overcomes the performance degradation caused by WBAN mobility. Simulation results verify that RACOON provides better latency and energy control, as compared with WBAN QoS protocols without considering the inter-WBAN requirements.

  14. Insecurity of Wireless Networks

    Energy Technology Data Exchange (ETDEWEB)

    Sheldon, Frederick T [ORNL; Weber, John Mark [Dynetics, Inc.; Yoo, Seong-Moo [University of Alabama, Huntsville; Pan, W. David [University of Alabama, Huntsville

    2012-01-01

    Wireless is a powerful core technology enabling our global digital infrastructure. Wi-Fi networks are susceptible to attacks on Wired Equivalency Privacy, Wi-Fi Protected Access (WPA), and WPA2. These attack signatures can be profiled into a system that defends against such attacks on the basis of their inherent characteristics. Wi-Fi is the standard protocol for wireless networks used extensively in US critical infrastructures. Since the Wired Equivalency Privacy (WEP) security protocol was broken, the Wi-Fi Protected Access (WPA) protocol has been considered the secure alternative compatible with hardware developed for WEP. However, in November 2008, researchers developed an attack on WPA, allowing forgery of Address Resolution Protocol (ARP) packets. Subsequent enhancements have enabled ARP poisoning, cryptosystem denial of service, and man-in-the-middle attacks. Open source systems and methods (OSSM) have long been used to secure networks against such attacks. This article reviews OSSMs and the results of experimental attacks on WPA. These experiments re-created current attacks in a laboratory setting, recording both wired and wireless traffic. The article discusses methods of intrusion detection and prevention in the context of cyber physical protection of critical Internet infrastructure. The basis for this research is a specialized (and undoubtedly incomplete) taxonomy of Wi-Fi attacks and their adaptations to existing countermeasures and protocol revisions. Ultimately, this article aims to provide a clearer picture of how and why wireless protection protocols and encryption must achieve a more scientific basis for detecting and preventing such attacks.

  15. On Maximizing the Lifetime of Wireless Sensor Networks by Optimally Assigning Energy Supplies

    Science.gov (United States)

    Asorey-Cacheda, Rafael; García-Sánchez, Antonio Javier; García-Sánchez, Felipe; García-Haro, Joan; Gonzalez-Castaño, Francisco Javier

    2013-01-01

    The extension of the network lifetime of Wireless Sensor Networks (WSN) is an important issue that has not been appropriately solved yet. This paper addresses this concern and proposes some techniques to plan an arbitrary WSN. To this end, we suggest a hierarchical network architecture, similar to realistic scenarios, where nodes with renewable energy sources (denoted as primary nodes) carry out most message delivery tasks, and nodes equipped with conventional chemical batteries (denoted as secondary nodes) are those with less communication demands. The key design issue of this network architecture is the development of a new optimization framework to calculate the optimal assignment of renewable energy supplies (primary node assignment) to maximize network lifetime, obtaining the minimum number of energy supplies and their node assignment. We also conduct a second optimization step to additionally minimize the number of packet hops between the source and the sink. In this work, we present an algorithm that approaches the results of the optimization framework, but with much faster execution speed, which is a good alternative for large-scale WSN networks. Finally, the network model, the optimization process and the designed algorithm are further evaluated and validated by means of computer simulation under realistic conditions. The results obtained are discussed comparatively. PMID:23939582

  16. On Maximizing the Lifetime of Wireless Sensor Networks by Optimally Assigning Energy Supplies

    Directory of Open Access Journals (Sweden)

    Francisco Javier González-Castano

    2013-08-01

    Full Text Available The extension of the network lifetime of Wireless Sensor Networks (WSN is an important issue that has not been appropriately solved yet. This paper addresses this concern and proposes some techniques to plan an arbitrary WSN. To this end, we suggest a hierarchical network architecture, similar to realistic scenarios, where nodes with renewable energy sources (denoted as primary nodes carry out most message delivery tasks, and nodes equipped with conventional chemical batteries (denoted as secondary nodes are those with less communication demands. The key design issue of this network architecture is the development of a new optimization framework to calculate the optimal assignment of renewable energy supplies (primary node assignment to maximize network lifetime, obtaining the minimum number of energy supplies and their node assignment. We also conduct a second optimization step to additionally minimize the number of packet hops between the source and the sink. In this work, we present an algorithm that approaches the results of the optimization framework, but with much faster execution speed, which is a good alternative for large-scale WSN networks. Finally, the network model, the optimization process and the designed algorithm are further evaluated and validated by means of computer simulation under realistic conditions. The results obtained are discussed comparatively.

  17. Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Nadeem Javaid

    2017-03-01

    Full Text Available In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast, second technique is the improved Hydrocast (improved-Hydrocast, and third one is the cooperative improved Hydrocast (Co-improved Hydrocast. In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR of the received signal is not within the predefined threshold then the maximal ratio combining (MRC is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

  18. Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.

    Science.gov (United States)

    Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

    2017-03-19

    In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

  19. On the Conditional Entropy of Wireless Networks

    DEFF Research Database (Denmark)

    Coon, Justin P.; Badiu, Mihai Alin; Gündüz, Deniz

    2018-01-01

    The characterization of topological uncertainty in wireless networks using the formalism of graph entropy has received interest in the spatial networks community. In this paper, we develop lower bounds on the entropy of a wireless network by conditioning on potential network observables. Two...... approaches are considered: 1) conditioning on subgraphs, and 2) conditioning on node positions. The first approach is shown to yield a relatively tight bound on the network entropy. The second yields a loose bound, in general, but it provides insight into the dependence between node positions (modelled using...

  20. Towards Controlling Latency in Wireless Networks

    KAUST Repository

    Bouacida, Nader

    2017-01-01

    Wireless networks are undergoing an unprecedented revolution in the last decade. With the explosion of delay-sensitive applications in the Internet (i.e., online gaming and VoIP), latency becomes a major issue for the development of wireless