WorldWideScience

Sample records for wireless routing friday

  1. Routing protocols in wireless sensor networks.

    Science.gov (United States)

    Villalba, Luis Javier García; Orozco, Ana Lucila Sandoval; Cabrera, Alicia Triviño; Abbas, Cláudia Jacy Barenco

    2009-01-01

    The applications of wireless sensor networks comprise a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the appropriateness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a review of the main routing protocols proposed for wireless sensor networks. Additionally, the paper includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless sensor networks.

  2. Routing in Wireless Multimedia Home Networks

    NARCIS (Netherlands)

    Scholten, Johan; Jansen, P.G.; Hop, Laurens

    This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless ¿real-time¿ home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time

  3. Routing in Wireless Multimedia Home Networks

    NARCIS (Netherlands)

    Scholten, Johan; Jansen, P.G.; Hop, Laurens

    This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless real-time home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time

  4. Advanced routing protocols for wireless networks

    CERN Document Server

    Campista , Miguel Elias Mitre

    2014-01-01

    This text introduces the principles of routing protocols and metrics as they affect wireless networking environments, specifically in urban areas. Timely because of the recent rise in small city life, this topic includes the consideration of ad hoc, mesh, vehicular, sensor, and delay tolerant networks. These approaches are each unique, and author Miguel Mitre Campista provides a thorough, but accessible, explanation of their individual characteristics for engineers, computer scientists, IT professionals, and curious Internet users.

  5. 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.

  6. A survey of routing protocols in wireless body sensor networks.

    Science.gov (United States)

    Bangash, Javed Iqbal; Abdullah, Abdul Hanan; Anisi, Mohammad Hossein; Khan, Abdul Waheed

    2014-01-13

    Wireless Body Sensor Networks (WBSNs) constitute a subset of Wireless Sensor Networks (WSNs) responsible for monitoring vital sign-related data of patients and accordingly route this data towards a sink. In routing sensed data towards sinks, WBSNs face some of the same routing challenges as general WSNs, but the unique requirements of WBSNs impose some more constraints that need to be addressed by the routing mechanisms. This paper identifies various issues and challenges in pursuit of effective routing in WBSNs. Furthermore, it provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses.

  7. Routing and Scheduling Algorithms for WirelessHARTNetworks: A Survey

    Directory of Open Access Journals (Sweden)

    Marcelo Nobre

    2015-04-01

    Full Text Available Wireless communication is a trend nowadays for the industrial environment. A number of different technologies have emerged as solutions satisfying strict industrial requirements (e.g., WirelessHART, ISA100.11a, WIA-PA. As the industrial environment presents a vast range of applications, adopting an adequate solution for each case is vital to obtain good performance of the system. In this context, the routing and scheduling schemes associated with these technologies have a direct impact on important features, like latency and energy consumption. This situation has led to the development of a vast number of routing and scheduling schemes. In the present paper, we focus on the WirelessHART technology, emphasizing its most important routing and scheduling aspects in order to guide both end users and the developers of new algorithms. Furthermore, we provide a detailed literature review of the newest routing and scheduling techniques forWirelessHART, discussing each of their features. These routing algorithms have been evaluated in terms of their objectives, metrics, the usage of theWirelessHART structures and validation method. In addition, the scheduling algorithms were also evaluated by metrics, validation, objectives and, in addition, by multiple superframe support, as well as by the redundancy method used. Moreover, this paper briefly presents some insights into the main WirelessHART simulation modules available, in order to provide viable test platforms for the routing and scheduling algorithms. Finally, some open issues in WirelessHART routing and scheduling algorithms are discussed.

  8. Power Conservation through Energy Efficient Routing in Wireless Sensor Networks.

    Science.gov (United States)

    Kandris, Dionisis; Tsioumas, Panagiotis; Tzes, Anthony; Nikolakopoulos, George; Vergados, Dimitrios D

    2009-01-01

    The power awareness issue is the primary concern within the domain of Wireless Sensor Networks (WSNs). Most power dissipation ocurrs during communication, thus routing protocols in WSNs mainly aim at power conservation. Moreover, a routing protocol should be scalable, so that its effectiveness does not degrade as the network size increases. In response to these issues, this work describes the development of an efficient routing protocol, named SHPER (Scaling Hierarchical Power Efficient Routing).

  9. 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

  10. 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.

  11. On the Capacity of Hybrid Wireless Networks with Opportunistic Routing

    Directory of Open Access Journals (Sweden)

    Tan Le

    2010-01-01

    Full Text Available This paper studies the capacity of hybrid wireless networks with opportunistic routing (OR. We first extend the opportunistic routing algorithm to exploit high-speed data transmissions in infrastructure network through base stations. We then develop linear programming models to calculate the end-to-end throughput bounds from multiple source nodes to single as well as multiple destination nodes. The developed models are applied to study several hybrid wireless network examples. Through case studies, we investigate several factors that have significant impacts on the hybrid wireless network capacity under opportunistic routing, such as node transmission range, density and distribution pattern of base stations (BTs, and number of wireless channels on wireless nodes and base stations. Our numerical results demonstrate that opportunistic routing could achieve much higher throughput on both ad hoc and hybrid networks than traditional unicast routing (UR. Moreover, opportunistic routing can efficiently utilize base stations and achieve significantly higher throughput gains in hybrid wireless networks than in pure ad hoc networks especially with multiple-channel base stations.

  12. Performance evaluation of routing metrics for wireless mesh networks

    CSIR Research Space (South Africa)

    Nxumalo, SL

    2009-08-01

    Full Text Available for WMN. The routing metrics have not been compared with QoS parameters. This paper is a work in progress of the project in which researchers want to compare the performance of different routing metrics in WMN using a wireless test bed. Researchers...

  13. 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.

  14. Routing protocols for wireless sensor networks: What the literature says?

    Directory of Open Access Journals (Sweden)

    Amit Sarkar

    2016-12-01

    Full Text Available Routing in Wireless Sensor Networks (WSNs plays a significant role in the field of environment-oriented monitoring, traffic monitoring, etc. Here, wide contributions that are made toward routing in WSN are explored. The paper mainly aims to categorize the routing problems and examines the routing-related optimization problems. For achieving the motive, 50 papers from the standard journals are collected and primarily reviewed in a chronological way. Later, various features that are related to energy, security, speed and reliability problems of routing are discussed. Subsequently, the literature is analyzed based on the simulation environment and experimental setup, awareness over the Quality of Service (QoS and the deployment against various applications. In addition, the optimization of the routing algorithms and the meta-heuristic study of routing optimization are explored. Routing is a vast area with numerous unsolved issues and hence, various research gaps along with future directions are also presented.

  15. A Novel Approach to Fair Routing in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Määttä Juho

    2009-01-01

    Full Text Available Multiradio wireless mesh network (WMN is a feasible choice for several applications, as routers with multiple network interface cards have become cheaper. Routing in any network has a great impact on the overall network performance, thus a routing protocol or algorithm for WMN should be carefully designed taking into account the specific characteristics of the network. In addition, in wireless networks, serious unfairness can occur between users if the issue is not addressed in the network protocols or algorithms. In this paper, we are proposing a novel centralized routing algorithm, called Subscriber Aware Fair Routing in WMN (SAFARI, for multiradio WMN that assures fairness, leads to a feasible scheduling, and does not collapse the aggregate network throughput with a strict fairness criterion. We show that our protocol is feasible and practical, and exhaustive simulations show that the performance is improved compared to traditional routing algorithms.

  16. Routing Data Authentication in Wireless Networks; TOPICAL

    International Nuclear Information System (INIS)

    TORGERSON, MARK D.; VAN LEEUWEN, BRIAN P.

    2001-01-01

    In this paper, we discuss several specific threats directed at the routing data of an ad hoc network. We address security issues that arise from wrapping authentication mechanisms around ad hoc routing data. We show that this bolt-on approach to security may make certain attacks more difficult, but still leaves the network routing data vulnerable. We also show that under a certain adversarial model, most existing routing protocols cannot be secured with the aid of digital signatures

  17. Secure Geographic Routing in Ad Hoc and Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zahariadis Theodore

    2010-01-01

    Full Text Available Security in sensor networks is one of the most relevant research topics in resource constrained wireless devices and networks. Several attacks can be suffered in ad hoc and wireless sensor networks (WSN, which are highly susceptible to attacks, due to the limited resources of the nodes. In this paper, we propose innovative and lightweight localization techniques that allow for intrusion identification and isolation schemes and provide accurate location information. This information is used by our routing protocol which additionally incorporates a distributed trust model to prevent several routing attacks to the network. We finally evaluate our algorithms for accurate localization and for secure routing which have been implemented and tested in real ad hoc and wireless sensor networks.

  18. Expected Transmission Energy Route Metric for Wireless Mesh Senor Networks

    Directory of Open Access Journals (Sweden)

    YanLiang Jin

    2011-01-01

    Full Text Available Mesh is a network topology that achieves high throughput and stable intercommunication. With great potential, it is expected to be the key architecture of future networks. Wireless sensor networks are an active research area with numerous workshops and conferences arranged each year. The overall performance of a WSN highly depends on the energy consumption of the network. This paper designs a new routing metric for wireless mesh sensor networks. Results from simulation experiments reveal that the new metric algorithm improves the energy balance of the whole network and extends the lifetime of wireless mesh sensor networks (WMSNs.

  19. A survey on clustering routing protocols in wireless sensor networks.

    Science.gov (United States)

    Liu, Xuxun

    2012-01-01

    The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.

  20. Energy Aware GPSR Routing Protocol in a Wireless Sensor Network ...

    African Journals Online (AJOL)

    Energy is the scarce resource in wireless sensor networks (WSNs), and it determines the lifetime of WSNs. For this reason, WSN algorithms and routing protocols should be selected in a manner which fulfills these energy requirements. This paper presents a solution to increase the lifetime of WSNs by decreasing their ...

  1. Trust framework for a secured routing in wireless sensor network

    Directory of Open Access Journals (Sweden)

    Ouassila Hoceini

    2015-11-01

    Full Text Available Traditional techniques to eliminate insider attacks developed for wired and wireless ad hoc networks are not well suited for wireless sensors networks due to their resource constraints nature. In order to protect WSNs against malicious and selfish behavior, some trust-based systems have recently been modeled. The resource efficiency and dependability of a trust system are the most fundamental requirements for any wireless sensor network (WSN. In this paper, we propose a Trust Framework for a Secured Routing in Wireless Sensor Network (TSR scheme, which works with clustered networks. This approach can effectively reduce the cost of trust evaluation and guarantee a better selection of safest paths that lead to the base station. Theoretical as well as simulation results show that our scheme requires less communication overheads and consumes less energy as compared to the current typical trust systems for WSNs. Moreover, it detects selfish and defective nodes and prevents us of insider attacks

  2. Intelligent routing protocol for ad hoc wireless network

    Science.gov (United States)

    Peng, Chaorong; Chen, Chang Wen

    2006-05-01

    A novel routing scheme for mobile ad hoc networks (MANETs), which combines hybrid and multi-inter-routing path properties with a distributed topology discovery route mechanism using control agents is proposed in this paper. In recent years, a variety of hybrid routing protocols for Mobile Ad hoc wireless networks (MANETs) have been developed. Which is proactively maintains routing information for a local neighborhood, while reactively acquiring routes to destinations beyond the global. The hybrid protocol reduces routing discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the other side the hybrid routing protocols in MANETs likes Zone Routing Protocol still need route "re-discover" time when a route between zones link break. Sine the topology update information needs to be broadcast routing request on local zone. Due to this delay, the routing protocol may not be applicable for real-time data and multimedia communication. We utilize the advantages of a clustering organization and multi-routing path in routing protocol to achieve several goals at the same time. Firstly, IRP efficiently saves network bandwidth and reduces route reconstruction time when a routing path fails. The IRP protocol does not require global periodic routing advertisements, local control agents will automatically monitor and repair broke links. Secondly, it efficiently reduces congestion and traffic "bottlenecks" for ClusterHeads in clustering network. Thirdly, it reduces significant overheads associated with maintaining clusters. Fourthly, it improves clusters stability due to dynamic topology changing frequently. In this paper, we present the Intelligent Routing Protocol. First, we discuss the problem of routing in ad hoc networks and the motivation of IRP. We describe the hierarchical architecture of IRP. We describe the routing process and illustrate it with an example. Further, we describe the control manage

  3. Secure Multicast Routing Algorithm for Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Rakesh Matam

    2016-01-01

    Full Text Available Multicast is an indispensable communication technique in wireless mesh network (WMN. Many applications in WMN including multicast TV, audio and video conferencing, and multiplayer social gaming use multicast transmission. On the other hand, security in multicast transmissions is crucial, without which the network services are significantly disrupted. Existing secure routing protocols that address different active attacks are still vulnerable due to subtle nature of flaws in protocol design. Moreover, existing secure routing protocols assume that adversarial nodes cannot share an out-of-band communication channel which rules out the possibility of wormhole attack. In this paper, we propose SEMRAW (SEcure Multicast Routing Algorithm for Wireless mesh network that is resistant against all known active threats including wormhole attack. SEMRAW employs digital signatures to prevent a malicious node from gaining illegitimate access to the message contents. Security of SEMRAW is evaluated using the simulation paradigm approach.

  4. How Effective is Routing for Wireless Networking

    Science.gov (United States)

    2016-03-05

    generation (loadng),” draft-clausen-lln-loadng-12 (work in progress), 2014. [12] T. Winter, “Rpl: Ipv6 routing protocol for low-power and lossy networks...Neighbor discovery optimization for ipv6 over low-power wire- less personal area networks (6lowpans),” IETF RFC 6775, 2012. [18] J. Hui and R. Kelsey

  5. Joint Power Charging and Routing in Wireless Rechargeable Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jie Jia

    2017-10-01

    Full Text Available The development of wireless power transfer (WPT technology has inspired the transition from traditional battery-based wireless sensor networks (WSNs towards wireless rechargeable sensor networks (WRSNs. While extensive efforts have been made to improve charging efficiency, little has been done for routing optimization. In this work, we present a joint optimization model to maximize both charging efficiency and routing structure. By analyzing the structure of the optimization model, we first decompose the problem and propose a heuristic algorithm to find the optimal charging efficiency for the predefined routing tree. Furthermore, by coding the many-to-one communication topology as an individual, we further propose to apply a genetic algorithm (GA for the joint optimization of both routing and charging. The genetic operations, including tree-based recombination and mutation, are proposed to obtain a fast convergence. Our simulation results show that the heuristic algorithm reduces the number of resident locations and the total moving distance. We also show that our proposed algorithm achieves a higher charging efficiency compared with existing algorithms.

  6. Joint Power Charging and Routing in Wireless Rechargeable Sensor Networks.

    Science.gov (United States)

    Jia, Jie; Chen, Jian; Deng, Yansha; Wang, Xingwei; Aghvami, Abdol-Hamid

    2017-10-09

    The development of wireless power transfer (WPT) technology has inspired the transition from traditional battery-based wireless sensor networks (WSNs) towards wireless rechargeable sensor networks (WRSNs). While extensive efforts have been made to improve charging efficiency, little has been done for routing optimization. In this work, we present a joint optimization model to maximize both charging efficiency and routing structure. By analyzing the structure of the optimization model, we first decompose the problem and propose a heuristic algorithm to find the optimal charging efficiency for the predefined routing tree. Furthermore, by coding the many-to-one communication topology as an individual, we further propose to apply a genetic algorithm (GA) for the joint optimization of both routing and charging. The genetic operations, including tree-based recombination and mutation, are proposed to obtain a fast convergence. Our simulation results show that the heuristic algorithm reduces the number of resident locations and the total moving distance. We also show that our proposed algorithm achieves a higher charging efficiency compared with existing algorithms.

  7. A distributed geo-routing algorithm for wireless sensor networks.

    Science.gov (United States)

    Joshi, Gyanendra Prasad; Kim, Sung Won

    2009-01-01

    Geographic wireless sensor networks use position information for greedy routing. Greedy routing works well in dense networks, whereas in sparse networks it may fail and require a recovery algorithm. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costly for resource constrained position-based wireless sensor networks (WSNs). In this paper, we propose a void avoidance algorithm (VAA), a novel idea based on upgrading virtual distance. VAA allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forwarding packets using only greedy routing. In VAA, the stuck node upgrades distance unless it finds a next hop node that is closer to the destination than it is. VAA guarantees packet delivery if there is a topologically valid path. Further, it is completely distributed, immediately responds to node failure or topology changes and does not require planarization of the network. NS-2 is used to evaluate the performance and correctness of VAA and we compare its performance to other protocols. Simulations show our proposed algorithm consumes less energy, has an efficient path and substantially less control overheads.

  8. ZERO: Probabilistic Routing for Deploy and Forget Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jose Carlos Pacho

    2010-09-01

    Full Text Available As Wireless Sensor Networks are being adopted by industry and agriculture for large-scale and unattended deployments, the need for reliable and energy-conservative protocols become critical. Physical and Link layer efforts for energy conservation are not mostly considered by routing protocols that put their efforts on maintaining reliability and throughput. Gradient-based routing protocols route data through most reliable links aiming to ensure 99% packet delivery. However, they suffer from the so-called ”hot spot” problem. Most reliable routes waste their energy fast, thus partitioning the network and reducing the area monitored. To cope with this ”hot spot” problem we propose ZERO a combined approach at Network and Link layers to increase network lifespan while conserving reliability levels by means of probabilistic load balancing techniques.

  9. ZERO: probabilistic routing for deploy and forget Wireless Sensor Networks.

    Science.gov (United States)

    Vilajosana, Xavier; Llosa, Jordi; Pacho, Jose Carlos; Vilajosana, Ignasi; Juan, Angel A; Vicario, Jose Lopez; Morell, Antoni

    2010-01-01

    As Wireless Sensor Networks are being adopted by industry and agriculture for large-scale and unattended deployments, the need for reliable and energy-conservative protocols become critical. Physical and Link layer efforts for energy conservation are not mostly considered by routing protocols that put their efforts on maintaining reliability and throughput. Gradient-based routing protocols route data through most reliable links aiming to ensure 99% packet delivery. However, they suffer from the so-called "hot spot" problem. Most reliable routes waste their energy fast, thus partitioning the network and reducing the area monitored. To cope with this "hot spot" problem we propose ZERO a combined approach at Network and Link layers to increase network lifespan while conserving reliability levels by means of probabilistic load balancing techniques.

  10. Delay Tolerance in Underwater Wireless Communications: A Routing Perspective

    Directory of Open Access Journals (Sweden)

    Safdar Hussain Bouk

    2016-01-01

    Full Text Available Similar to terrestrial networks, underwater wireless networks (UWNs also aid several critical tasks including coastal surveillance, underwater pollution detection, and other maritime applications. Currently, once underwater sensor nodes are deployed at different levels of the sea, it is nearly impossible or very expensive to reconfigure the hardware, for example, battery. Taking this issue into account, considerable amount of research has been carried out to ensure minimum energy costs and reliable communication between underwater nodes and base stations. As a result, several different network protocols were proposed for UWN, including MAC, PHY, transport, and routing. Recently, a new paradigm was introduced claiming that the intermittent nature of acoustic channel and signal resulted in designing delay tolerant routing schemes for the UWN, known as an underwater delay tolerant network. In this paper, we provide a comprehensive survey of underwater routing protocols with emphasis on the limitations, challenges, and future open issues in the context of delay tolerant network routing.

  11. Comparison of routing metrics for wireless mesh networks

    CSIR Research Space (South Africa)

    Nxumalo, SL

    2011-09-01

    Full Text Available Tel: +27359026706, Fax: +27359026569 and Meraka Institute Council for Scientific and Industrial Research email: {slnxumalo, profmatthewo, pmudali, sakhilemichael}@gmail.com; NNtlatlapa@csir.co.za id36983125 pdfMachine by Broadgun Software - a... 563- 581. [4]Nxumalo S.L, Ntlatlapa, N, Mudali, P, Adigun, M.O. 2009. Performance Evaluation of Routing Metrics for Wireless Mesh Networks. In Procedings of South African Telecommunication Networks and Applications...

  12. Experimental Comparison of Routing Protocols for Wireless Sensors Networks: Routing Overhead and Asymmetric Links

    OpenAIRE

    Audéoud , Henry-Joseph; Heusse , Martin

    2017-01-01

    International audience; RPL (the IETF Routing Protocol for Low-Power and Lossy Networks) and LRP (Lightweight Routing Protocol) have in common to build a collection tree (or, more precisely, a DODAG) and “downward” host routes in the wireless sensor network. Additionally, the objective of LRP is to keep control overhead as low as possible. To substantiate this claim, we compare RPL and LRP using 40 nodes of the IoT-LAB testbed — and the results are telling.We then introduce asymmetric links, ...

  13. An Efficient Bypassing Void Routing Algorithm for Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Xunli Fan

    2015-01-01

    Full Text Available Since the sensor node’s distribution in a wireless sensor network (WSN is irregular, geographic routing protocols using the greedy algorithm can cause local minima problem. This problem may fail due to routing voids and lead to failure of data transmission. Based on the virtual coordinate mapping, this paper proposes an efficient bypassing void routing protocol to solve the control packet overhead and transmission delay in routing void of WSN, which is called EBVRPVCM. The basic idea is to transfer the random structure of void edge to a regular one through mapping the coordinates on a virtual circle. In EBVRPVCM, some strategies, executed in different regions, are selected through virtual coordinates to bypass routing void efficiently. The regular edge is established by coordinate mapping that can shorten the average routing path length and decrease the transmission delay. The virtual coordinate mapping is not affected by the real geographic node position, and the control packet overhead can be reduced accordingly. Compared with RGP and GPSR, simulation results demonstrate that EBVRPVCM can successfully find the shortest routing path with higher delivery ratio and less control packet overhead and energy consumption.

  14. Evaluation of SVR: A Wireless Sensor Network Routing Protocol

    Directory of Open Access Journals (Sweden)

    Javed Ali Baloch

    2014-07-01

    Full Text Available The advancement in technology has made it possible to create small in size, low cost sensor nodes. However, the small size and low cost of such nodes comesat at price that is, reduced processing power, low memory and significantly small battery energy storage. WSNs (Wireless Sensor Networks are inherently ad hoc in nature and are assumed to work in the toughest terrain. The network lifetime plays a pivotal role in a wireless sensor network. A long network lifetime, could be achieved by either making significant changes in these low cost devices, which is not a feasible solution or by improving the means of communication throughout the network. The communication in such networks could be improved by employing energy efficient routing protocols, to route the data throughout the network. In this paper the SVR (Spatial Vector Routing protocol is compared against the most common WSN routing protocols, and from the results it could be inferred that the SVR protocol out performs its counterparts. The protocol provides an energy efficient means of communication in the network

  15. Evaluation of svr: a wireless sensor network routing protocol

    International Nuclear Information System (INIS)

    Baloch, J.; Khanzada, T.J.S.

    2014-01-01

    The advancement in technology has made it possible to create small in size, low cost sensor nodes. However, the small size and low cost of such nodes comesat at price that is, reduced processing power, low memory and significantly small battery energy storage. WSNs (Wireless Sensor Networks) are inherently ad hoc in nature and are assumed to work in the toughest terrain. The network lifetime plays a pivotal role in a wireless sensor network. A long network lifetime, could be achieved by either making significant changes in these low cost devices, which is not a feasible solution or by improving the means of communication throughout the network. The communication in such networks could be improved by employing energy efficient routing protocols, to route the data throughout the network. In this paper the SVR (Spatial Vector Routing) protocol is compared against the most common WSN routing protocols, and from the results it could be inferred that the SVR protocol out performs its counterparts. The protocol provides an energy efficient means of communication in the network. (author)

  16. Delay Efficient Backpressure Routing in Wireless Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Leandros A. Maglaras

    2014-09-01

    Full Text Available Packet scheduling/routing in wireless ad hoc networks is a fundamental problem for ad hoc networking. Backpressure routing is a solid and throughput optimal policy for such networks, but suffers from increased delays. In this article, we present two holistic approaches to improve upon the delay problems of backpressuretype algorithms. We develop two scheduling algorithms, namely Voting backpressure and Layered backpressure routing, which are throughput optimal. We experimentally compare the proposed algorithms against state-of-the-art delay-aware backpressure algorithms, which provide optimal throughput, for different payloads and network topologies, both for static and mobile networks. The experimental evaluation of the proposed delay reduction algorithms attest their superiority in terms of QoS, robustness, low computational complexity and simplicity.

  17. Characterizing Deficiencies of Path-Based Routing for Wireless Multi-Hop Networks

    Science.gov (United States)

    2017-05-01

    how effective routing is for reliably and efficiently delivering data in a wireless network. With the emergence of the Internet of Things , there is a...But with the advent of the Internet of Things , the number of wireless networked devices is expected to reach into the billions [1–3]. To support this...of the wireless environ- ment inherently make link-based routing unsuitable for wireless networking. Requirements for the future Internet of Things are

  18. Multipath Routing Protocol Using Basic Reconstruction Routing (BRR) Algorithm in Wireless Sensor Network

    OpenAIRE

    K. Rajasekaran; Kannan Balasubramanian

    2015-01-01

    A sensory network consists of multiple detection locations called sensor nodes, each of which is tiny, featherweight and portable. A single path routing protocols in wireless sensor network can lead to holes in the network, since only the nodes present in the single path is used for the data transmission. Apart from the advantages like reduced computation, complexity and resource utilization, there are some drawbacks like throughput, increased traffic load and delay in da...

  19. Secure energy efficient routing protocol for wireless sensor network

    Directory of Open Access Journals (Sweden)

    Das Ayan Kumar

    2016-03-01

    Full Text Available The ease of deployment of economic sensor networks has always been a boon to disaster management applications. However, their vulnerability to a number of security threats makes communication a challenging task. This paper proposes a new routing technique to prevent from both external threats and internal threats like hello flooding, eavesdropping and wormhole attack. In this approach one way hash chain is used to reduce the energy drainage. Level based event driven clustering also helps to save energy. The simulation results show that the proposed scheme extends network lifetime even when the cluster based wireless sensor network is under attack.

  20. A comparative view of routing protocols for underwater wireless sensor networks

    NARCIS (Netherlands)

    Bayrakdar, Y.; Meratnia, Nirvana; Kantarci, Aylin

    2011-01-01

    Design of efficient routing protocols for underwater sensor networks is challenging because of the distinctive characteristics of the water medium. Currently, many routing protocols are available for terrestrial wireless sensor networks. However, specific properties of underwater medium such as

  1. Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering

    Directory of Open Access Journals (Sweden)

    Christos Douligeris

    2013-01-01

    Full Text Available The wide utilization of Wireless Sensor Networks (WSNs is obstructed by the severely limited energy constraints of the individual sensor nodes. This is the reason why a large part of the research in WSNs focuses on the development of energy efficient routing protocols. In this paper, a new protocol called Equalized Cluster Head Election Routing Protocol (ECHERP, which pursues energy conservation through balanced clustering, is proposed. ECHERP models the network as a linear system and, using the Gaussian elimination algorithm, calculates the combinations of nodes that can be chosen as cluster heads in order to extend the network lifetime. The performance evaluation of ECHERP is carried out through simulation tests, which evince the effectiveness of this protocol in terms of network energy efficiency when compared against other well-known protocols.

  2. 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.

  3. Design and Analysis of Secure Routing Protocol for Wireless Sensor Networks

    Science.gov (United States)

    Wang, Jiong; Zhang, Hua

    2017-09-01

    In recent years, with the development of science and technology and the progress of the times, China's wireless network technology has become increasingly prosperous and it plays an important role in social production and life. In this context, in order to further to enhance the stability of wireless network data transmission and security enhancements, the staff need to focus on routing security and carry out related work. Based on this, this paper analyzes the design of wireless sensor based on secure routing protocol.

  4. A NOVEL RESOURCE CONSTRAINT SECURE(RCS) ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORK

    OpenAIRE

    R. GEETHA; E. KANNAN

    2017-01-01

    Geographic routing protocols are the most preferred routing protocols for Wireless Sensor Networks (WSN) since they rely on geographic position information. Hence we propose geography based Resource Constraint Secure routing (RCS) protocol. The existing routing protocol named Cost Aware SEcure Routing (CASER) allows messages to be transmitted using random walking routing strategy. In the Random walking method, there is a chance of choosing low energy node as a relay node. RCS protocol overcom...

  5. Mobility based multicast routing in wireless mesh networks

    Science.gov (United States)

    Jain, Sanjeev; Tripathi, Vijay S.; Tiwari, Sudarshan

    2013-01-01

    There exist two fundamental approaches to multicast routing namely minimum cost trees and shortest path trees. The (MCT's) minimum cost tree is one which connects receiver and sources by providing a minimum number of transmissions (MNTs) the MNTs approach is generally used for energy constraint sensor and mobile ad hoc networks. In this paper we have considered node mobility and try to find out simulation based comparison of the (SPT's) shortest path tree, (MST's) minimum steiner trees and minimum number of transmission trees in wireless mesh networks by using the performance metrics like as an end to end delay, average jitter, throughput and packet delivery ratio, average unicast packet delivery ratio, etc. We have also evaluated multicast performance in the small and large wireless mesh networks. In case of multicast performance in the small networks we have found that when the traffic load is moderate or high the SPTs outperform the MSTs and MNTs in all cases. The SPTs have lowest end to end delay and average jitter in almost all cases. In case of multicast performance in the large network we have seen that the MSTs provide minimum total edge cost and minimum number of transmissions. We have also found that the one drawback of SPTs, when the group size is large and rate of multicast sending is high SPTs causes more packet losses to other flows as MCTs.

  6. PCA-Guided Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Gong Chen

    2012-01-01

    Full Text Available An important performance concern for wireless sensor networks (WSNs is the total energy dissipated by all the nodes in the network over the course of network lifetime. In this paper, we propose a routing algorithm termed as PCA-guided routing algorithm (PCA-RA by exploring the principal component analysis (PCA approach. Our algorithm remarkably reduces energy consumption and prolongs network lifetime by realizing the objective of minimizing the sum of distances between the nodes and the cluster centers in a WSN network. It is demonstrated that the PCA-RA can be efficiently implemented in WSNs by forming a nearly optimal K-means-like clustering structure. In addition, it can decrease the network load while maintaining the accuracy of the sensor measurements during data aggregating process. We validate the efficacy and efficiency of the proposed algorithm by simulations. Both theoretical analyses and simulation results demonstrate that this algorithm can perform significantly with less energy consumption and thus prolong the system lifetime for the networks.

  7. The Application of RPL Routing Protocol in Low Power Wireless Sensor and Lossy Networks

    Directory of Open Access Journals (Sweden)

    Xun Yang

    2014-05-01

    Full Text Available With the continuous development of computer information technology, wireless sensor has been successfully changed the mode of human life, at the same time, as one of the technologies continues to improve the future life, how to better integration with the RPL routing protocols together become one of research focuses in the current climate. This paper start from the wireless sensor network, briefly discusses the concept, followed by systematic exposition of RPL routing protocol developed background, relevant standards, working principle, topology and related terms, and finally explore the RPL routing protocol in wireless sensor low power lossy network applications.

  8. Black Friday = Broget Branding?

    DEFF Research Database (Denmark)

    Hansen, Heidi

    2015-01-01

    Black Friday er et godt eksempel på, hvordan ikke kun produktbrands og corporate brands rejser på tværs af landegrænser, men også traditioner som Halloween, Valentines Day og i dette tilfælde den ultimative tilbuds-fredag, som i USA går under navnet Black Friday. Men hvad er Black Friday i Danmark......? Essensen ved Black Friday er lave priser, og det er der ved første øjekast ikke mange brandingmuligheder forbundet ved, hvis man forstår branding som en måde at skabe ekstra værdi omkring sit produkt eller sin virksomhed. Som brand bliver man dog alligevel nødt til at forholde sig til konceptet, da det er...

  9. A Comparative Study of Wireless Sensor Networks and Their Routing Protocols

    Directory of Open Access Journals (Sweden)

    Subhajit Pal

    2010-11-01

    Full Text Available Recent developments in the area of micro-sensor devices have accelerated advances in the sensor networks field leading to many new protocols specifically designed for wireless sensor networks (WSNs. Wireless sensor networks with hundreds to thousands of sensor nodes can gather information from an unattended location and transmit the gathered data to a particular user, depending on the application. These sensor nodes have some constraints due to their limited energy, storage capacity and computing power. Data are routed from one node to other using different routing protocols. There are a number of routing protocols for wireless sensor networks. In this review article, we discuss the architecture of wireless sensor networks. Further, we categorize the routing protocols according to some key factors and summarize their mode of operation. Finally, we provide a comparative study on these various protocols.

  10. A comparative study of wireless sensor networks and their routing protocols.

    Science.gov (United States)

    Bhattacharyya, Debnath; Kim, Tai-hoon; Pal, Subhajit

    2010-01-01

    Recent developments in the area of micro-sensor devices have accelerated advances in the sensor networks field leading to many new protocols specifically designed for wireless sensor networks (WSNs). Wireless sensor networks with hundreds to thousands of sensor nodes can gather information from an unattended location and transmit the gathered data to a particular user, depending on the application. These sensor nodes have some constraints due to their limited energy, storage capacity and computing power. Data are routed from one node to other using different routing protocols. There are a number of routing protocols for wireless sensor networks. In this review article, we discuss the architecture of wireless sensor networks. Further, we categorize the routing protocols according to some key factors and summarize their mode of operation. Finally, we provide a comparative study on these various protocols.

  11. Performance evaluation of spatial vector routing protocol for wireless sensor networks

    International Nuclear Information System (INIS)

    Baloch, J.; Jokhio, I.

    2012-01-01

    WSNs (Wireless Sensor Networks) is an emerging area of research. Researchers worldwide are working on the issues faced by sensor nodes. Communication has been a major issue in wireless networks and the problem is manifolds in WSN s because of the limited resources. The routing protocol in such networks plays a pivotal role, as an effective routing protocol could significantly reduce the energy consumed in transmitting and receiving data packets throughout a network. In this paper the performance of SVR (Spatial Vector Routing) an energy efficient, location aware routing protocol is compared with the existing location aware protocols. The results from the simulation trials show the performance of SVR. (author)

  12. Performance Evaluation of Spatial Vector Routing Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Javed Ali Baloch

    2012-10-01

    Full Text Available WSNs (Wireless Sensor Networks is an emerging area of research. Researchers worldwide are working on the issues faced by sensor nodes. Communication has been a major issue in wireless networks and the problem is manifolds in WSNs because of the limited resources. The routing protocol in such networks plays a pivotal role, as an effective routing protocol could significantly reduce the energy consumed in transmitting and receiving data packets throughout a network. In this paper the performance of SVR (Spatial Vector Routing an energy efficient, location aware routing protocol is compared with the existing location aware protocols. The results from the simulation trials show the performance of SVR.

  13. 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.

  14. A Case for Hierarchical Routing in in Low-Power Wireless Embedded Networks

    NARCIS (Netherlands)

    Iwanicki, K.S.; van Steen, M.R.

    2012-01-01

    Hierarchical routing has often been mentioned as an appealing point-to-point routing technique for wireless sensor networks (sensornets). While there is a volume of analytical and high-level simulation results demonstrating its merits, there has been little work evaluating it in actual sensornet

  15. 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...

  16. GRAdient Cost Establishment (GRACE for an Energy-Aware Routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Noor M. Khan

    2009-01-01

    Full Text Available In Wireless Sensor Network (WSN, the nodes have limitations in terms of energy-constraint, unreliable links, and frequent topology change. In this paper we propose an energy-aware routing protocol, that outperforms the existing ones with an enhanced network lifetime and more reliable data delivery. Major issues in the design of a routing strategy in wireless sensor networks are to make efficient use of energy and to increase reliability in data delivery. The proposed approach reduces both energy consumption and communication-bandwidth requirements and prolongs the lifetime of the wireless sensor network. Using both analysis and extensive simulations, we show that the proposed dynamic routing helps achieve the desired system performance under dynamically changing network conditions. The proposed algorithm is compared with one of the best existing routing algorithms, GRAB. Moreover, a modification in GRAB is proposed which not only improves its performance but also prolongs its lifetime.

  17. Location-Based Self-Adaptive Routing Algorithm for Wireless Sensor Networks in Home Automation

    Directory of Open Access Journals (Sweden)

    Hong SeungHo

    2011-01-01

    Full Text Available The use of wireless sensor networks in home automation (WSNHA is attractive due to their characteristics of self-organization, high sensing fidelity, low cost, and potential for rapid deployment. Although the AODVjr routing algorithm in IEEE 802.15.4/ZigBee and other routing algorithms have been designed for wireless sensor networks, not all are suitable for WSNHA. In this paper, we propose a location-based self-adaptive routing algorithm for WSNHA called WSNHA-LBAR. It confines route discovery flooding to a cylindrical request zone, which reduces the routing overhead and decreases broadcast storm problems in the MAC layer. It also automatically adjusts the size of the request zone using a self-adaptive algorithm based on Bayes' theorem. This makes WSNHA-LBAR more adaptable to the changes of the network state and easier to implement. Simulation results show improved network reliability as well as reduced routing overhead.

  18. Energy Efficient Routing in Wireless Sensor Networks based on Ant ...

    African Journals Online (AJOL)

    Wireless Sensor Networks (WSN's) have become an important and challenging research area in recent years. Wireless Sensor Networks consisting of nodes with limited power are deployed to gather useful information from the field. In WSNs it is critical to collect the information in an energy efficient manner. Ant Colony ...

  19. On Multipath Routing in Multihop Wireless Networks: Security, Performance, and Their Tradeoff

    Directory of Open Access Journals (Sweden)

    Lin Chen

    2009-01-01

    Full Text Available Routing amid malicious attackers in multihop wireless networks with unreliable links is a challenging task. In this paper, we address the fundamental problem of how to choose secure and reliable paths in such environments. We formulate the multipath routing problem as optimization problems and propose algorithms with polynomial complexity to solve them. Game theory is employed to solve and analyze the formulated multipath routing problem. We first propose the multipath routing solution minimizing the worst-case security risk (i.e., the percentage of packets captured by attackers in the worst case. While the obtained solution provides the most security routes, it may perform poorly given the unreliability of wireless links. Hence we then investigate the multipath routing solution maximizing the worst-case packet delivery ratio. As a natural extension, to achieve a tradeoff between the routing security and performance, we derive the multipath routing protocol maximizing the worst-case packet delivery ratio while limiting the worst-case security risk under given threshold. As another contribution, we establish the relationship between the worst-case security risk and packet delivery ratio, which gives the theoretical limit on the security-performance tradeoff of node-disjoint multipath routing in multihop wireless networks.

  20. Secure Trust Based Key Management Routing Framework for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jugminder Kaur

    2016-01-01

    Full Text Available Security is always a major concern in wireless sensor networks (WSNs. Several trust based routing protocols are designed that play an important role in enhancing the performance of a wireless network. However they still have some disadvantages like limited energy resources, susceptibility to physical capture, and little protection against various attacks due to insecure wireless communication channels. This paper presents a secure trust based key management (STKF routing framework that establishes a secure trustworthy route depending upon the present and past node to node interactions. This route is then updated by isolating the malicious or compromised nodes from the route, if any, and a dedicated link is created between every pair of nodes in the selected route with the help of “q” composite random key predistribution scheme (RKPS to ensure data delivery from source to destination. The performance of trust aware secure routing framework (TSRF is compared with the proposed routing scheme. The results indicate that STKF provides an effective mechanism for finding out a secure route with better trustworthiness than TSRF which avoids the data dropping, thereby increasing the data delivery ratio. Also the distance required to reach the destination in the proposed protocol is less hence effectively utilizing the resources.

  1. A comprehensive survey of energy-aware routing protocols in wireless body area sensor networks.

    Science.gov (United States)

    Effatparvar, Mehdi; Dehghan, Mehdi; Rahmani, Amir Masoud

    2016-09-01

    Wireless body area sensor network is a special purpose wireless sensor network that, employing wireless sensor nodes in, on, or around the human body, makes it possible to measure biological parameters of a person for specific applications. One of the most fundamental concerns in wireless body sensor networks is accurate routing in order to send data promptly and properly, and therefore overcome some of the challenges. Routing protocols for such networks are affected by a large number of factors including energy, topology, temperature, posture, the radio range of sensors, and appropriate quality of service in sensor nodes. Since energy is highly important in wireless body area sensor networks, and increasing the network lifetime results in benefiting greatly from sensor capabilities, improving routing performance with reduced energy consumption presents a major challenge. This paper aims to study wireless body area sensor networks and the related routing methods. It also presents a thorough, comprehensive review of routing methods in wireless body area sensor networks from the perspective of energy. Furthermore, different routing methods affecting the parameter of energy will be classified and compared according to their advantages and disadvantages. In this paper, fundamental concepts of wireless body area sensor networks are provided, and then the advantages and disadvantages of these networks are investigated. Since one of the most fundamental issues in wireless body sensor networks is to perform routing so as to transmit data precisely and promptly, we discuss the same issue. As a result, we propose a classification of the available relevant literature with respect to the key challenge of energy in the routing process. With this end in view, all important papers published between 2000 and 2015 are classified under eight categories including 'Mobility-Aware', 'Thermal-Aware', 'Restriction of Location and Number of Relays', 'Link-aware', 'Cluster- and Tree

  2. Performance Evaluation of a Routing Protocol in Wireless Sensor Network

    National Research Council Canada - National Science Library

    Cheng Kiat Amos, Teo

    2005-01-01

    ... and have topologies engineered. As such, recent research into wireless sensor networks has attracted great interest due to its diversity of applications, ranging in areas such as home, health, environmental and military applications...

  3. An Emergency-Adaptive Routing Scheme for Wireless Sensor Networks for Building Fire Hazard Monitoring

    Directory of Open Access Journals (Sweden)

    Guilin Zheng

    2011-03-01

    Full Text Available Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.

  4. An Emergency-Adaptive Routing Scheme for Wireless Sensor Networks for Building Fire Hazard Monitoring

    Directory of Open Access Journals (Sweden)

    Yuanyuan Zeng

    2010-06-01

    Full Text Available Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.

  5. Adaptive routing in wireless communication networks using swarm intelligence

    Science.gov (United States)

    Arabshahi, P.; Gray, A.; Kassabalidis, I.; Das, A.; Narayanan, S.; Sharkawi, M. El; Marks, R. J.

    2001-01-01

    In this paper we focus on the network routing problem, and survey swarm intelligent approaches for its efficient solution, after a brief overview of power-aware routing schemes, which are important in the network examples outlined above.

  6. Using reputation systems and non-deterministic routing to secure wireless sensor networks.

    Science.gov (United States)

    Moya, José M; Vallejo, Juan Carlos; Fraga, David; Araujo, Alvaro; Villanueva, Daniel; de Goyeneche, Juan-Mariano

    2009-01-01

    Security in wireless sensor networks is difficult to achieve because of the resource limitations of the sensor nodes. We propose a trust-based decision framework for wireless sensor networks coupled with a non-deterministic routing protocol. Both provide a mechanism to effectively detect and confine common attacks, and, unlike previous approaches, allow bad reputation feedback to the network. This approach has been extensively simulated, obtaining good results, even for unrealistically complex attack scenarios.

  7. Using Reputation Systems and Non-Deterministic Routing to Secure Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Juan-Mariano de Goyeneche

    2009-05-01

    Full Text Available Security in wireless sensor networks is difficult to achieve because of the resource limitations of the sensor nodes. We propose a trust-based decision framework for wireless sensor networks coupled with a non-deterministic routing protocol. Both provide a mechanism to effectively detect and confine common attacks, and, unlike previous approaches, allow bad reputation feedback to the network. This approach has been extensively simulated, obtaining good results, even for unrealistically complex attack scenarios.

  8. Pithy Review on Routing Protocols in Wireless Sensor Networks and Least Routing Time Opportunistic Technique in WSN

    Science.gov (United States)

    Salman Arafath, Mohammed; Rahman Khan, Khaleel Ur; Sunitha, K. V. N.

    2018-01-01

    Nowadays due to most of the telecommunication standard development organizations focusing on using device-to-device communication so that they can provide proximity-based services and add-on services on top of the available cellular infrastructure. An Oppnets and wireless sensor network play a prominent role here. Routing in these networks plays a significant role in fields such as traffic management, packet delivery etc. Routing is a prodigious research area with diverse unresolved issues. This paper firstly focuses on the importance of Opportunistic routing and its concept then focus is shifted to prime aspect i.e. on packet reception ratio which is one of the highest QoS Awareness parameters. This paper discusses the two important functions of routing in wireless sensor networks (WSN) namely route selection using least routing time algorithm (LRTA) and data forwarding using clustering technique. Finally, the simulation result reveals that LRTA performs relatively better than the existing system in terms of average packet reception ratio and connectivity.

  9. Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis.

    Science.gov (United States)

    Alanazi, Adwan; Elleithy, Khaled

    2015-09-02

    Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol.

  10. Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Su Xia

    2014-05-01

    Full Text Available With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In this research, we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping (VHM of the UTC mesh under spherical boundary condition. It is a one-to-one map that yields virtual coordinates for each node in the network without or with one internal hole. Since a boundary has been mapped to a sphere, node-based greedy routing is always successful thereon. At the same time, we exploit the UTC mesh to develop a face-based greedy routing algorithm and prove its success at internal nodes. To deliver a data packet to its destination, face-based and node-based greedy routing algorithms are employed alternately at internal and boundary UTCs, respectively. For networks with multiple internal holes, a segmentation and tunnel-based routing strategy is proposed on top of VHM to support global end-to-end routing. As far as we know, this is the first work that realizes truly deterministic routing with constant-bounded storage and computation in general 3D wireless sensor networks.

  11. A Multipath Routing Protocol Based on Bloom Filter for Multihop Wireless Networks

    Directory of Open Access Journals (Sweden)

    Junwei Jin

    2016-01-01

    Full Text Available On-demand multipath routing in a wireless ad hoc network is effective in achieving load balancing over the network and in improving the degree of resilience to mobility. In this paper, the salvage capable opportunistic node-disjoint multipath routing (SNMR protocol is proposed, which forms multiple routes for data transmission and supports packet salvaging with minimum overhead. The proposed mechanism constructs a primary path and a node-disjoint backup path together with alternative paths for the intermediate nodes in the primary path. It can be achieved by considering the reverse route back to the source stored in the route cache and the primary path information compressed by a Bloom filter. Our protocol presents higher capability in packet salvaging and lower overhead in forming multiple routes. Simulation results show that SNMR outperforms the compared protocols in terms of packet delivery ratio, normalized routing load, and throughput.

  12. IMPROVED VIRTUAL CIRCUIT ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORKS UNDER THE ASPECT OF POWER AWARENESS

    Directory of Open Access Journals (Sweden)

    Abid Ali Minhas

    2006-06-01

    Full Text Available Routing algorithms have shown their importance in the power aware wireless micro-sensor networks. In this paper first we present virtual circuit algorithm (VCRA, a routing algorithm for wireless sensor networks. We analyze the power utilized by nodes to lengthen the battery life and thus improving the lifetime of wireless sensor network. We discuss VCRA in comparison with the Multihoprouter, an algorithm developed by UC Berkeley. Then we present Improved Virtual Circuit Routing Algorithm (IVCRA which is an improved form of VCRA. In IVCRA node failure detection and path repairing scheme has been implemented. We also present the energy analysis of IVCRA and prove that IVCRA is the best choice. We first implement our routing algorithms in simulator TOSSIM and then on real hardware of mica2 mote-sensor network platform and prove the reliable routing of the data packets from different nodes to the base station. The motes used as nodes in our mote-sensor network are from Berkeley USA. By using simulator POWERTOSSIM, we estimate and present the energy utilized by different nodes of the network. At the end we present a comparison of our work with the network layer of Zigbee/IEEE 802.15.4, which is an emerging standard for wireless sensor networks and then compare its energy efficiency with the packet size chosen for our algorithm.

  13. A security analysis of the 802.11s wireless mesh network routing protocol and its secure routing protocols.

    Science.gov (United States)

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

    2013-09-02

    Wireless mesh networks (WMNs) can act as a scalable backbone by connecting separate sensor networks and even by connecting WMNs to a wired network. The Hybrid Wireless Mesh Protocol (HWMP) is the default routing protocol for the 802.11s WMN. The routing protocol is one of the most important parts of the network, and it requires protection, especially in the wireless environment. The existing security protocols, such as the Broadcast Integrity Protocol (BIP), Counter with cipher block chaining message authentication code protocol (CCMP), Secure Hybrid Wireless Mesh Protocol (SHWMP), Identity Based Cryptography HWMP (IBC-HWMP), Elliptic Curve Digital Signature Algorithm HWMP (ECDSA-HWMP), and Watchdog-HWMP aim to protect the HWMP frames. In this paper, we have analyzed the vulnerabilities of the HWMP and developed security requirements to protect these identified vulnerabilities. We applied the security requirements to analyze the existing secure schemes for HWMP. The results of our analysis indicate that none of these protocols is able to satisfy all of the security requirements. We also present a quantitative complexity comparison among the protocols and an example of a security scheme for HWMP to demonstrate how the result of our research can be utilized. Our research results thus provide a tool for designing secure schemes for the HWMP.

  14. DESAIN ALGORITMA DAN SIMULASI ROUTING UNTUK GATEWAY AD HOC WIRELESS NETWORKS

    Directory of Open Access Journals (Sweden)

    Nixson Meok

    2009-12-01

    Full Text Available   Routing protocol to the wireless ad hoc networks is very needed in the communication process between some terminals, to send the data packet through one or several node(s to the destination address where the network typology is always changing. Many previous works that discussed about routing ad hoc both for manet (mobile ad hoc networks and wireless networks, but the emphasis have more focus on comparing the performance of several routing ad hoc. While in this work, there is a bulding of routing algorithm model to gateway in land to the nodes that analogized as a boat that move on the sea. With the assumption that the communication inter terminals to radio band of Very High Frequency, thus algorithm that built in the simulation based on the range gap of the HF frequency. The result of this simulation will be developed as the platform to implement the service development of multiuser communication

  15. Joint Channel Assignment and Routing in Multiradio Multichannel Wireless Mesh Networks: Design Considerations and Approaches

    Directory of Open Access Journals (Sweden)

    Omar M. Zakaria

    2016-01-01

    Full Text Available Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.

  16. Performance of Implementation IBR-DTN and Batman-Adv Routing Protocol in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Herman Yuliandoko

    2016-03-01

    Full Text Available Wireless mesh networks is a network which has high mobility and flexibility network. In Wireless mesh networks nodes are free to move and able to automatically build a network connection with other nodes. High mobility, heterogeneous condition and intermittent network connectivity cause data packets drop during wireless communication and it becomes a problem in the wireless mesh networks. This condition can happen because wireless mesh networks use connectionless networking type such as IP protocol which it is not tolerant to delay. To solve this condition it is needed a technology to keep data packets when the network is disconnect. Delay tolerant technology is a technology that provides store and forward mechanism and it can prevent packet data dropping during communication. In our research, we proposed a test bed wireless mesh networks implementation by using proactive routing protocol and combining with delay tolerant technology. We used Batman-adv routing protocol and IBR-DTN on our research. We measured some particular performance aspect of networking such as packet loss, delay, and throughput of the network. We identified that delay tolerant could keep packet data from dropping better than current wireless mesh networks in the intermittent network condition. We also proved that IBR-DTN and Batman-adv could run together on the wireless mesh networks. In The experiment throughput test result of IBR-DTN was higher than Current TCP on the LoS (Line of Side and on environment with obstacle. Keywords: Delay Tolerant, IBR-DTN, Wireless Mesh, Batman-adv, Performance

  17. An Energy-Aware Routing Protocol for Query-Based Applications in Wireless Sensor Networks

    OpenAIRE

    Ehsan Ahvar; Shohreh Ahvar; Gyu Myoung Lee; Noel Crespi

    2014-01-01

    Wireless sensor network (WSN) typically has energy consumption restriction. Designing energy-aware routing protocol can significantly reduce energy consumption in WSNs. Energy-aware routing protocols can be classified into two categories, energy savers and energy balancers. Energy saving protocols are used to minimize the overall energy consumed by a WSN, while energy balancing protocols attempt to efficiently distribute the consumption of energy throughout the network. In general terms, ener...

  18. Challenge: How Effective is Routing for Wireless Networking

    Science.gov (United States)

    2017-03-03

    variations of the envi- ronment or atmosphere will induce a “transition region” in which the probability of packet error increases from 0 to 1. For...Taoka et al., “Scenarios for 5g mobile and wireless communications: the vision of the metis project,” Communications Magazine , IEEE, vol. 52, no. 5

  19. Energy Efficient Routing in Wireless Sensor Networks based on Ant ...

    African Journals Online (AJOL)

    PROF. O. E. OSUAGWU

    2013-09-01

    Sep 1, 2013 ... Ant Colony Optimization, a swarm intelligence based optimization technique, has been successfully used in network routing. In this paper, we introduce a heuristic way to reduce energy consumption in WSNs routing process using Ant Colony Optimization. We introduce three Ant Colony Optimization ...

  20. ENERGY EFFICIENT ROUTING PROTOCOLS FOR WIRELESS AD HOC NETWORKS – A SURVEY

    Directory of Open Access Journals (Sweden)

    K. Sankar

    2012-06-01

    Full Text Available Reducing energy consumption, primarily with the goal of extending the lifetime of battery-powered devices, has emerged as a fundamental challenge in wireless communication. The performance of the medium access control (MAC scheme not only has a fairly significant end-result on the behaviour of the routing approach employed, but also on the energy consumption of the wireless network interface card (NIC. We investigate the inadequacies of the MAC schemes designed for ad hoc wireless networks in the context of power awareness herein. The topology changes due to uncontrollable factors such as node mobility, weather, interference, noise, as well as on controllable parameters such as transmission power and antenna direction results in significant amount of energy loss. Controlling rapid topology changes by minimizing the maximum transmission power used in ad hoc wireless networks, while still maintaining networks connectivity can prolong battery life and hence network lifetime considerably. In addition, we systematically explore the potential energy consumption pitfalls of non–power-based and power based routing schemes. We suggest a thorough energy-based performance survey of energy aware routing protocols for wireless mobile ad-hoc networks. We also present the statistical performance metrics measured by our simulations.

  1. Novel Congestion-Free Alternate Routing Path Scheme using Stackelberg Game Theory Model in Wireless Networks

    Directory of Open Access Journals (Sweden)

    P. Chitra

    2017-04-01

    Full Text Available Recently, wireless network technologies were designed for most of the applications. Congestion raised in the wireless network degrades the performance and reduces the throughput. Congestion-free network is quit essen- tial in the transport layer to prevent performance degradation in a wireless network. Game theory is a branch of applied mathematics and applied sciences that used in wireless network, political science, biology, computer science, philosophy and economics. e great challenges of wireless network are their congestion by various factors. E ective congestion-free alternate path routing is pretty essential to increase network performance. Stackelberg game theory model is currently employed as an e ective tool to design and formulate conges- tion issues in wireless networks. is work uses a Stackelberg game to design alternate path model to avoid congestion. In this game, leaders and followers are selected to select an alternate routing path. e correlated equilibrium is used in Stackelberg game for making better decision between non-cooperation and cooperation. Congestion was continuously monitored to increase the throughput in the network. Simulation results show that the proposed scheme could extensively improve the network performance by reducing congestion with the help of Stackelberg game and thereby enhance throughput.

  2. Method and apparatus to enhance routing protocols in wireless mesh networks

    DEFF Research Database (Denmark)

    2014-01-01

    A protocol for use in wireless mesh networks (PlayNCool) uses helper nodes to improve data flow in the network. The protocol is compatible with traditional mesh network routing algorithms. Techniques, systems, devices, and circuits for implementing the protocol are described....

  3. A Neural Networks-Based Hybrid Routing Protocol for Wireless Mesh Networks

    Science.gov (United States)

    Kojić, Nenad; Reljin, Irini; Reljin, Branimir

    2012-01-01

    The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic—i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance. PMID:22969360

  4. Routing in Mobile Wireless Sensor Networks: A Leader-Based Approach

    Directory of Open Access Journals (Sweden)

    Unai Burgos

    2017-07-01

    Full Text Available This paper presents a leader-based approach to routing in Mobile Wireless Sensor Networks (MWSN. Using local information from neighbour nodes, a leader election mechanism maintains a spanning tree in order to provide the necessary adaptations for efficient routing upon the connectivity changes resulting from the mobility of sensors or sink nodes. We present two protocols following the leader election approach, which have been implemented using Castalia and OMNeT++. The protocols have been evaluated, besides other reference MWSN routing protocols, to analyse the impact of network size and node velocity on performance, which has demonstrated the validity of our approach.

  5. Routing in Mobile Wireless Sensor Networks: A Leader-Based Approach.

    Science.gov (United States)

    Burgos, Unai; Amozarrain, Ugaitz; Gómez-Calzado, Carlos; Lafuente, Alberto

    2017-07-07

    This paper presents a leader-based approach to routing in Mobile Wireless Sensor Networks (MWSN). Using local information from neighbour nodes, a leader election mechanism maintains a spanning tree in order to provide the necessary adaptations for efficient routing upon the connectivity changes resulting from the mobility of sensors or sink nodes. We present two protocols following the leader election approach, which have been implemented using Castalia and OMNeT++. The protocols have been evaluated, besides other reference MWSN routing protocols, to analyse the impact of network size and node velocity on performance, which has demonstrated the validity of our approach.

  6. Key management schemes using routing information frames in secure wireless sensor networks

    Science.gov (United States)

    Kamaev, V. A.; Finogeev, A. G.; Finogeev, A. A.; Parygin, D. S.

    2017-01-01

    The article considers the problems and objectives of key management for data encryption in wireless sensor networks (WSN) of SCADA systems. The structure of the key information in the ZigBee network and methods of keys obtaining are discussed. The use of a hybrid key management schemes is most suitable for WSN. The session symmetric key is used to encrypt the sensor data, asymmetric keys are used to encrypt the session key transmitted from the routing information. Three algorithms of hybrid key management using routing information frames determined by routing methods and the WSN topology are presented.

  7. Application of Game Theory Approaches in Routing Protocols for Wireless Networks

    Science.gov (United States)

    Javidi, Mohammad M.; Aliahmadipour, Laya

    2011-09-01

    An important and essential issue for wireless networks is routing protocol design that is a major technical challenge due to the function of the network. Game theory is a powerful mathematical tool that analyzes the strategic interactions among multiple decision makers and the results of researches show that applied game theory in routing protocol lead to improvement the network performance through reduce overhead and motivates selfish nodes to collaborate in the network. This paper presents a review and comparison for typical representatives of routing protocols designed that applied game theory approaches for various wireless networks such as ad hoc networks, mobile ad hoc networks and sensor networks that all of them lead to improve the network performance.

  8. Adaptive Reliable Routing Based on Cluster Hierarchy for Wireless Multimedia Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chen Min

    2010-01-01

    Full Text Available As a multimedia information acquisition and processing method, wireless multimedia sensor network(WMSN has great application potential in military and civilian areas. Compared with traditional wireless sensor network, the routing design of WMSN should obtain more attention on the quality of transmission. This paper proposes an adaptive reliable routing based on clustering hierarchy named ARCH, which includes energy prediction and power allocation mechanism. To obtain a better performance, the cluster structure is formed based on cellular topology. The introduced prediction mechanism makes the sensor nodes predict the remaining energy of other nodes, which dramatically reduces the overall information needed for energy balancing. ARCH can dynamically balance the energy consumption of nodes based on the predicted results provided by power allocation. The simulation results prove the efficiency of the proposed ARCH routing.

  9. EE-MRP: Energy-Efficient Multistage Routing Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Muhammad Kamran Khan

    2018-01-01

    Full Text Available Wireless sensor networks (WSNs have captivated substantial attention from both industrial and academic research in the last few years. The major factor behind the research efforts in that field is their vast range of applications which include surveillance systems, military operations, health care, environment event monitoring, and human safety. However, sensor nodes are low potential and energy constrained devices; therefore, energy-efficient routing protocol is the foremost concern. In this paper, an energy-efficient routing protocol for wireless sensor networks is proposed. Our protocol consists of a routing algorithm for the transmission of data, cluster head selection algorithm, and a scheme for the formation of clusters. On the basis of energy analysis of the existing routing protocols, a multistage data transmission mechanism is proposed. An efficient cluster head selection algorithm is adopted and unnecessary frequency of reclustering is exterminated. Static clustering is used for efficient selection of cluster heads. The performance and energy efficiency of our proposed routing protocol are assessed by the comparison of the existing routing protocols on a simulation platform. On the basis of simulation results, it is observed that our proposed routing protocol (EE-MRP has performed well in terms of overall network lifetime, throughput, and energy efficiency.

  10. Performance Analysis of On-Demand Routing Protocols in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Arafatur RAHMAN

    2009-01-01

    Full Text Available Wireless Mesh Networks (WMNs have recently gained a lot of popularity due to their rapid deployment and instant communication capabilities. WMNs are dynamically self-organizing, self-configuring and self-healing with the nodes in the network automatically establishing an adiej hoc network and preserving the mesh connectivity. Designing a routing protocol for WMNs requires several aspects to consider, such as wireless networks, fixed applications, mobile applications, scalability, better performance metrics, efficient routing within infrastructure, load balancing, throughput enhancement, interference, robustness etc. To support communication, various routing protocols are designed for various networks (e.g. ad hoc, sensor, wired etc.. However, all these protocols are not suitable for WMNs, because of the architectural differences among the networks. In this paper, a detailed simulation based performance study and analysis is performed on the reactive routing protocols to verify the suitability of these protocols over such kind of networks. Ad Hoc On-Demand Distance Vector (AODV, Dynamic Source Routing (DSR and Dynamic MANET On-demand (DYMO routing protocol are considered as the representative of reactive routing protocols. The performance differentials are investigated using varying traffic load and number of source. Based on the simulation results, how the performance of each protocol can be improved is also recommended.

  11. 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.

  12. A Survey of Routing Issues and Associated Protocols in Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Muhammad Khalid

    2017-01-01

    Full Text Available Underwater wireless sensor networks are a newly emerging wireless technology in which small size sensors with limited energy and limited memory and bandwidth are deployed in deep sea water and various monitoring operations like tactical surveillance, environmental monitoring, and data collection are performed through these tiny sensors. Underwater wireless sensor networks are used for the exploration of underwater resources, oceanographic data collection, flood or disaster prevention, tactical surveillance systems, and unmanned underwater vehicles. Sensor nodes consist of a small memory, a central processing unit, and an antenna. Underwater networks are much different from terrestrial sensor networks as radio waves cannot be used in underwater wireless sensor networks. Acoustic channels are used for communication in deep sea water. Acoustic signals have many limitations, such as limited bandwidth, higher end-to-end delay, network path loss, higher propagation delay, and dynamic topology. Usually, these limitations result in higher energy consumption with a smaller number of packets delivered. The main aim nowadays is to operate sensor nodes having a smaller battery for a longer time in the network. This survey has discussed the state-of-the-art localization based and localization-free routing protocols. Routing associated issues in the area of underwater wireless sensor networks have also been discussed.

  13. Cross-Layer Support for Energy Efficient Routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    N. Chilamkurti

    2009-01-01

    Full Text Available The Dynamic Source Routing (DSR algorithm computes a new route when packet loss occurs. DSR does not have an in-built mechanism to determine whether the packet loss was the result of congestion or node failure causing DSR to compute a new route. This leads to inefficient energy utilization when DSR is used in wireless sensor networks. In this work, we exploit cross-layer optimization techniques that extend DSR to improve its routing energy efficiency by minimizing the frequency of recomputed routes. Our proposed approach enables DSR to initiate a route discovery only when link failure occurs. We conducted extensive simulations to evaluate the performance of our proposed cross-layer DSR routing protocol. The simulation results obtained with our extended DSR routing protocol show that the frequency with which new routes are recomputed is 50% lower compared with the traditional DSR protocol. This improvement is attributed to the fact that, with our proposed cross-layer DSR, we distinguish between congestion and link failure conditions, and new routes are recalculated only for the latter.

  14. A novel Smart Routing Protocol for remote health monitoring in Medical Wireless Networks.

    Science.gov (United States)

    Sundararajan, T V P; Sumithra, M G; Maheswar, R

    2014-01-01

    In a Medical Wireless Network (MWN), sensors constantly monitor patient's physiological condition and movement. Inter-MWN communications are set up between the Patient Server and one or more Centralized Coordinators. However, MWNs require protocols with little energy consumption and the self-organizing attribute perceived in ad-hoc networks. The proposed Smart Routing Protocol (SRP) selects only the nodes with a higher residual energy and lower traffic density for routing. This approach enhances cooperation among the nodes of a Mobile Ad Hoc Network. Consequently, SRP produces better results than the existing protocols, namely Conditional Min-Max Battery Cost Routing, Min-Max Battery Cost Routing and AdHoc On-demand Distance Vector in terms of network parameters. The performance of the erstwhile schemes for routing protocols is evaluated using the network simulator Qualnet v 4.5.

  15. A survey on temperature-aware routing protocols in wireless body sensor networks.

    Science.gov (United States)

    Oey, Christian Henry Wijaya; Moh, Sangman

    2013-08-02

    The rapid growth of the elderly population in the world and the rising cost of healthcare impose big issues for healthcare and medical monitoring. A Wireless Body Sensor Network (WBSN) is comprised of small sensor nodes attached inside, on or around a human body, the main purpose of which is to monitor the functions and surroundings of the human body. However, the heat generated by the node's circuitry and antenna could cause damage to the human tissue. Therefore, in designing a routing protocol for WBSNs, it is important to reduce the heat by incorporating temperature into the routing metric. The main contribution of this paper is to survey existing temperature-aware routing protocols that have been proposed for WBSNs. In this paper, we present a brief overview of WBSNs, review the existing routing protocols comparatively and discuss challenging open issues in the design of routing protocols.

  16. A comparative study of routing protocols of heterogeneous wireless sensor networks.

    Science.gov (United States)

    Han, Guangjie; Jiang, Xu; Qian, Aihua; Rodrigues, Joel J P C; Cheng, Long

    2014-01-01

    Recently, heterogeneous wireless sensor network (HWSN) routing protocols have drawn more and more attention. Various HWSN routing protocols have been proposed to improve the performance of HWSNs. Among these protocols, hierarchical HWSN routing protocols can improve the performance of the network significantly. In this paper, we will evaluate three hierarchical HWSN protocols proposed recently--EDFCM, MCR, and EEPCA--together with two previous classical routing protocols--LEACH and SEP. We mainly focus on the round of the first node dies (also called the stable period) and the number of packets sent to sink, which is an important aspect to evaluate the monitoring ability of a protocol. We conduct a lot of experiments and simulations on Matlab to analyze the performance of the five routing protocols.

  17. A Survey on Temperature-Aware Routing Protocols in Wireless Body Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sangman Moh

    2013-08-01

    Full Text Available The rapid growth of the elderly population in the world and the rising cost of healthcare impose big issues for healthcare and medical monitoring. A Wireless Body Sensor Network (WBSN is comprised of small sensor nodes attached inside, on or around a human body, the main purpose of which is to monitor the functions and surroundings of the human body. However, the heat generated by the node’s circuitry and antenna could cause damage to the human tissue. Therefore, in designing a routing protocol for WBSNs, it is important to reduce the heat by incorporating temperature into the routing metric. The main contribution of this paper is to survey existing temperature-aware routing protocols that have been proposed for WBSNs. In this paper, we present a brief overview of WBSNs, review the existing routing protocols comparatively and discuss challenging open issues in the design of routing protocols.

  18. 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.

  19. A Novel Smart Routing Protocol for Remote Health Monitoring in Medical Wireless Networks

    Directory of Open Access Journals (Sweden)

    T. V. P. Sundararajan

    2014-01-01

    Full Text Available In a Medical Wireless Network (MWN, sensors constantly monitor patient's physiological condition and movement. Inter-MWN communications are set up between the Patient Server and one or more Centralized Coordinators. However, MWNs require protocols with little energy consumption and the self-organizing attribute perceived in ad-hoc networks. The proposed Smart Routing Protocol (SRP selects only the nodes with a higher residual energy and lower traffic density for routing. This approach enhances cooperation among the nodes of a Mobile Ad Hoc Network. Consequently, SRP produces better results than the existing protocols, namely Conditional Min-Max Battery Cost Routing, Min-Max Battery Cost Routing and AdHoc On-demand Distance Vector in terms of network parameters. The performance of the erstwhile schemes for routing protocols is evaluated using the network simulator Qualnet v 4.5.

  20. A survey on routing protocols for large-scale wireless sensor networks.

    Science.gov (United States)

    Li, Changle; Zhang, Hanxiao; Hao, Binbin; Li, Jiandong

    2011-01-01

    With the advances in micro-electronics, wireless sensor devices have been made much smaller and more integrated, and large-scale wireless sensor networks (WSNs) based the cooperation among the significant amount of nodes have become a hot topic. "Large-scale" means mainly large area or high density of a network. Accordingly the routing protocols must scale well to the network scope extension and node density increases. A sensor node is normally energy-limited and cannot be recharged, and thus its energy consumption has a quite significant effect on the scalability of the protocol. To the best of our knowledge, currently the mainstream methods to solve the energy problem in large-scale WSNs are the hierarchical routing protocols. In a hierarchical routing protocol, all the nodes are divided into several groups with different assignment levels. The nodes within the high level are responsible for data aggregation and management work, and the low level nodes for sensing their surroundings and collecting information. The hierarchical routing protocols are proved to be more energy-efficient than flat ones in which all the nodes play the same role, especially in terms of the data aggregation and the flooding of the control packets. With focus on the hierarchical structure, in this paper we provide an insight into routing protocols designed specifically for large-scale WSNs. According to the different objectives, the protocols are generally classified based on different criteria such as control overhead reduction, energy consumption mitigation and energy balance. In order to gain a comprehensive understanding of each protocol, we highlight their innovative ideas, describe the underlying principles in detail and analyze their advantages and disadvantages. Moreover a comparison of each routing protocol is conducted to demonstrate the differences between the protocols in terms of message complexity, memory requirements, localization, data aggregation, clustering manner and

  1. Lightweight context aware routing in wireless sensor networks for environments

    International Nuclear Information System (INIS)

    Aijaz, S.

    2015-01-01

    Design and implementation of a WSN (Wireless Sensor Network) that can efficiently work for a longer time period must include identification of the deployment environment context and to conform to the behavior of the sensor nodes. The context information when treated with evaluation factor becomes a process of context awareness and the evaluation factor is called the context attribute. In this paper, we consider the context factor of energy. The paper identifies analyses and evaluates efficiency of two when used in a context aware environment. Furthermore, the study also highlights the strengths and weaknesses of sensor SPIN (Sensor Protocol for Information via Negotiation) and LEACH (Low Energy Adaptive Clustering Hierarchy) protocols with respect to the support for WSN with heavy network traffic conditions. The performance has been evaluated in terms of energy efficiency, data packet transmission, network status, data management, reliability, etc. (author)

  2. An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks

    Science.gov (United States)

    Abba, Sani; Lee, Jeong-A

    2015-01-01

    We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network. PMID:26295236

  3. An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks.

    Science.gov (United States)

    Abba, Sani; Lee, Jeong-A

    2015-08-18

    We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network.

  4. 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.

  5. Energy efficient routing protocols for wireless sensor networks: comparison and future directions

    Directory of Open Access Journals (Sweden)

    Loganathan Murukesan

    2017-01-01

    Full Text Available Wireless sensor network consists of nodes with limited resources. Hence, it is important to design protocols or algorithms which increases energy efficiency in order to improve the network lifetime. In this paper, techniques used in the network layer (routing of the internet protocol stack to achieve energy efficiency are reviewed. Usually, the routing protocols are classified into four main schemes: (1 Network Structure, (2 Communication Model, (3 Topology Based, and (4 Reliable Routing. In this work, only network structure based routing protocols are reviewed due to the page constraint. Besides, this type of protocols are much popular among the researchers since they are fairly simple to implement and produce good results as presented in this paper. Also, the pros and cons of each protocols are presented. Finally, the paper concludes with possible further research directions.

  6. Interference Aware Routing for Minimum Frame Length Schedules in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Katerina Papadaki

    2008-10-01

    Full Text Available The focus of this paper is on routing in wireless mesh networks (WMNs that results in spatial TDMA (STDMA schedules with minimum frame length. In particular, the emphasis is on spanning tree construction; and we formulate the joint routing, power control, and scheduling problem as a mixedinteger linear program (MILP. Since this is an 𝒩𝒫-complete problem, we propose a low-complexity iterative pruning-based routing scheme that utilizes scheduling information to construct the spanning tree. A randomized version of this scheme is also discussed and numerical investigations reveal that the proposed iterative pruning algorithms outperform previously proposed routing schemes that aim to minimize the transmitted power or interference produced in the network without explicitly taking into account scheduling decisions.

  7. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee

    2011-01-01

    protocols, and the energy model for transmission. In this paper, we tackle the routing challenge for maximum lifetime of the sensor network. We introduce a novel linear programming approach to the maximum lifetime routing problem. To the best of our knowledge, this is the first mathematical programming......In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize network lifetime. In fact, lifetime depends on many parameters: the topology of the sensor network, the data aggregation regime in the network, the channel access schemes, the routing...... of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings...

  8. Performance Analysis of AODV Routing Protocol for Wireless Sensor Network based Smart Metering

    International Nuclear Information System (INIS)

    Farooq, Hasan; Jung, Low Tang

    2013-01-01

    Today no one can deny the need for Smart Grid and it is being considered as of utmost importance to upgrade outdated electric infrastructure to cope with the ever increasing electric load demand. Wireless Sensor Network (WSN) is considered a promising candidate for internetworking of smart meters with the gateway using mesh topology. This paper investigates the performance of AODV routing protocol for WSN based smart metering deployment. Three case studies are presented to analyze its performance based on four metrics of (i) Packet Delivery Ratio, (ii) Average Energy Consumption of Nodes (iii) Average End-End Delay and (iv) Normalized Routing Load.

  9. Comparison of MANET routing protocols using a scaled indoor wireless grid

    CSIR Research Space (South Africa)

    Johnson, DL

    2008-04-01

    Full Text Available . It then specifically compares hop count, routing traffic overhead, throughput, delay and packet loss for three protocols which are listed by the IETF MANET working group. These are AODV, OLSR and DYMO Index Terms—ad-hoc, 802.11, test bed I. INTRODUCTION... In order to establish the baseline for performance of the wireless nodes in the grid, it is useful to remove any effects of routing and establish the best possible multi hop throughput and delay between the nodes. Figure 13 shows a string of pearls...

  10. A NOVEL RESOURCE CONSTRAINT SECURE(RCS ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORK

    Directory of Open Access Journals (Sweden)

    R. GEETHA

    2017-02-01

    Full Text Available Geographic routing protocols are the most preferred routing protocols for Wireless Sensor Networks (WSN since they rely on geographic position information. Hence we propose geography based Resource Constraint Secure routing (RCS protocol. The existing routing protocol named Cost Aware SEcure Routing (CASER allows messages to be transmitted using random walking routing strategy. In the Random walking method, there is a chance of choosing low energy node as a relay node. RCS protocol overcomes this by transmitting the data via energy aware route only and it provides authentication by using Modified ElGammal Signature (MES scheme on Elliptic curve algorithm. For security purposes, the content of each message can also be encrypted by using a symmetric key encryption technique and decoded at the sink node by knowing the same secret key used by the source. So, unauthenticated person cannot access the original data. Therefore the protocol ensures a secure message delivery option to maximize the message delivery ratio under adversarial attacks. The performance evaluation results show that RCS performs better than CASER with respect to Packet Delivery Ratio, Energy Balance Factor and End-to-End Delay, Throughput and Routing overhead.

  11. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks

    Science.gov (United States)

    Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A.; Al-Muhtadi, Jalal; Rodrigues, Joel J. P. C.; Khalil, Mohammed Sayim; Ali Ahmed, Adel

    2016-01-01

    The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks. PMID:27043572

  12. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks.

    Science.gov (United States)

    Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A; Al-Muhtadi, Jalal; Rodrigues, Joel J P C; Khalil, Mohammed Sayim; Ali Ahmed, Adel

    2016-03-31

    The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks.

  13. On Channel-Discontinuity-Constraint Routing in Wireless Networks.

    Science.gov (United States)

    Sankararaman, Swaminathan; Efrat, Alon; Ramasubramanian, Srinivasan; Agarwal, Pankaj K

    2014-02-01

    Multi-channel wireless networks are increasingly deployed as infrastructure networks, e.g. in metro areas. Network nodes frequently employ directional antennas to improve spatial throughput. In such networks, between two nodes, it is of interest to compute a path with a channel assignment for the links such that the path and link bandwidths are the same. This is achieved when any two consecutive links are assigned different channels, termed as "Channel-Discontinuity-Constraint" (CDC). CDC-paths are also useful in TDMA systems, where, preferably, consecutive links are assigned different time-slots. In the first part of this paper, we develop a t -spanner for CDC-paths using spatial properties; a sub-network containing O ( n/θ ) links, for any θ > 0, such that CDC-paths increase in cost by at most a factor t = (1-2 sin ( θ/ 2)) -2 . We propose a novel distributed algorithm to compute the spanner using an expected number of O ( n log n ) fixed-size messages. In the second part, we present a distributed algorithm to find minimum-cost CDC-paths between two nodes using O ( n 2 ) fixed-size messages, by developing an extension of Edmonds' algorithm for minimum-cost perfect matching. In a centralized implementation, our algorithm runs in O ( n 2 ) time improving the previous best algorithm which requires O ( n 3 ) running time. Moreover, this running time improves to O ( n/θ ) when used in conjunction with the spanner developed.

  14. Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

    Science.gov (United States)

    Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

    2015-01-01

    Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

  15. An improved modified LEACH-C algorithm for energy efficient routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Amit Mansukh lal Parmar

    2016-02-01

    Full Text Available Wireless Sensor Networks (WSN is mainly characterized by its limited power supply. Hence the need for Energy efficient infrastructure is becoming increasingly more important since it impact in network lifetime. Here the focus of this paper on Hierarchy clustering because multi-hope short range communication between wireless sensor nodes is energy efficient compared to Single-hope long range communication. In Hierarchy clustering, there are many Protocols but this paper talk about the well-known Low-Energy Adaptive Clustering Hierarchy (LEACH[1].Centralized Low-Energy Adaptive Clustering Hierarchy (LEACH-C and Advanced Low-Energy Adaptive Clustering Hierarchy(ALEACH are energy efficient clustering routing protocol and they are belonging to hierarchy routing. In this paper we proposed Modified LEACH-C to upgrade the execution of existing Leach-C in such sort of Topology where Leach-C not performs so well. By Applying Method of Distance calculation between CH (cluster-head to Member node and BS (base-station to Member node. Making non-overlapping cluster using assigning proper ID while creating clusters. This makes the routing protocol more energy effective and delays life-time of a wireless sensor network. Simulation results demonstrate that Modified LEACH-C enhances network life-time contrasted with LEACH-C algorithm.

  16. Energy Efficiency Performance Improvements for Ant-Based Routing Algorithm in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Adamu Murtala Zungeru

    2013-01-01

    Full Text Available The main problem for event gathering in wireless sensor networks (WSNs is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR algorithm, based on the ant colony optimization (ACO metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1 a new scheme to intelligently initialize the routing tables giving priority to neighboring nodes that simultaneously could be the destination, (2 intelligent update of routing tables in case of a node or link failure, and (3 reducing the flooding ability of ants for congestion control. The energy efficiency improvements are significant particularly for dynamic routing environments. Experimental results using the RMASE simulation environment show that the proposed method increases the energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR without incurring a significant increase in complexity. The method is also compared and found to also outperform other swarm-based routing protocols such as sensor-driven and cost-aware ant routing (SC and Beesensor.

  17. Speedy routing recovery protocol for large failure tolerance in wireless sensor networks.

    Science.gov (United States)

    Lee, Joa-Hyoung; Jung, In-Bum

    2010-01-01

    Wireless sensor networks are expected to play an increasingly important role in data collection in hazardous areas. However, the physical fragility of a sensor node makes reliable routing in hazardous areas a challenging problem. Because several sensor nodes in a hazardous area could be damaged simultaneously, the network should be able to recover routing after node failures over large areas. Many routing protocols take single-node failure recovery into account, but it is difficult for these protocols to recover the routing after large-scale failures. In this paper, we propose a routing protocol, referred to as ARF (Adaptive routing protocol for fast Recovery from large-scale Failure), to recover a network quickly after failures over large areas. ARF detects failures by counting the packet losses from parent nodes, and upon failure detection, it decreases the routing interval to notify the neighbor nodes of the failure. Our experimental results indicate that ARF could provide recovery from large-area failures quickly with less packets and energy consumption than previous protocols.

  18. A Performance Study of LEACH and Direct Diffusion Routing Protocols in Wireless Sensor Network

    International Nuclear Information System (INIS)

    Fakher, S.; Sharshar, K.; Moawad, M.I.; Shokair, M.

    2016-01-01

    The Wireless Sensor Network (WSN) is composed of a large number of sensor nodes with limited computation communication, and battery facilities. One of the common applications of this network is environment monitoring through sensing motion, measuring temperature, humidity and radiation. One of the basic activities in WSN is data gathering which represents a great challenge. Many routing protocols are proposed for that network to collect and aggregate the data. The most popular ones are hierarchy and data centric routing protocols. The main goal of this study is to identify the most preferable routing protocol, to be used in each mobility model. This paper studies the performance of LEACH (Low Energy Adaptive Clustering Hierarchy) from hierarchy routing protocol and direct diffusion from data centric routing protocol which is not clarified until now. Moreover, a comparison between LEACH and direct diffusion protocol using NS2 simulator will be made, and an analysis of these protocols will be conducted. The comparison includes packet delivery ratio, throughput, average energy ratio, average delay, network lifetime, and routing overhead. The performance is evaluated by varying the number of sensor nodes under three mobility models Reference Point Group Mobility Model (RPGM), Manhattan and random waypoint mobility model. Simulation results show that LEACH routing protocol has a good performance in RPGM and Manhattan than random waypoint mobility model. Direct diffusion has a good performance in random waypoint mobility model than in RPGM and Manhattan mobility model

  19. La-CTP: Loop-Aware Routing for Energy-Harvesting Wireless Sensor Networks.

    Science.gov (United States)

    Sun, Guodong; Shang, Xinna; Zuo, Yan

    2018-02-02

    In emerging energy-harvesting wireless sensor networks (EH-WSN), the sensor nodes can harvest environmental energy to drive their operation, releasing the user's burden in terms of frequent battery replacement, and even enabling perpetual sensing systems. In EH-WSN applications, usually, the node in energy-harvesting or recharging state has to stop working until it completes the energy replenishment. However, such temporary departures of recharging nodes severely impact the packet routing, and one immediate result is the routing loop problem. Controlling loops in connectivity-intermittent EH-WSN in an efficient way is a big challenge in practice, and so far, users still lack of effective and practicable routing protocols with loop handling. Based on the Collection Tree Protocol (CTP) widely used in traditional wireless sensor networks, this paper proposes a loop-aware routing protocol for real-world EH-WSNs, called La-CTP, which involves a new parent updating metric and a proactive, adaptive beaconing scheme to effectively suppress the occurrence of loops and unlock unavoidable loops, respectively. We constructed a 100-node testbed to evaluate La-CTP, and the experimental results showed its efficacy and efficiency.

  20. A game theory-based obstacle avoidance routing protocol for wireless sensor networks.

    Science.gov (United States)

    Guan, Xin; Wu, Huayang; Bi, Shujun

    2011-01-01

    The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

  1. A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Shujun Bi

    2011-09-01

    Full Text Available The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

  2. Probabilistic Location-based Routing Protocol for Mobile Wireless Sensor Networks with Intermittent Communication

    Directory of Open Access Journals (Sweden)

    Sho KUMAGAI

    2015-02-01

    Full Text Available In a sensor network, sensor data messages reach the nearest stationary sink node connected to the Internet by wireless multihop transmissions. Recently, various mobile sensors are available due to advances of robotics technologies and communication technologies. A location based message-by-message routing protocol, such as Geographic Distance Routing (GEDIR is suitable for such mobile wireless networks; however, it is required for each mobile wireless sensor node to know the current locations of all its neighbor nodes. On the other hand, various intermittent communication methods for a low power consumption requirement have been proposed for wireless sensor networks. Intermittent Receiver-driven Data Transmission (IRDT is one of the most efficient methods; however, it is difficult to combine the location based routing and the intermittent communication. In order to solve this problem, this paper proposes a probabilistic approach IRDT-GEDIR with the help of one of the solutions of the secretaries problem. Here, each time a neighbor sensor node wakes up from its sleep mode, an intermediate sensor node determines whether it forwards its buffered sensor data messages to it or not based on an estimation of achieved pseudo speed of the messages. Simulation experiments show that IRDT-GEDIR achieves higher pseudo speed of sensor data message transmissions and shorter transmission delay than achieves shorter transmission delay than the two naive combinations of IRDT and GEDIR in sensor networks with mobile sensor nodes and a stationary sink node. In addition, the guideline of the estimated numbers of the neighbor nodes of each intermediate sensor node is provided based on the results of the simulation experiments to apply the probabilistic approach IRDT-GEDIR.

  3. 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

    change dynamically. In this paper, the authors put forward an Evolutionary Mobility aware multi-objective hybrid Routing Protocol for heterogeneous wireless sensor networks (EMRP). EMRP uses two-level hierarchical clustering. EMRP selects the optimal path from source to sink using multiple metrics...... 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......Researchers have faced numerous challenges while designing WSNs and protocols in many applications such as object tracking in military, detection of disastrous events, environment and health monitoring etc. Amongst all sustaining connectivity and capitalizing on the network lifetime is a serious...

  4. Energy neutral protocol based on hierarchical routing techniques for energy harvesting wireless sensor network

    Science.gov (United States)

    Muhammad, Umar B.; Ezugwu, Absalom E.; Ofem, Paulinus O.; Rajamäki, Jyri; Aderemi, Adewumi O.

    2017-06-01

    Recently, researchers in the field of wireless sensor networks have resorted to energy harvesting techniques that allows energy to be harvested from the ambient environment to power sensor nodes. Using such Energy harvesting techniques together with proper routing protocols, an Energy Neutral state can be achieved so that sensor nodes can run perpetually. In this paper, we propose an Energy Neutral LEACH routing protocol which is an extension to the traditional LEACH protocol. The goal of the proposed protocol is to use Gateway node in each cluster so as to reduce the data transmission ranges of cluster head nodes. Simulation results show that the proposed routing protocol achieves a higher throughput and ensure the energy neutral status of the entire network.

  5. An energy-aware routing protocol for query-based applications in wireless sensor networks.

    Science.gov (United States)

    Ahvar, Ehsan; Ahvar, Shohreh; Lee, Gyu Myoung; Crespi, Noel

    2014-01-01

    Wireless sensor network (WSN) typically has energy consumption restriction. Designing energy-aware routing protocol can significantly reduce energy consumption in WSNs. Energy-aware routing protocols can be classified into two categories, energy savers and energy balancers. Energy saving protocols are used to minimize the overall energy consumed by a WSN, while energy balancing protocols attempt to efficiently distribute the consumption of energy throughout the network. In general terms, energy saving protocols are not necessarily good at balancing energy consumption and energy balancing protocols are not always good at reducing energy consumption. In this paper, we propose an energy-aware routing protocol (ERP) for query-based applications in WSNs, which offers a good trade-off between traditional energy balancing and energy saving objectives and supports a soft real time packet delivery. This is achieved by means of fuzzy sets and learning automata techniques along with zonal broadcasting to decrease total energy consumption.

  6. Particle Swarm Optimization and harmony search based clustering and routing in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Veena Anand

    2017-01-01

    Full Text Available Wireless Sensor Networks (WSN has the disadvantage of limited and non-rechargeable energy resource in WSN creates a challenge and led to development of various clustering and routing algorithms. The paper proposes an approach for improving network lifetime by using Particle swarm optimization based clustering and Harmony Search based routing in WSN. So in this paper, global optimal cluster head are selected and Gateway nodes are introduced to decrease the energy consumption of the CH while sending aggregated data to the Base station (BS. Next, the harmony search algorithm based Local Search strategy finds best routing path for gateway nodes to the Base Station. Finally, the proposed algorithm is presented.

  7. 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.

  8. Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Husam Kareem Farhan

    2017-01-01

    Full Text Available Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs. A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorithm that combines the full advantages of both cluster and chain techniques such as CCM (Chain-Cluster based Mixed routing. In this paper, introduce a routing algorithm relying on CCM algorithm called (Enhanced Chain-Cluster based Mixed routing algorithm E-CCM. Simulation results show that E-CCM algorithm improves the performance of CCM algorithm in terms of three performance metrics which are: energy consumption, network lifetime, and (FND and LND. MATLAB program is used to develop and test the simulation process in a computer with the following specifications: windows 7 (32-operating system, core i5, RAM 4 GB, hard 512 GB.

  9. 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.

  10. Topology control of tactical wireless sensor networks using energy efficient zone routing

    Directory of Open Access Journals (Sweden)

    Preetha Thulasiraman

    2016-02-01

    Full Text Available The US Department of Defense (DoD routinely uses wireless sensor networks (WSNs for military tactical communications. Sensor node die-out has a significant impact on the topology of a tactical WSN. This is problematic for military applications where situational data is critical to tactical decision making. To increase the amount of time all sensor nodes remain active within the network and to control the network topology tactically, energy efficient routing mechanisms must be employed. In this paper, we aim to provide realistic insights on the practical advantages and disadvantages of using established routing techniques for tactical WSNs. We investigate the following established routing algorithms: direct routing, minimum transmission energy (MTE, Low Energy Adaptive Cluster Head routing (LEACH, and zone clustering. Based on the node die out statistics observed with these algorithms and the topological impact the node die outs have on the network, we develop a novel, energy efficient zone clustering algorithm called EZone. Via extensive simulations using MATLAB, we analyze the effectiveness of these algorithms on network performance for single and multiple gateway scenarios and show that the EZone algorithm tactically controls the topology of the network, thereby maintaining significant service area coverage when compared to the other routing algorithms.

  11. 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.

  12. A model to improve the routing performance of Cognitive Radio Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Lesiba Morries Kola

    2017-12-01

    Full Text Available The increasing demand for broadband wireless technologies has led to the scarcity, inefficient utilization, and underutilization of the spectrum. The Cognitive Radio (CR technology has emerged as the promising solution which improves the utilization of the spectrum. However, routing is a challenge due to the dynamic nature of the CR networks. The link quality varies in space and time as nodes join and leave the network. The network connectivity is intermittent due to node mobility and the activities of the primary user. The spectrum aware, spectrum agile, and interference aware routing protocols are vital for the sturdiness of the network and efficient utilization of the resources. We propose an interference aware, spectrum aware, and agile extended Weighted Cumulative Expected Transmission Time (xWCETT routing protocol. The protocol integrates the features of the Ad-hoc On-demand Distance Vector (AODV and the weighted cumulative expected transmission time (WCETT routing protocols. The xWCETT was simulated using the Network Simulator 2 and its performance compared with the AODV and the WCETT routing protocols. The xWCETT was evaluated with respect to quality of service related metrics and the results show that it outperformed the AODV and WCETT routing protocols.

  13. The Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic.

    Science.gov (United States)

    Li, Ning; Martínez, José-Fernán; Hernández Díaz, Vicente

    2015-08-10

    Recently, the cross-layer design for the wireless sensor network communication protocol has become more and more important and popular. Considering the disadvantages of the traditional cross-layer routing algorithms, in this paper we propose a new fuzzy logic-based routing algorithm, named the Balanced Cross-layer Fuzzy Logic (BCFL) routing algorithm. In BCFL, we use the cross-layer parameters' dispersion as the fuzzy logic inference system inputs. Moreover, we give each cross-layer parameter a dynamic weight according the value of the dispersion. For getting a balanced solution, the parameter whose dispersion is large will have small weight, and vice versa. In order to compare it with the traditional cross-layer routing algorithms, BCFL is evaluated through extensive simulations. The simulation results show that the new routing algorithm can handle the multiple constraints without increasing the complexity of the algorithm and can achieve the most balanced performance on selecting the next hop relay node. Moreover, the Balanced Cross-layer Fuzzy Logic routing algorithm can adapt to the dynamic changing of the network conditions and topology effectively.

  14. A Tree Based Self-routing Scheme for Mobility Support in Wireless Sensor Networks

    Science.gov (United States)

    Kim, Young-Duk; Yang, Yeon-Mo; Kang, Won-Seok; Kim, Jin-Wook; An, Jinung

    Recently, WSNs (Wireless Sensor Networks) with mobile robot is a growing technology that offer efficient communication services for anytime and anywhere applications. However, the tiny sensor node has very limited network resources due to its low battery power, low data rate, node mobility, and channel interference constraint between neighbors. Thus, in this paper, we proposed a tree based self-routing protocol for autonomous mobile robots based on beacon mode and implemented in real test-bed environments. The proposed scheme offers beacon based real-time scheduling for reliable association process between parent and child nodes. In addition, it supports smooth handover procedure by reducing flooding overhead of control packets. Throughout the performance evaluation by using a real test-bed system and simulation, we illustrate that our proposed scheme demonstrates promising performance for wireless sensor networks with mobile robots.

  15. Routing Topologies of Wireless Sensor Networks for Health Monitoring of a Cultural Heritage Site.

    Science.gov (United States)

    Aparicio, Sofía; Martínez-Garrido, María I; Ranz, Javier; Fort, Rafael; Izquierdo, Miguel Ángel G

    2016-10-19

    This paper provides a performance evaluation of tree and mesh routing topologies of wireless sensor networks (WSNs) in a cultural heritage site. The historical site selected was San Juan Bautista church in Talamanca de Jarama (Madrid, Spain). We report the preliminary analysis required to study the effects of heating in this historical location using WSNs to monitor the temperature and humidity conditions during periods of weeks. To test which routing topology was better for this kind of application, the WSNs were first deployed on the upper floor of the CAEND institute in Arganda del Rey simulating the church deployment, but in the former scenario there was no direct line of sight between the WSN elements. Two parameters were selected to evaluate the performance of the routing topologies of WSNs: the percentage of received messages and the lifetime of the wireless sensor network. To analyze in more detail which topology gave the best performance, other communication parameters were also measured. The tree topology used was the collection tree protocol and the mesh topology was the XMESH provided by MEMSIC (Andover, MA, USA). For the scenarios presented in this paper, it can be concluded that the tree topology lost fewer messages than the mesh topology.

  16. Routing Topologies of Wireless Sensor Networks for Health Monitoring of a Cultural Heritage Site

    Directory of Open Access Journals (Sweden)

    Sofía Aparicio

    2016-10-01

    Full Text Available This paper provides a performance evaluation of tree and mesh routing topologies of wireless sensor networks (WSNs in a cultural heritage site. The historical site selected was San Juan Bautista church in Talamanca de Jarama (Madrid, Spain. We report the preliminary analysis required to study the effects of heating in this historical location using WSNs to monitor the temperature and humidity conditions during periods of weeks. To test which routing topology was better for this kind of application, the WSNs were first deployed on the upper floor of the CAEND institute in Arganda del Rey simulating the church deployment, but in the former scenario there was no direct line of sight between the WSN elements. Two parameters were selected to evaluate the performance of the routing topologies of WSNs: the percentage of received messages and the lifetime of the wireless sensor network. To analyze in more detail which topology gave the best performance, other communication parameters were also measured. The tree topology used was the collection tree protocol and the mesh topology was the XMESH provided by MEMSIC (Andover, MA, USA. For the scenarios presented in this paper, it can be concluded that the tree topology lost fewer messages than the mesh topology.

  17. 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.

  18. A Centralized Energy Efficient Distance Based Routing Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Rohit D. Gawade

    2016-01-01

    Full Text Available Wireless sensor network (WSN typically consists of a large number of low cost wireless sensor nodes which collect and send various messages to a base station (BS. WSN nodes are small battery powered devices having limited energy resources. Replacement of such energy resources is not easy for thousands of nodes as they are inaccessible to users after their deployment. This generates a requirement of energy efficient routing protocol for increasing network lifetime while minimizing energy consumption. Low Energy Adaptive Clustering Hierarchy (LEACH is a widely used classic clustering algorithm in WSNs. In this paper, we propose a Centralized Energy Efficient Distance (CEED based routing protocol to evenly distribute energy dissipation among all sensor nodes. We calculate optimum number of cluster heads based on LEACH’s energy dissipation model. We propose a distributed cluster head selection algorithm based on dissipated energy of a node and its distance to BS. Moreover, we extend our protocol by multihop routing scheme to reduce energy dissipated by nodes located far away from base station. The performance of CEED is compared with other protocols such as LEACH and LEACH with Distance Based Thresholds (LEACH-DT. Simulation results show that CEED is more energy efficient as compared to other protocols. Also it improves the network lifetime and stability period over the other protocols.

  19. 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.

  20. Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Kashif Saleem

    2016-03-01

    Full Text Available The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP involves an artificial immune system (AIS that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2 and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks.

  1. A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks.

    Science.gov (United States)

    Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

    2017-01-01

    Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole.

  2. An Efficient Addressing Scheme and Its Routing Algorithm for a Large-Scale Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Choi Jeonghee

    2008-01-01

    Full Text Available Abstract So far, various addressing and routing algorithms have been extensively studied for wireless sensor networks (WSNs, but many of them were limited to cover less than hundreds of sensor nodes. It is largely due to stringent requirements for fully distributed coordination among sensor nodes, leading to the wasteful use of available address space. As there is a growing need for a large-scale WSN, it will be extremely challenging to support more than thousands of nodes, using existing standard bodies. Moreover, it is highly unlikely to change the existing standards, primarily due to backward compatibility issue. In response, we propose an elegant addressing scheme and its routing algorithm. While maintaining the existing address scheme, it tackles the wastage problem and achieves no additional memory storage during a routing. We also present an adaptive routing algorithm for location-aware applications, using our addressing scheme. Through a series of simulations, we prove that our approach can achieve two times lesser routing time than the existing standard in a ZigBee network.

  3. DCBRP: a deterministic chain-based routing protocol for wireless sensor networks.

    Science.gov (United States)

    Marhoon, Haydar Abdulameer; Mahmuddin, M; Nor, Shahrudin Awang

    2016-01-01

    Wireless sensor networks (WSNs) are a promising area for both researchers and industry because of their various applications The sensor node expends the majority of its energy on communication with other nodes. Therefore, the routing protocol plays an important role in delivering network data while minimizing energy consumption as much as possible. The chain-based routing approach is superior to other approaches. However, chain-based routing protocols still expend substantial energy in the Chain Head (CH) node. In addition, these protocols also have the bottleneck issues. A novel routing protocol which is Deterministic Chain-Based Routing Protocol (DCBRP). DCBRP consists of three mechanisms: Backbone Construction Mechanism, Chain Head Selection (CHS), and the Next Hop Connection Mechanism. The CHS mechanism is presented in detail, and it is evaluated through comparison with the CCM and TSCP using an ns-3 simulator. It show that DCBRP outperforms both CCM and TSCP in terms of end-to-end delay by 19.3 and 65%, respectively, CH energy consumption by 18.3 and 23.0%, respectively, overall energy consumption by 23.7 and 31.4%, respectively, network lifetime by 22 and 38%, respectively, and the energy*delay metric by 44.85 and 77.54%, respectively. DCBRP can be used in any deterministic node deployment applications, such as smart cities or smart agriculture, to reduce energy depletion and prolong the lifetimes of WSNs.

  4. An Efficient Addressing Scheme and Its Routing Algorithm for a Large-Scale Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Yongwan Park

    2008-12-01

    Full Text Available So far, various addressing and routing algorithms have been extensively studied for wireless sensor networks (WSNs, but many of them were limited to cover less than hundreds of sensor nodes. It is largely due to stringent requirements for fully distributed coordination among sensor nodes, leading to the wasteful use of available address space. As there is a growing need for a large-scale WSN, it will be extremely challenging to support more than thousands of nodes, using existing standard bodies. Moreover, it is highly unlikely to change the existing standards, primarily due to backward compatibility issue. In response, we propose an elegant addressing scheme and its routing algorithm. While maintaining the existing address scheme, it tackles the wastage problem and achieves no additional memory storage during a routing. We also present an adaptive routing algorithm for location-aware applications, using our addressing scheme. Through a series of simulations, we prove that our approach can achieve two times lesser routing time than the existing standard in a ZigBee network.

  5. Network Coding to Enhance Standard Routing Protocols in Wireless Mesh Networks

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank

    2013-01-01

    This paper introduces a design and simulation of a locally optimized network coding protocol, called PlayNCool, for wireless mesh networks. PlayN-Cool is easy to implement and compatible with existing routing protocols and devices. This allows the system to gain from network coding capabilities...... linear network coding to increase the usefulness of each transmission from the helpers. This paper focuses on the design details needed to make the system operate in reality and evaluating performance using ns-3 in multi-hop topologies. Our results show that the PlayNCool protocol increases the end...

  6. PlayNCool: Opportunistic Network Coding for Local Optimization of Routing in Wireless Mesh Networks

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

    2013-01-01

    This paper introduces PlayNCool, an opportunistic protocol with local optimization based on network coding to increase the throughput of a wireless mesh network (WMN). PlayNCool aims to enhance current routing protocols by (i) allowing random linear network coding transmissions end-to-end, (ii...... in large scale mesh networks. We show that PlayNCool can provide gains of more than 3x in individual links, which translates into a large end-to-end throughput improvement, and that it provides higher gains when more nodes in the network contend for the channel at the MAC layer, making it particularly...... relevant for dense mesh networks....

  7. Residual energy level based clustering routing protocol for wireless sensor networks

    Science.gov (United States)

    Yuan, Xu; Zhong, Fangming; Chen, Zhikui; Yang, Deli

    2015-12-01

    The wireless sensor networks, which nodes prone to premature death, with unbalanced energy consumption and a short life time, influenced the promotion and application of this technology in internet of things in agriculture. This paper proposes a clustering routing protocol based on the residual energy level (RELCP). RELCP includes three stages: the selection of cluster head, establishment of cluster and data transmission. RELCP considers the remaining energy level and distance to base station, while election of cluster head nodes and data transmitting. Simulation results demonstrate that the protocol can efficiently balance the energy dissipation of all nodes, and prolong the network lifetime.

  8. Joint optimization of physical layer parameters and routing in wireless mesh networks

    KAUST Repository

    Tobagi, Fouad A.

    2010-06-01

    Achieving the best performance in a wireless mesh network requires striking the right balance between the performance of links carrying traffic and the extent of spatial reuse of the wireless medium. The performance of a link depends on its transmit power and data rate as well as the level of interference caused by concurrent transmissions in the network; the latter is function of the Energy Detect (ED) threshold that determines when a node may access the medium. Which links in the network carry traffic is determined by the routing function; routing selects paths according to a link metric that reflects the relative performance of links (e.g., the expected transmission time of a packet on the link). In this paper, we seek to maximize end-to-end network throughput by jointly optimizing physical layer parameters and routing. We consider a random topology with a uniform node density. We consider that the signal attenuation between a pair of nodes is determined by a power law path loss model with an exponent equal to 3. Our findings are as follows. Consider first that the same transmit power and same data rate are used on all links. For any transmit power, data rate and ED threshold setting, the highest feasible load is obtained when the level of interference experienced by links used by routing is the highest possible. For a given transmit power and data rate setting, there is an optimum ED threshold that maximizes network performance. At the optimum ED threshold and maximum load, the range of link lengths used by routing is the lowest possible given the topology and routing metric used. With an ED threshold higher than the optimum, the same range of links is used by routing; however, the highest feasible load in this case is lower due to the fact that concurrent transmitters are allowed to be closer. With a lower ED threshold, concurrent transmitters are forced to be farther apart, and thus longer links become more attractive; as a result, the range of link lengths

  9. 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.

  10. Enhancing Energy Efficiency of Wireless Sensor Network through the Design of Energy Efficient Routing Protocol

    Directory of Open Access Journals (Sweden)

    Noor Zaman

    2016-01-01

    Full Text Available Wireless Sensor Network (WSN is known to be a highly resource constrained class of network where energy consumption is one of the prime concerns. In this research, a cross layer design methodology was adopted to design an energy efficient routing protocol entitled “Position Responsive Routing Protocol” (PRRP. PRRP is designed to minimize energy consumed in each node by (1 reducing the amount of time in which a sensor node is in an idle listening state and (2 reducing the average communication distance over the network. The performance of the proposed PRRP was critically evaluated in the context of network lifetime, throughput, and energy consumption of the network per individual basis and per data packet basis. The research results were analyzed and benchmarked against the well-known LEACH and CELRP protocols. The outcomes show a significant improvement in the WSN in terms of energy efficiency and the overall performance of WSN.

  11. An energy efficient multiple mobile sinks based routing algorithm for wireless sensor networks

    Science.gov (United States)

    Zhong, Peijun; Ruan, Feng

    2018-03-01

    With the fast development of wireless sensor networks (WSNs), more and more energy efficient routing algorithms have been proposed. However, one of the research challenges is how to alleviate the hot spot problem since nodes close to static sink (or base station) tend to die earlier than other sensors. The introduction of mobile sink node can effectively alleviate this problem since sink node can move along certain trajectories, causing hot spot nodes more evenly distributed. In this paper, we mainly study the energy efficient routing method with multiple mobile sinks support. We divide the whole network into several clusters and study the influence of mobile sink number on network lifetime. Simulation results show that the best network performance appears when mobile sink number is about 3 under our simulation environment.

  12. 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.

  13. Optimization-Based Channel Constrained Data Aggregation Routing Algorithms in Multi-Radio Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Hong-Hsu Yen

    2009-06-01

    Full Text Available In wireless sensor networks, data aggregation routing could reduce the number of data transmissions so as to achieve energy efficient transmission. However, data aggregation introduces data retransmission that is caused by co-channel interference from neighboring sensor nodes. This kind of co-channel interference could result in extra energy consumption and significant latency from retransmission. This will jeopardize the benefits of data aggregation. One possible solution to circumvent data retransmission caused by co-channel interference is to assign different channels to every sensor node that is within each other’s interference range on the data aggregation tree. By associating each radio with a different channel, a sensor node could receive data from all the children nodes on the data aggregation tree simultaneously. This could reduce the latency from the data source nodes back to the sink so as to meet the user’s delay QoS. Since the number of radios on each sensor node and the number of non-overlapping channels are all limited resources in wireless sensor networks, a challenging question here is to minimize the total transmission cost under limited number of non-overlapping channels in multi-radio wireless sensor networks. This channel constrained data aggregation routing problem in multi-radio wireless sensor networks is an NP-hard problem. I first model this problem as a mixed integer and linear programming problem where the objective is to minimize the total transmission subject to the data aggregation routing, channel and radio resources constraints. The solution approach is based on the Lagrangean relaxation technique to relax some constraints into the objective function and then to derive a set of independent subproblems. By optimally solving these subproblems, it can not only calculate the lower bound of the original primal problem but also provide useful information to get the primal feasible solutions. By incorporating these

  14. Fundamental lifetime mechanisms in routing protocols for wireless sensor networks: a survey and open issues.

    Science.gov (United States)

    Eslaminejad, Mohammadreza; Razak, Shukor Abd

    2012-10-09

    Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues.

  15. Optimized energy-delay sub-network routing protocol development and implementation for wireless sensor networks

    International Nuclear Information System (INIS)

    Fonda, James W; Zawodniok, Maciej; Jagannathan, S; Watkins, Steve E

    2008-01-01

    The development and the implementation issues of a reactive optimized energy-delay sub-network routing (OEDSR) protocol for wireless sensor networks (WSN) are introduced and its performance is contrasted with the popular ad hoc on-demand distance vector (AODV) routing protocol. Analytical results illustrate the performance of the proposed OEDSR protocol, while experimental results utilizing a hardware testbed under various scenarios demonstrate improvements in energy efficiency of the OEDSR protocol. A hardware platform constructed at the University of Missouri-Rolla (UMR), now the Missouri University of Science and Technology (MST), based on the Generation 4 Smart Sensor Node (G4-SSN) prototyping platform is also described. Performance improvements are shown in terms of end-to-end (E2E) delay, throughput, route-set-up time and drop rates and energy usage is given for three topologies, including a mobile topology. Additionally, results from the hardware testbed provide valuable lessons for network deployments. Under testing OEDSR provides a factor of ten improvement in the energy used in the routing session and extends network lifetime compared to AODV. Depletion experiments show that the time until the first node failure is extended by a factor of three with the network depleting and network lifetime is extended by 6.7%

  16. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks

    Science.gov (United States)

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-01-01

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle’s position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. PMID:27428971

  17. A Distance-based Energy Aware Routing algorithm for wireless sensor networks.

    Science.gov (United States)

    Wang, Jin; Kim, Jeong-Uk; Shu, Lei; Niu, Yu; Lee, Sungyoung

    2010-01-01

    Energy efficiency and balancing is one of the primary challenges for wireless sensor networks (WSNs) since the tiny sensor nodes cannot be easily recharged once they are deployed. Up to now, many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, data aggregation and location tracking etc. However, many of them aim to minimize parameters like total energy consumption, latency etc., which cause hotspot nodes and partitioned network due to the overuse of certain nodes. In this paper, a Distance-based Energy Aware Routing (DEAR) algorithm is proposed to ensure energy efficiency and energy balancing based on theoretical analysis of different energy and traffic models. During the routing process, we consider individual distance as the primary parameter in order to adjust and equalize the energy consumption among involved sensors. The residual energy is also considered as a secondary factor. In this way, all the intermediate nodes will consume their energy at similar rate, which maximizes network lifetime. Simulation results show that the DEAR algorithm can reduce and balance the energy consumption for all sensor nodes so network lifetime is greatly prolonged compared to other routing algorithms.

  18. A Distance-Based Energy Aware Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sungyoung Lee

    2010-10-01

    Full Text Available Energy efficiency and balancing is one of the primary challenges for wireless sensor networks (WSNs since the tiny sensor nodes cannot be easily recharged once they are deployed. Up to now, many energy efficient routing algorithms or protocols have been proposed with techniques like clustering, data aggregation and location tracking etc. However, many of them aim to minimize parameters like total energy consumption, latency etc., which cause hotspot nodes and partitioned network due to the overuse of certain nodes. In this paper, a Distance-based Energy Aware Routing (DEAR algorithm is proposed to ensure energy efficiency and energy balancing based on theoretical analysis of different energy and traffic models. During the routing process, we consider individual distance as the primary parameter in order to adjust and equalize the energy consumption among involved sensors. The residual energy is also considered as a secondary factor. In this way, all the intermediate nodes will consume their energy at similar rate, which maximizes network lifetime. Simulation results show that the DEAR algorithm can reduce and balance the energy consumption for all sensor nodes so network lifetime is greatly prolonged compared to other routing algorithms.

  19. Privacy Preserved and Secured Reliable Routing Protocol for Wireless Mesh Networks.

    Science.gov (United States)

    Meganathan, Navamani Thandava; Palanichamy, Yogesh

    2015-01-01

    Privacy preservation and security provision against internal attacks in wireless mesh networks (WMNs) are more demanding than in wired networks due to the open nature and mobility of certain nodes in the network. Several schemes have been proposed to preserve privacy and provide security in WMNs. To provide complete privacy protection in WMNs, the properties of unobservability, unlinkability, and anonymity are to be ensured during route discovery. These properties can be achieved by implementing group signature and ID-based encryption schemes during route discovery. Due to the characteristics of WMNs, it is more vulnerable to many network layer attacks. Hence, a strong protection is needed to avoid these attacks and this can be achieved by introducing a new Cross-Layer and Subject Logic based Dynamic Reputation (CLSL-DR) mechanism during route discovery. In this paper, we propose a new Privacy preserved and Secured Reliable Routing (PSRR) protocol for WMNs. This protocol incorporates group signature, ID-based encryption schemes, and CLSL-DR mechanism to ensure strong privacy, security, and reliability in WMNs. Simulation results prove this by showing better performance in terms of most of the chosen parameters than the existing protocols.

  20. Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

    Science.gov (United States)

    Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

    2016-07-14

    Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

  1. Privacy Preserved and Secured Reliable Routing Protocol for Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Navamani Thandava Meganathan

    2015-01-01

    Full Text Available Privacy preservation and security provision against internal attacks in wireless mesh networks (WMNs are more demanding than in wired networks due to the open nature and mobility of certain nodes in the network. Several schemes have been proposed to preserve privacy and provide security in WMNs. To provide complete privacy protection in WMNs, the properties of unobservability, unlinkability, and anonymity are to be ensured during route discovery. These properties can be achieved by implementing group signature and ID-based encryption schemes during route discovery. Due to the characteristics of WMNs, it is more vulnerable to many network layer attacks. Hence, a strong protection is needed to avoid these attacks and this can be achieved by introducing a new Cross-Layer and Subject Logic based Dynamic Reputation (CLSL-DR mechanism during route discovery. In this paper, we propose a new Privacy preserved and Secured Reliable Routing (PSRR protocol for WMNs. This protocol incorporates group signature, ID-based encryption schemes, and CLSL-DR mechanism to ensure strong privacy, security, and reliability in WMNs. Simulation results prove this by showing better performance in terms of most of the chosen parameters than the existing protocols.

  2. 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...... node to a single sink node, taking into account the current energy status of the network. By simulation, the algorithm is shown to be able to adapt to changes in harvested and stored energy. Simulations show that continuous operation is possible....

  3. Adaptive Bio-Inspired Wireless Network Routing for Planetary Surface Exploration

    Science.gov (United States)

    Alena, Richard I.; Lee, Charles

    2004-01-01

    Wireless mobile networks suffer connectivity loss when used in a terrain that has hills, and valleys when line of sight is interrupted or range is exceeded. To resolve this problem and achieve acceptable network performance, we have designed an adaptive, configurable, hybrid system to automatically route network packets along the best path between multiple geographically dispersed modules. This is very useful in planetary surface exploration, especially for ad-hoc mobile networks, where computational devices take an active part in creating a network infrastructure, and can actually be used to route data dynamically and even store data for later transmission between networks. Using inspiration from biological systems, this research proposes to use ant trail algorithms with multi-layered information maps (topographic maps, RF coverage maps) to determine the best route through ad-hoc network at real time. The determination of best route is a complex one, and requires research into the appropriate metrics, best method to identify the best path, optimizing traffic capacity, network performance, reliability, processing capabilities and cost. Real ants are capable of finding the shortest path from their nest to a food source without visual sensing through the use of pheromones. They are also able to adapt to changes in the environment using subtle clues. To use ant trail algorithms, we need to define the probability function. The artificial ant is, in this case, a software agent that moves from node to node on a network graph. The function to calculate the fitness (evaluate the better path) includes: length of the network edge, the coverage index, topology graph index, and pheromone trail left behind by other ant agents. Each agent modifies the environment in two different ways: 1) Local trail updating: As the ant moves between nodes it updates the amount of pheromone on the edge; and 2) Global trail updating: When all ants have completed a tour the ant that found the

  4. A Multipath Routing Protocol Based on Clustering and Ant Colony Optimization for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jing Yang

    2010-05-01

    Full Text Available For monitoring burst events in a kind of reactive wireless sensor networks (WSNs, a multipath routing protocol (MRP based on dynamic clustering and ant colony optimization (ACO is proposed.. Such an approach can maximize the network lifetime and reduce the energy consumption. An important attribute of WSNs is their limited power supply, and therefore some metrics (such as energy consumption of communication among nodes, residual energy, path length were considered as very important criteria while designing routing in the MRP. Firstly, a cluster head (CH is selected among nodes located in the event area according to some parameters, such as residual energy. Secondly, an improved ACO algorithm is applied in the search for multiple paths between the CH and sink node. Finally, the CH dynamically chooses a route to transmit data with a probability that depends on many path metrics, such as energy consumption. The simulation results show that MRP can prolong the network lifetime, as well as balance of energy consumption among nodes and reduce the average energy consumption effectively.

  5. An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks.

    Science.gov (United States)

    Javaid, Nadeem; Ilyas, Naveed; Ahmad, Ashfaq; Alrajeh, Nabil; Qasim, Umar; Khan, Zahoor Ali; Liaqat, Tayyaba; Khan, Majid Iqbal

    2015-11-17

    Most applications of underwater wireless sensor networks (UWSNs) demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS) to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV)-aided efficient data-gathering (AEDG) routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT) algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS) to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics.

  6. On the routing protocol influence on the resilience of wireless sensor networks to jamming attacks.

    Science.gov (United States)

    Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Monroy, Raul; Nolazco-Flores, Juan Arturo

    2015-03-27

    In this work, we compare a recently proposed routing protocol, the multi-parent hierarchical (MPH) protocol, with two well-known protocols, the ad hoc on-demand distance vector (AODV) and dynamic source routing (DSR). For this purpose, we have developed a simulator, which faithfully reifies the workings of a given protocol, considering a fixed, reconfigurable ad hoc network given by the number and location of participants, and general network conditions. We consider a scenario that can be found in a large number of wireless sensor network applications, a single sink node that collects all of the information generated by the sensors. The metrics used to compare the protocols were the number of packet retransmissions, carrier sense multiple access (CSMA) inner loop retries, the number of nodes answering the queries from the coordinator (sink) node and the energy consumption. We tested the network under ordinary (without attacks) conditions (and combinations thereof) and when it is subject to different types of jamming attacks (in particular, random and reactive jamming attacks), considering several positions for the jammer. Our results report that MPH has a greater ability to tolerate such attacks than DSR and AODV, since it minimizes and encapsulates the network segment under attack. The self-configuring capabilities of MPH derived from a combination of a proactive routes update, on a periodic-time basis, and a reactive behavior provide higher resilience while offering a better performance (overhead and energy consumption) than AODV and DSR, as shown in our simulation results.

  7. Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jianpo Li

    2014-01-01

    Full Text Available Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

  8. CENTERA: A Centralized Trust-Based Efficient Routing Protocol with Authentication for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ayman Tajeddine

    2015-02-01

    Full Text Available In this paper, we present CENTERA, a CENtralized Trust-based Efficient Routing protocol with an appropriate authentication scheme for wireless sensor networks (WSN. CENTERA utilizes the more powerful base station (BS to gather minimal neighbor trust information from nodes and calculate the best routes after isolating different types of “bad” nodes. By periodically accumulating these simple local observations and approximating the nodes’ battery lives, the BS draws a global view of the network, calculates three quality metrics—maliciousness, cooperation, and compatibility—and evaluates the Data Trust and Forwarding Trust values of each node. Based on these metrics, the BS isolates “bad”, “misbehaving” or malicious nodes for a certain period, and put some nodes on probation. CENTERA increases the node’s bad/probation level with repeated “bad” behavior, and decreases it otherwise. Then it uses a very efficient method to distribute the routing information to “good” nodes. Based on its target environment, and if required, CENTERA uses an authentication scheme suitable for severely constrained nodes, ranging from the symmetric RC5 for safe environments under close administration, to pairing-based cryptography (PBC for hostile environments with a strong attacker model. We simulate CENTERA using TOSSIM and verify its correctness and show some energy calculations.

  9. An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jin Wang

    2014-08-01

    Full Text Available Traffic patterns in wireless sensor networks (WSNs usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

  10. An Efficient Data-Gathering Routing Protocol for Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Nadeem Javaid

    2015-11-01

    Full Text Available Most applications of underwater wireless sensor networks (UWSNs demand reliable data delivery over a longer period in an efficient and timely manner. However, the harsh and unpredictable underwater environment makes routing more challenging as compared to terrestrial WSNs. Most of the existing schemes deploy mobile sensors or a mobile sink (MS to maximize data gathering. However, the relatively high deployment cost prevents their usage in most applications. Thus, this paper presents an autonomous underwater vehicle (AUV-aided efficient data-gathering (AEDG routing protocol for reliable data delivery in UWSNs. To prolong the network lifetime, AEDG employs an AUV for data collection from gateways and uses a shortest path tree (SPT algorithm while associating sensor nodes with the gateways. The AEDG protocol also limits the number of associated nodes with the gateway nodes to minimize the network energy consumption and to prevent the gateways from overloading. Moreover, gateways are rotated with the passage of time to balance the energy consumption of the network. To prevent data loss, AEDG allows dynamic data collection at the AUV depending on the limited number of member nodes that are associated with each gateway. We also develop a sub-optimal elliptical trajectory of AUV by using a connected dominating set (CDS to further facilitate network throughput maximization. The performance of the AEDG is validated via simulations, which demonstrate the effectiveness of AEDG in comparison to two existing UWSN routing protocols in terms of the selected performance metrics.

  11. Efficient and Secure Routing Protocol for Wireless Sensor Networks through Optimal Power Control and Optimal Handoff-Based Recovery Mechanism

    Directory of Open Access Journals (Sweden)

    S. Ganesh

    2012-01-01

    Full Text Available Advances in wireless sensor network (WSN technology have provided the availability of small and low-cost sensor with capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In WSN, the sensor nodes have a limited transmission range, and their processing and storage capabilities as well as their energy resources are also limited. Modified triple umpiring system (MTUS has already proved its better performance in Wireless Sensor Networks. In this paper, we extended the MTUS by incorporating optimal signal to noise ratio (SNR-based power control mechanism and optimal handoff-based self-recovery features to form an efficient and secure routing for WSN. Extensive investigation studies using Glomosim-2.03 Simulator show that efficient and secure routing protocol (ESRP with optimal power control mechanism, and handoff-based self-recovery can significantly reduce the power usage.

  12. Incentive Compatible and Globally Efficient Position Based Routing for Selfish Reverse Multicast in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sarvesh Varatharajan

    2009-10-01

    Full Text Available We consider the problem of all-to-one selfish routing in the absence of a payment scheme in wireless sensor networks, where a natural model for cost is the power required to forward, referring to the resulting game as a Locally Minimum Cost Forwarding (LMCF. Our objective is to characterize equilibria and their global costs in terms of stretch and diameter, in particular finding incentive compatible algorithms that are also close to globally optimal. We find that although social costs for equilibria of LMCF exhibit arbitrarily bad worst-case bounds and computational infeasibility of reaching optimal equilibria, there exist greedy and local incentive compatible heuristics achieving near-optimal global costs.

  13. Optimal Channel Width Adaptation, Logical Topology Design, and Routing in Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Li Li

    2009-01-01

    Full Text Available Radio frequency spectrum is a finite and scarce resource. How to efficiently use the spectrum resource is one of the fundamental issues for multi-radio multi-channel wireless mesh networks. However, past research efforts that attempt to exploit multiple channels always assume channels of fixed predetermined width, which prohibits the further effective use of the spectrum resource. In this paper, we address how to optimally adapt channel width to more efficiently utilize the spectrum in IEEE802.11-based multi-radio multi-channel mesh networks. We mathematically formulate the channel width adaptation, logical topology design, and routing as a joint mixed 0-1 integer linear optimization problem, and we also propose our heuristic assignment algorithm. Simulation results show that our method can significantly improve spectrum use efficiency and network performance.

  14. 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.

  15. Load Balancing Metric with Diversity for Energy Efficient Routing in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Moad, Sofiane; Hansen, Morten Tranberg; Jurdak, Raja

    2011-01-01

    The expected number of transmission (ETX) represents a routing metric that considers the highly variable link qualities for a specific radio in Wireless Sensor Networks (WSNs). To adapt to these differences, radio diversity is a recently explored solution for WSNs. In this paper, we propose...... an energy balancing metric which explores the diversity in link qualities present at different radios. The goal is to effectively use the energy of the network and therefore extend the network lifetime. The proposed metric takes into account the transmission and reception costs for a specific radio in order...... to choose an energy efficient radio. In addition, the metric uses the remaining energy of nodes in order to regulate the traffic so that critical nodes are avoided. We show by simulations that our metric can improve the network lifetime up to 20%....

  16. Enhancement of Adaptive Cluster Hierarchical Routing Protocol using Distance and Energy for Wireless Sensor Networks

    International Nuclear Information System (INIS)

    Nawar, N.M.; Soliman, S.E.; Kelash, H.M.; Ayad, N.M.

    2014-01-01

    The application of wireless networking is widely used in nuclear applications. This includes reactor control and fire dedication system. This paper is devoted to the application of this concept in the intrusion system of the Radioisotope Production Facility (RPF) of the Egyptian Atomic Energy Authority. This includes the tracking, monitoring and control components of this system. The design and implementation of wireless sensor networks has become a hot area of research due to the extensive use of sensor networks to enable applications that connect the physical world to the virtual world [1-2]. The original LEACH is named a communication protocol (clustering-based); the extended LEACH’s stochastic cluster head selection algorithm by a deterministic component. Depending on the network configuration an increase of network lifetime can be accomplished [3]. The proposed routing mechanisms after enhancement divide the nodes into clusters. A cluster head performs its task which is considerably more energy-intensive than the rest of the nodes inside sensor network. So, nodes rotate tasks at different rounds between a cluster head and other sensors throughout the lifetime of the network to balance the energy dissipation [4-5].The performance improvement when using routing protocol after enhancement of the algorithm which takes into consideration the distance and the remaining energy for choosing the cluster head by obtains from the advertise message. Network Simulator (Ns2 simulator) is used to prove that LEACH after enhancement performs better than the original LEACH protocol in terms of Average Energy, Network Life Time, Delay, Throughput and Overhead.

  17. A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

    Directory of Open Access Journals (Sweden)

    Nabil Sabor

    2017-01-01

    Full Text Available Introducing mobility to Wireless Sensor Networks (WSNs puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs. Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.

  18. Key Management Scheme Based on Route Planning of Mobile Sink in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ying Zhang

    2016-01-01

    Full Text Available In many wireless sensor network application scenarios the key management scheme with a Mobile Sink (MS should be fully investigated. This paper proposes a key management scheme based on dynamic clustering and optimal-routing choice of MS. The concept of Traveling Salesman Problem with Neighbor areas (TSPN in dynamic clustering for data exchange is proposed, and the selection probability is used in MS route planning. The proposed scheme extends static key management to dynamic key management by considering the dynamic clustering and mobility of MSs, which can effectively balance the total energy consumption during the activities. Considering the different resources available to the member nodes and sink node, the session key between cluster head and MS is established by modified an ECC encryption with Diffie-Hellman key exchange (ECDH algorithm and the session key between member node and cluster head is built with a binary symmetric polynomial. By analyzing the security of data storage, data transfer and the mechanism of dynamic key management, the proposed scheme has more advantages to help improve the resilience of the key management system of the network on the premise of satisfying higher connectivity and storage efficiency.

  19. 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.

  20. A Localization-Free Interference and Energy Holes Minimization Routing for Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Anwar Khan

    2018-01-01

    Full Text Available Interference and energy holes formation in underwater wireless sensor networks (UWSNs threaten the reliable delivery of data packets from a source to a destination. Interference also causes inefficient utilization of the limited battery power of the sensor nodes in that more power is consumed in the retransmission of the lost packets. Energy holes are dead nodes close to the surface of water, and their early death interrupts data delivery even when the network has live nodes. This paper proposes a localization-free interference and energy holes minimization (LF-IEHM routing protocol for UWSNs. The proposed algorithm overcomes interference during data packet forwarding by defining a unique packet holding time for every sensor node. The energy holes formation is mitigated by a variable transmission range of the sensor nodes. As compared to the conventional routing protocols, the proposed protocol does not require the localization information of the sensor nodes, which is cumbersome and difficult to obtain, as nodes change their positions with water currents. Simulation results show superior performance of the proposed scheme in terms of packets received at the final destination and end-to-end delay.

  1. A Localization-Free Interference and Energy Holes Minimization Routing for Underwater Wireless Sensor Networks.

    Science.gov (United States)

    Khan, Anwar; Ahmedy, Ismail; Anisi, Mohammad Hossein; Javaid, Nadeem; Ali, Ihsan; Khan, Nawsher; Alsaqer, Mohammed; Mahmood, Hasan

    2018-01-09

    Interference and energy holes formation in underwater wireless sensor networks (UWSNs) threaten the reliable delivery of data packets from a source to a destination. Interference also causes inefficient utilization of the limited battery power of the sensor nodes in that more power is consumed in the retransmission of the lost packets. Energy holes are dead nodes close to the surface of water, and their early death interrupts data delivery even when the network has live nodes. This paper proposes a localization-free interference and energy holes minimization (LF-IEHM) routing protocol for UWSNs. The proposed algorithm overcomes interference during data packet forwarding by defining a unique packet holding time for every sensor node. The energy holes formation is mitigated by a variable transmission range of the sensor nodes. As compared to the conventional routing protocols, the proposed protocol does not require the localization information of the sensor nodes, which is cumbersome and difficult to obtain, as nodes change their positions with water currents. Simulation results show superior performance of the proposed scheme in terms of packets received at the final destination and end-to-end delay.

  2. Key Management Scheme Based on Route Planning of Mobile Sink in Wireless Sensor Networks.

    Science.gov (United States)

    Zhang, Ying; Liang, Jixing; Zheng, Bingxin; Jiang, Shengming; Chen, Wei

    2016-01-29

    In many wireless sensor network application scenarios the key management scheme with a Mobile Sink (MS) should be fully investigated. This paper proposes a key management scheme based on dynamic clustering and optimal-routing choice of MS. The concept of Traveling Salesman Problem with Neighbor areas (TSPN) in dynamic clustering for data exchange is proposed, and the selection probability is used in MS route planning. The proposed scheme extends static key management to dynamic key management by considering the dynamic clustering and mobility of MSs, which can effectively balance the total energy consumption during the activities. Considering the different resources available to the member nodes and sink node, the session key between cluster head and MS is established by modified an ECC encryption with Diffie-Hellman key exchange (ECDH) algorithm and the session key between member node and cluster head is built with a binary symmetric polynomial. By analyzing the security of data storage, data transfer and the mechanism of dynamic key management, the proposed scheme has more advantages to help improve the resilience of the key management system of the network on the premise of satisfying higher connectivity and storage efficiency.

  3. Energy Route Multi-Objective Optimization of Wireless Power Transfer Network: An Improved Cross-Entropy Method

    Directory of Open Access Journals (Sweden)

    Lijuan Xiang

    2017-06-01

    Full Text Available This paper identifies the Wireless Power Transfer Network (WPTN as an ideal model for long-distance Wireless Power Transfer (WPT in a certain region with multiple electrical equipment. The schematic circuit and design of each power node and the process of power transmission between the two power nodes are elaborated. The Improved Cross-Entropy (ICE method is proposed as an algorithm to solve for optimal energy route. Non-dominated sorting is introduced for optimization. A demonstration of the optimization result of a 30-nodes WPTN system based on the proposed algorithm proves ICE method to be efficacious and efficiency.

  4. Data-Based Energy Efficient Clustered Routing Protocol for Wireless Sensors Networks – Tabuk Flood Monitoring System Case Study

    Directory of Open Access Journals (Sweden)

    Ammar Babiker

    2017-10-01

    Full Text Available Energy efficiency has been considered as the most important issue in wireless sensor networks. As in many applications, wireless sensors are scattered in a wide harsh area, where the battery replacement or charging will be quite difficult and it is the most important challenge. Therefore, the design of energy saving mechanism becomes mandatory in most recent research. In this paper, a new energy efficient clustered routing protocol is proposed: the proposed protocol is based on analyzing the data collected from the sensors in a base-station. Based on this analysis the cluster head will be selected as the one with the most useful data. Then, a variable time slot is specified to each sensor to minimize the transmission of repetitive and un-useful data. The proposed protocol Data-Based Energy Efficient Clustered Routing Protocol for Wireless Sensors Networks (DCRP was compared with the famous energy efficient LEACH protocol and also with one of the recent energy efficient routing protocols named Position Responsive Routing Protocol (PRRP. DCRP has been used in monitoring the floods in Tabuk area –Saudi Arabia. It shows comparatively better results.

  5. Hybrid Swarm Intelligence Energy Efficient Clustered Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Rajeev Kumar

    2016-01-01

    Full Text Available Currently, wireless sensor networks (WSNs are used in many applications, namely, environment monitoring, disaster management, industrial automation, and medical electronics. Sensor nodes carry many limitations like low battery life, small memory space, and limited computing capability. To create a wireless sensor network more energy efficient, swarm intelligence technique has been applied to resolve many optimization issues in WSNs. In many existing clustering techniques an artificial bee colony (ABC algorithm is utilized to collect information from the field periodically. Nevertheless, in the event based applications, an ant colony optimization (ACO is a good solution to enhance the network lifespan. In this paper, we combine both algorithms (i.e., ABC and ACO and propose a new hybrid ABCACO algorithm to solve a Nondeterministic Polynomial (NP hard and finite problem of WSNs. ABCACO algorithm is divided into three main parts: (i selection of optimal number of subregions and further subregion parts, (ii cluster head selection using ABC algorithm, and (iii efficient data transmission using ACO algorithm. We use a hierarchical clustering technique for data transmission; the data is transmitted from member nodes to the subcluster heads and then from subcluster heads to the elected cluster heads based on some threshold value. Cluster heads use an ACO algorithm to discover the best route for data transmission to the base station (BS. The proposed approach is very useful in designing the framework for forest fire detection and monitoring. The simulation results show that the ABCACO algorithm enhances the stability period by 60% and also improves the goodput by 31% against LEACH and WSNCABC, respectively.

  6. 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...

  7. Proposal and Performance Evaluation of a Multicast Routing Protocol for Wireless Mesh Networks Based on Network Load

    Directory of Open Access Journals (Sweden)

    Kiyotaka Oe

    2015-01-01

    Full Text Available Wireless Mesh Networks (WMNs can provide wide range Wireless Local Area Networks (WLANs area by connecting Access Points (APs of WLANs with each other using radio communications. A routing protocol is very important to keep communication quality over radio multihop communications because radio waves are impacted much by surrounding environment. When we use multiuser shared applications like a video conference and an IP phone, it is predicted that large amount of traffic flows on network. Therefore, we should consider network loads to use these applications. In this paper, we propose a multicast routing protocol for WMNs which considers network loads and hop count. Furthermore, we evaluate performance by simulation. In the simulation results, we show that the proposed protocol has better performance than a conventional protocol (MAODV at high loaded scenario.

  8. Buckshot Routing with Distance Vectors in Three Application Scenarios for Wireless Sensor Networks with Unstable Network Topologies and Unidirectional Links

    Directory of Open Access Journals (Sweden)

    Reinhardt Karnapke

    2015-02-01

    Full Text Available Experiments have shown that the number of asymmetric and unidirectional links often exceeds the number of bidirectional ones, especially in the transitional area of the communication range of wireless sensor nodes. Still, most of today’s routing protocols ignore their existence or try to remove their implications. Also, links are not stable over time, and routes become unusable often, resulting in a need for new routing protocols that can handle highly dynamic links and use unidirectional links to their advantage. At SENSORCOMM' 2014, we presented BuckshotDV, a routing protocol which is resilient against link fluctuations and uses the longer reach of unidirectional links to increase its performance. Furthermore, its distance vector nature makes it scalable for large sensor networks. This paper is an extended version which adds some implementation details and the evaluation of BuckshotDV in two more application scenarios.

  9. Deadlock Avoidance Policy in Mobile Wireless Sensor Networks with Free Choice Resource Routing

    Directory of Open Access Journals (Sweden)

    Prasanna Ballal

    2008-11-01

    Full Text Available Efficient control schemes are required for effective cooperation of robot teams in a mobile wireless sensor network. If the robots (resources are also in charge of executing multiple simultaneous missions, then risks of deadlocks due to the presence of shared resources among different missions increase and have to be tackled. Discrete event control with deadlock avoidance has been used in the past for robot team coordination for the case of multi reentrant flowline models with shared resources. In this paper we present an analysis of deadlock avoidance for a generalized case of multi reentrant flow line systems (MRF called the Free Choice Multi Reentrant Flow Line systems (FMRF. In FMRF, some tasks have multiple resource choices; hence routing decisions have to be made and current results in deadlock avoidance for MRF do not hold. This analysis is based on the so-called Circular Waits (CW of the resources in the system. For FMRF, the well known notions of Critical Siphons and Critical Subsystems must be generalized and we redefine these objects for such systems. Our second contribution provides a matrix formulation that efficiently computes the objects required for deadlock avoidance in FMRF systems. A MAXWIP dispatching policy is formulated for deadlock avoidance in FMRF systems. According to this policy, deadlock in FMRF is avoided by limiting the work in progress (WIP in the critical subsystems of each CW. Implemented results of the proposed scheme in a WSN test-bed is presented in the paper.

  10. 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.

  11. Deadlock Avoidance Policy in Mobile Wireless Sensor Networks with Free Choice Resource Routing

    Directory of Open Access Journals (Sweden)

    Prasanna Ballal

    2008-09-01

    Full Text Available Efficient control schemes are required for effective cooperation of robot teams in a mobile wireless sensor network. If the robots (resources are also in charge of executing multiple simultaneous missions, then risks of deadlocks due to the presence of shared resources among different missions increase and have to be tackled. Discrete event control with deadlock avoidance has been used in the past for robot team coordination for the case of multi reentrant flowline models with shared resources. In this paper we present an analysis of deadlock avoidance for a generalized case of multi reentrant flow line systems (MRF called the Free Choice Multi Reentrant Flow Line systems (FMRF. In FMRF, some tasks have multiple resource choices; hence routing decisions have to be made and current results in deadlock avoidance for MRF do not hold. This analysis is based on the so-called Circular Waits (CW of the resources in the system. For FMRF, the well known notions of Critical Siphons and Critical Subsystems must be generalized and we redefine these objects for such systems. Our second contribution provides a matrix formulation that efficiently computes the objects required for deadlock avoidance in FMRF systems. A MAXWIP dispatching policy is formulated for deadlock avoidance in FMRF systems. According to this policy, deadlock in FMRF is avoided by limiting the work in progress (WIP in the critical subsystems of each CW. Implemented results of the proposed scheme in a WSN test-bed is presented in the paper.

  12. Cooperative and Adaptive Network Coding for Gradient Based Routing in Wireless Sensor Networks with Multiple Sinks

    Directory of Open Access Journals (Sweden)

    M. E. Migabo

    2017-01-01

    Full Text Available Despite its low computational cost, the Gradient Based Routing (GBR broadcast of interest messages in Wireless Sensor Networks (WSNs causes significant packets duplications and unnecessary packets transmissions. This results in energy wastage, traffic load imbalance, high network traffic, and low throughput. Thanks to the emergence of fast and powerful processors, the development of efficient network coding strategies is expected to enable efficient packets aggregations and reduce packets retransmissions. For multiple sinks WSNs, the challenge consists of efficiently selecting a suitable network coding scheme. This article proposes a Cooperative and Adaptive Network Coding for GBR (CoAdNC-GBR technique which considers the network density as dynamically defined by the average number of neighbouring nodes, to efficiently aggregate interest messages. The aggregation is performed by means of linear combinations of random coefficients of a finite Galois Field of variable size GF(2S at each node and the decoding is performed by means of Gaussian elimination. The obtained results reveal that, by exploiting the cooperation of the multiple sinks, the CoAdNC-GBR not only improves the transmission reliability of links and lowers the number of transmissions and the propagation latency, but also enhances the energy efficiency of the network when compared to the GBR-network coding (GBR-NC techniques.

  13. A Localization Based Cooperative Routing Protocol for Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Nadeem Javaid

    2017-01-01

    Full Text Available Localization is one of the major aspects in underwater wireless sensor networks (UWSNs. Therefore, it is important to know the accurate position of the sensor node in large scale applications like disaster prevention, tactical surveillance, and monitoring. Due to the inefficiency of the global positioning system (GPS in UWSN, it is very difficult to localize a node in underwater environment compared to terrestrial networks. To minimize the localization error and enhance the localization coverage of the network, two routing protocols are proposed; the first one is mobile autonomous underwater vehicle (MobiL-AUV and the second one is cooperative MobiL (CO-MobiL. In MobiL-AUV, AUVs are deployed and equipped with GPS and act as reference nodes. These reference nodes are used to localize all the nonlocalized ordinary sensor nodes in order to reduce the localization error and maximize the network coverage. CO-MobiL is presented in order to improve the network throughput by using the maximal ratio combining (MRC as diversity technique which combines both signals, received from the source and received from the relay at the destination. It uses amplify-and-forward (AF mechanism to improve the signal between the source and the destination. To support our claims, extensive simulations are performed.

  14. Energy Aware Routing Schemes in Solar PoweredWireless Sensor Networks

    KAUST Repository

    Dehwah, Ahmad H.

    2016-10-01

    Wireless sensor networks enable inexpensive distributed monitoring systems that are the backbone of smart cities. In this dissertation, we are interested in wireless sensor networks for traffic monitoring and an emergency flood detection to improve the safety of future cities. To achieve real-time traffic monitoring and emergency flood detection, the system has to be continually operational. Accordingly, an energy source is needed to ensure energy availability at all times. The sun provides for the most inexpensive source of energy, and therefore the energy is provided here by a solar panel working in conjunction with a rechargeable battery. Unlike batteries, solar energy fluctuates spatially and temporally due to the panel orientation, seasonal variation and node location, particularly in cities where buildings cast shadows. Especially, it becomes scarce whenever floods are likely to occur, as the weather tends to be cloudy at such times when the emergency detection system is most needed. These considerations lead to the need for the optimization of the energy of the sensor network, to maximize its sensing performance. In this dissertation, we address the challenges associated with long term outdoor deployments along with providing some solutions to overcome part of these challenges. We then introduce the energy optimization problem, as a distributed greedy approach. Motivated by the flood sensing application, our objective is to maximize the energy margin in the solar powered network at the onset of the high rain event, to maximize the network lifetime. The decentralized scheme will achieve this by optimizing the energy over a time horizon T, taking into account the available and predicted energy over the entire routing path. Having a good energy forecasting scheme can significantly enhance the energy optimization in WSN. Thus, this dissertation proposes a new energy forecasting scheme that is compatible with the platform’s capabilities. This proposed

  15. A novel power efficient location-based cooperative routing with transmission power-upper-limit for wireless sensor networks.

    Science.gov (United States)

    Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai

    2013-05-15

    The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate.

  16. Location aware event driven multipath routing in Wireless Sensor Networks: Agent based approach

    Directory of Open Access Journals (Sweden)

    A.V. Sutagundar

    2013-03-01

    Full Text Available Wireless Sensor Networks (WSNs demand reliable and energy efficient paths for critical information delivery to sink node from an event occurrence node. Multipath routing facilitates reliable data delivery in case of critical information. This paper proposes an event triggered multipath routing in WSNs by employing a set of static and mobile agents. Every sensor node is assumed to know the location information of the sink node and itself. The proposed scheme works as follows: (1 Event node computes the arbitrary midpoint between an event node and the sink node by using location information. (2 Event node establishes a shortest path from itself to the sink node through the reference axis by using a mobile agent with the help of location information; the mobile agent collects the connectivity information and other parameters of all the nodes on the way and provides the information to the sink node. (3 Event node finds the arbitrary location of the special (middle intermediate nodes (above/below reference axis by using the midpoint location information given in step 1. (4 Mobile agent clones from the event node and the clones carry the event type and discover the path passing through special intermediate nodes; the path above/below reference axis looks like an arc. While migrating from one sensor node to another along the traversed path, each mobile agent gathers the node information (such as node id, location information, residual energy, available bandwidth, and neighbors connectivity and delivers to the sink node. (5 The sink node constructs a partial topology, connecting event and sink node by using the connectivity information delivered by the mobile agents. Using the partial topology information, sink node finds the multipath and path weight factor by using link efficiency, energy ratio, and hop distance. (6 The sink node selects the number of paths among the available paths based upon the criticalness of an event, and (7 if the event is non

  17. An Immune Cooperative Particle Swarm Optimization Algorithm for Fault-Tolerant Routing Optimization in Heterogeneous Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yifan Hu

    2012-01-01

    Full Text Available The fault-tolerant routing problem is important consideration in the design of heterogeneous wireless sensor networks (H-WSNs applications, and has recently been attracting growing research interests. In order to maintain k disjoint communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which multiple paths are calculated and maintained in advance, and alternate paths are created once the previous routing is broken. Then, we propose an immune cooperative particle swarm optimization algorithm (ICPSOA in the model to provide the fast routing recovery and reconstruct the network topology for path failure in H-WSNs. In the ICPSOA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by immune mechanism, which can enhance the capacity of global search and improve the converging rate of the algorithm. Then we validate this theoretical model with simulation results. The results indicate that the ICPSOA-based fault-tolerant routing protocol outperforms several other protocols due to its capability of fast routing recovery mechanism, reliable communications, and prolonging the lifetime of WSNs.

  18. A Routing Algorithm for WiFi-Based Wireless Sensor Network and the Application in Automatic Meter Reading

    Directory of Open Access Journals (Sweden)

    Li Li

    2013-01-01

    Full Text Available The Automatic Meter Reading (AMR network for the next generation Smart Grid is required to possess many essential functions, such as data reading and writing, intelligent power transmission, and line damage detection. However, the traditional AMR network cannot meet the previous requirement. With the development of the WiFi sensor node in the low power cost, a new kind of wireless sensor network based on the WiFi technology can be used in application. In this paper, we have designed a new architecture of WiFi-based wireless sensor network, which is suitable for the next generation AMR system. We have also proposed a new routing algorithm called Energy Saving-Based Hybrid Wireless Mesh Protocol (E-HWMP on the premise of current algorithm, which can improve the energy saving of the HWMP and be suitable for the WiFi-based wireless sensor network. The simulation results show that the life cycle of network is extended.

  19. Development of Energy-Efficient Routing Protocol in Wireless Sensor Networks Using Optimal Gradient Routing with On Demand Neighborhood Information

    OpenAIRE

    Kannan, K. Nattar; Paramasivan, B.

    2014-01-01

    Wireless sensor networks (WSNs) consist of a number of autonomous sensor nodes which have limited battery power and computation capabilities with sensing of various physical and environmental conditions. In recent days, WSNs adequately need effective mechanisms for data forwarding to enhance the energy efficiency in networks. In WSNs, the optimization of energy consumption is a crucial issue for real-time application. Network topology of WSNs also is changed dynamically by anonymous nodes. Ro...

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

    CSIR Research Space (South Africa)

    Salami, O

    2009-09-01

    Full Text Available In inter-working multi-hop wireless networks, establishing resilient connectivity between source-destination node pairs is a major issue. The issue of connectivity in multi-hop wireless networks have been studied. However, these analyses focused...

  1. An Adaptive Clustering Approach Based on Minimum Travel Route Planning for Wireless Sensor Networks with a Mobile Sink

    Science.gov (United States)

    Tang, Jiqiang; Yang, Wu; Zhu, Lingyun; Wang, Dong; Feng, Xin

    2017-01-01

    In recent years, Wireless Sensor Networks with a Mobile Sink (WSN-MS) have been an active research topic due to the widespread use of mobile devices. However, how to get the balance between data delivery latency and energy consumption becomes a key issue of WSN-MS. In this paper, we study the clustering approach by jointly considering the Route planning for mobile sink and Clustering Problem (RCP) for static sensor nodes. We solve the RCP problem by using the minimum travel route clustering approach, which applies the minimum travel route of the mobile sink to guide the clustering process. We formulate the RCP problem as an Integer Non-Linear Programming (INLP) problem to shorten the travel route of the mobile sink under three constraints: the communication hops constraint, the travel route constraint and the loop avoidance constraint. We then propose an Imprecise Induction Algorithm (IIA) based on the property that the solution with a small hop count is more feasible than that with a large hop count. The IIA algorithm includes three processes: initializing travel route planning with a Traveling Salesman Problem (TSP) algorithm, transforming the cluster head to a cluster member and transforming the cluster member to a cluster head. Extensive experimental results show that the IIA algorithm could automatically adjust cluster heads according to the maximum hops parameter and plan a shorter travel route for the mobile sink. Compared with the Shortest Path Tree-based Data-Gathering Algorithm (SPT-DGA), the IIA algorithm has the characteristics of shorter route length, smaller cluster head count and faster convergence rate. PMID:28445434

  2. 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.

  3. A Critical Review of Surveys Emphasizing on Routing in Wireless Sensor Networks-An Anatomization under General Survey Design Framework.

    Science.gov (United States)

    Rehan, Waqas; Fischer, Stefan; Rehan, Maaz

    2017-07-26

    A large number of routing-related surveys are published so far for Wireless Sensor Networks (WSNs) that exhibit either complete or partial emphasis on routing in WSNs. These surveys classify and discuss the relevant routing protocols published mainly in the fields of classical, energy efficient, secure, hierarchical, geographic, intelligent, Quality of Service (QoS)-based and multipath WSNs. However, to the best of our knowledge, no study is presented so far which may clearly categorize the routing-related survey literature for WSNs.To fill this gap, an effort is made in this paper for presenting an in-depth review of already published routing-related survey literature in WSNs. Our review initially proposes a generalized survey design model and afterwards analyzes the routing-related survey literature in the light of the devised General Survey Design Framework (GSDF) . Such an analysis describes the design soundness of the published routing-related surveys. Therefore, our review puts forth an original classification based on the frequency-of-survey-publication and taxonomizes the corresponding routing-related fields into high, medium and low focused areas of survey publication in WSNs. Furthermore, the surveys belonging to each main category are sub-categorized into various sub-classes and briefly discussed according to their design characteristics. On the one hand, this review is useful for beginners who may easily explore the already published routing-related survey literature in WSNs in a single document and investigate it by spending less effort. On the other hand, it is useful for expert researchers who may explore the trends and frequency of writing surveys in different areas of routing in WSNs. The experts may explore those areas of routing which are either neglected or least focused or lack in design soundness as per general survey design framework. In the end, insights and future research directions are outlined and a reasonable conclusion is put forth

  4. Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks.

    Science.gov (United States)

    Perumal, Madhumathy; Dhandapani, Sivakumar

    2015-01-01

    Data gathering and optimal path selection for wireless sensor networks (WSN) using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS). This protocol finds the rendezvous point for optimal transmission of data using a "splitting tree" technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the "Biased Random Walk" model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS) is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove that there is increase in the network lifetime compared with other routing protocols.

  5. Adaptive Aggregation Routing to Reduce Delay for Multi-Layer Wireless Sensor Networks.

    Science.gov (United States)

    Li, Xujing; Liu, Anfeng; Xie, Mande; Xiong, Neal N; Zeng, Zhiwen; Cai, Zhiping

    2018-04-16

    The quality of service (QoS) regarding delay, lifetime and reliability is the key to the application of wireless sensor networks (WSNs). Data aggregation is a method to effectively reduce the data transmission volume and improve the lifetime of a network. In the previous study, a common strategy required that data wait in the queue. When the length of the queue is greater than or equal to the predetermined aggregation threshold ( N t ) or the waiting time is equal to the aggregation timer ( T t ), data are forwarded at the expense of an increase in the delay. The primary contributions of the proposed Adaptive Aggregation Routing (AAR) scheme are the following: (a) the senders select the forwarding node dynamically according to the length of the data queue, which effectively reduces the delay. In the AAR scheme, the senders send data to the nodes with a long data queue. The advantages are that first, the nodes with a long data queue need a small amount of data to perform aggregation; therefore, the transmitted data can be fully utilized to make these nodes aggregate. Second, this scheme balances the aggregating and data sending load; thus, the lifetime increases. (b) An improved AAR scheme is proposed to improve the QoS. The aggregation deadline ( T t ) and the aggregation threshold ( N t ) are dynamically changed in the network. In WSNs, nodes far from the sink have residual energy because these nodes transmit less data than the other nodes. In the improved AAR scheme, the nodes far from the sink have a small value of T t and N t to reduce delay, and the nodes near the sink are set to a large value of T t and N t to reduce energy consumption. Thus, the end to end delay is reduced, a longer lifetime is achieved, and the residual energy is fully used. Simulation results demonstrate that compared with the previous scheme, the performance of the AAR scheme is improved. This scheme reduces the delay by 14.91%, improves the lifetime by 30.91%, and increases energy

  6. A Survey on an Energy-Efficient and Energy-Balanced Routing Protocol for Wireless Sensor Networks

    Science.gov (United States)

    Ogundile, Olayinka O.; Alfa, Attahiru S.

    2017-01-01

    Wireless sensor networks (WSNs) form an important part of industrial application. There has been growing interest in the potential use of WSNs in applications such as environment monitoring, disaster management, health care monitoring, intelligence surveillance and defence reconnaissance. In these applications, the sensor nodes (SNs) are envisaged to be deployed in sizeable numbers in an outlying area, and it is quite difficult to replace these SNs after complete deployment in many scenarios. Therefore, as SNs are predominantly battery powered devices, the energy consumption of the nodes must be properly managed in order to prolong the network lifetime and functionality to a rational time. Different energy-efficient and energy-balanced routing protocols have been proposed in literature over the years. The energy-efficient routing protocols strive to increase the network lifetime by minimizing the energy consumption in each SN. On the other hand, the energy-balanced routing protocols protract the network lifetime by uniformly balancing the energy consumption among the nodes in the network. There have been various survey papers put forward by researchers to review the performance and classify the different energy-efficient routing protocols for WSNs. However, there seems to be no clear survey emphasizing the importance, concepts, and principles of load-balanced energy routing protocols for WSNs. In this paper, we provide a clear picture of both the energy-efficient and energy-balanced routing protocols for WSNs. More importantly, this paper presents an extensive survey of the different state-of-the-art energy-efficient and energy-balanced routing protocols. A taxonomy is introduced in this paper to classify the surveyed energy-efficient and energy-balanced routing protocols based on their proposed mode of communication towards the base station (BS). In addition, we classified these routing protocols based on the solution types or algorithms, and the input decision

  7. A Survey on an Energy-Efficient and Energy-Balanced Routing Protocol for Wireless Sensor Networks.

    Science.gov (United States)

    Ogundile, Olayinka O; Alfa, Attahiru S

    2017-05-10

    Wireless sensor networks (WSNs) form an important part of industrial application. There has been growing interest in the potential use of WSNs in applications such as environment monitoring, disaster management, health care monitoring, intelligence surveillance and defence reconnaissance. In these applications, the sensor nodes (SNs) are envisaged to be deployed in sizeable numbers in an outlying area, and it is quite difficult to replace these SNs after complete deployment in many scenarios. Therefore, as SNs are predominantly battery powered devices, the energy consumption of the nodes must be properly managed in order to prolong the network lifetime and functionality to a rational time. Different energy-efficient and energy-balanced routing protocols have been proposed in literature over the years. The energy-efficient routing protocols strive to increase the network lifetime by minimizing the energy consumption in each SN. On the other hand, the energy-balanced routing protocols protract the network lifetime by uniformly balancing the energy consumption among the nodes in the network. There have been various survey papers put forward by researchers to review the performance and classify the different energy-efficient routing protocols for WSNs. However, there seems to be no clear survey emphasizing the importance, concepts, and principles of load-balanced energy routing protocols for WSNs. In this paper, we provide a clear picture of both the energy-efficient and energy-balanced routing protocols for WSNs. More importantly, this paper presents an extensive survey of the different state-of-the-art energy-efficient and energy-balanced routing protocols. A taxonomy is introduced in this paper to classify the surveyed energy-efficient and energy-balanced routing protocols based on their proposed mode of communication towards the base station (BS). In addition, we classified these routing protocols based on the solution types or algorithms, and the input decision

  8. SURVEI TEKNIK CLUSTERING ROUTING BERDASARKAN MOBILITAS PADA WIRELESS AD-HOC NETWORK

    Directory of Open Access Journals (Sweden)

    I Nyoman Trisna Wirawan

    2016-01-01

    Full Text Available Wireless ad-hoc merupakan sebuah skema jaringan yang didesain supaya mampu beroperasi tanpa membutuhkan infrastruktur tetap serta bersifat otonom. Teknik flooding pada proses path discovery dalam kasus wireless ad-hoc network dapat menimbulkan masalah beban jaringan yang berlebihan. Oleh karena itu, sebuah skema clustering diusulkan untuk mengurangi adanya flooding paket yang berlebihan dengan membagi node-node dalam jaringan menjadi beberapa bagian berdasarkan parameter tertentu. Teknik ini efektifuntuk mengurangi paket yang harus dilewatkan dalam jaringan. Namun masalah muncul ketika sebuah jaringan wireless ad-hoc harus membentuk sebuah cluster dengan mempertimbangkan beberapa parameter khusus. Parameter tersebut harus disesuaikan dengan kasus yang dihadapi. Pada tulisan ini akan dibahas secara khusus mengenai penerapan skema clustering dalam lingkungan wireless ad-hoc network, baik pada MANETdan penyesuaian skema clustering yang harus dilakukan pada VANET berdasarkan mobilitasnya.

  9. COBRA: Center-Oriented Broadcast Routing Algorithms for Wireless Ad Hoc Networks

    National Research Council Canada - National Science Library

    Kang, Intae; Poovendran, Radha

    2004-01-01

    .... From the intuition that the best place to take advantage of the wireless broadcast advantage is at the center of a network deploy region, we concretize this idea into a currently best performing...

  10. Thermal-Aware Multiconstrained Intrabody QoS Routing for Wireless Body Area Networks

    OpenAIRE

    Muhammad Mostafa Monowar; Mohammad Mehedi Hassan; Fuad Bajaber; Md. Abdul Hamid; Atif Alamri

    2014-01-01

    Wireless body area networks (WBANs) can be formed including implanted biosensors for health monitoring and diagnostic purposes. However, implanted biosensors could cause thermal damages on human tissue as it exhibits temperature rise due to wireless communication and processing tasks inside the human body. Again, Quality of Service (QoS) provisioning with multiconstraints (delay and reliability) is a striking requirement for diverse application types in WBANs to meet their objectives. This pa...

  11. Overview of the Meraka wireless grid test bed for evaluation of ad-hoc routing protocols

    CSIR Research Space (South Africa)

    Johnson, D

    2007-09-01

    Full Text Available - and worst-case data rate in a network with shared channel access, as the number of hops increases. However, recent work done by the same authors [3] using a real test bed, employing laptops equipped with Standard (“802.11”) based radios..., OLSR and DYMO Index Terms—ad-hoc networks, IEEE 802.11 standard, wireless grid test bed I.INTRODUCTION One of the key challenges for researchers in the field of wireless networking protocol design, is the ability to carry out...

  12. B-iTRS: A Bio-Inspired Trusted Routing Scheme for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mingchuan Zhang

    2015-01-01

    Full Text Available In WSNs, routing algorithms need to handle dynamical changes of network topology, extra overhead, energy saving, and other requirements. Therefore, routing in WSNs is an extremely interesting and challenging issue. In this paper, we present a novel bio-inspired trusted routing scheme (B-iTRS based on ant colony optimization (ACO and Physarum autonomic optimization (PAO. For trust assessment, B-iTRS monitors neighbors’ behavior in real time, receives feedback from Sink, and then assesses neighbors’ trusts based on the acquired information. For routing scheme, each node finds routes to the Sink based on ACO and PAO. In the process of path finding, B-iTRS senses the load and trust value of each node and then calculates the link load and link trust of the found routes to support the route selection. Moreover, B-iTRS also assesses the route based on PAO to maintain the route table. Simulation results show how B-iTRS can achieve the effective performance compared to existing state-of-the-art algorithms.

  13. Selective Route Based on SNR with Cross-Layer Scheme in Wireless Ad Hoc Network

    Directory of Open Access Journals (Sweden)

    Istikmal

    2017-01-01

    Full Text Available In this study, we developed network and throughput formulation models and proposed new method of the routing protocol algorithm with a cross-layer scheme based on signal-to-noise ratio (SNR. This method is an enhancement of routing protocol ad hoc on-demand distance vector (AODV. This proposed scheme uses selective route based on the SNR threshold in the reverse route mechanism. We developed AODV SNR-selective route (AODV SNR-SR for a mechanism better than AODV SNR, that is, the routing protocol that used average or sum of path SNR, and also better than AODV which is hop-count-based. We also used selective reverse route based on SNR mechanism, replacing the earlier method to avoid routing overhead. The simulation results show that AODV SNR-SR outperforms AODV SNR and AODV in terms of throughput, end-to-end delay, and routing overhead. This proposed method is expected to support Device-to-Device (D2D communications that are concerned with the quality of the channel awareness in the development of the future Fifth Generation (5G.

  14. Underwater Acoustic Wireless Sensor Networks: Advances and Future Trends in Physical, MAC and Routing Layers

    NARCIS (Netherlands)

    Climent, S.; Sanchez, A.; Capella, J.V.; Meratnia, Nirvana; Serrano, J.J.

    2014-01-01

    This survey aims to provide a comprehensive overview of the current research on underwater wireless sensor networks, focusing on the lower layers of the communication stack, and envisions future trends and challenges. It analyzes the current state-of-the-art on the physical, medium access control

  15. Reliable Routing Protocols for Dynamic Wireless Ad Hoc and Sensor Networks

    NARCIS (Netherlands)

    Wu Jian, W.J.

    2007-01-01

    The vision of ubiquitous computing requires the development of devices and technologies, which can be pervasive without being intrusive. The basic components of such a smart environment will be small nodes with sensing and wireless communications capabilities, able to organize flexibly into a

  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. A Trust-Based Secure Routing Scheme Using the Traceback Approach for Energy-Harvesting Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jiawei Tang

    2018-03-01

    Full Text Available The Internet of things (IoT is composed of billions of sensing devices that are subject to threats stemming from increasing reliance on communications technologies. A Trust-Based Secure Routing (TBSR scheme using the traceback approach is proposed to improve the security of data routing and maximize the use of available energy in Energy-Harvesting Wireless Sensor Networks (EHWSNs. The main contributions of a TBSR are (a the source nodes send data and notification to sinks through disjoint paths, separately; in such a mechanism, the data and notification can be verified independently to ensure their security. (b Furthermore, the data and notification adopt a dynamic probability of marking and logging approach during the routing. Therefore, when attacked, the network will adopt the traceback approach to locate and clear malicious nodes to ensure security. The probability of marking is determined based on the level of battery remaining; when nodes harvest more energy, the probability of marking is higher, which can improve network security. Because if the probability of marking is higher, the number of marked nodes on the data packet routing path will be more, and the sink will be more likely to trace back the data packet routing path and find malicious nodes according to this notification. When data packets are routed again, they tend to bypass these malicious nodes, which make the success rate of routing higher and lead to improved network security. When the battery level is low, the probability of marking will be decreased, which is able to save energy. For logging, when the battery level is high, the network adopts a larger probability of marking and smaller probability of logging to transmit notification to the sink, which can reserve enough storage space to meet the storage demand for the period of the battery on low level; when the battery level is low, increasing the probability of logging can reduce energy consumption. After the level of

  18. A Trust-Based Secure Routing Scheme Using the Traceback Approach for Energy-Harvesting Wireless Sensor Networks.

    Science.gov (United States)

    Tang, Jiawei; Liu, Anfeng; Zhang, Jian; Xiong, Neal N; Zeng, Zhiwen; Wang, Tian

    2018-03-01

    The Internet of things (IoT) is composed of billions of sensing devices that are subject to threats stemming from increasing reliance on communications technologies. A Trust-Based Secure Routing (TBSR) scheme using the traceback approach is proposed to improve the security of data routing and maximize the use of available energy in Energy-Harvesting Wireless Sensor Networks (EHWSNs). The main contributions of a TBSR are (a) the source nodes send data and notification to sinks through disjoint paths, separately; in such a mechanism, the data and notification can be verified independently to ensure their security. (b) Furthermore, the data and notification adopt a dynamic probability of marking and logging approach during the routing. Therefore, when attacked, the network will adopt the traceback approach to locate and clear malicious nodes to ensure security. The probability of marking is determined based on the level of battery remaining; when nodes harvest more energy, the probability of marking is higher, which can improve network security. Because if the probability of marking is higher, the number of marked nodes on the data packet routing path will be more, and the sink will be more likely to trace back the data packet routing path and find malicious nodes according to this notification. When data packets are routed again, they tend to bypass these malicious nodes, which make the success rate of routing higher and lead to improved network security. When the battery level is low, the probability of marking will be decreased, which is able to save energy. For logging, when the battery level is high, the network adopts a larger probability of marking and smaller probability of logging to transmit notification to the sink, which can reserve enough storage space to meet the storage demand for the period of the battery on low level; when the battery level is low, increasing the probability of logging can reduce energy consumption. After the level of battery

  19. A Hidden-Exposed Terminal Interference Aware Routing Metric for Multi-Radio and Multi-Rate Wireless Mesh Networks

    Science.gov (United States)

    Jin, Shouguang; Mase, Kenichi

    In this paper, we propose a novel Hidden-terminal and Exposed-terminal Interference aware routing metric (HEI-ETT) for Multi-Radio and Multi-Rate wireless mesh networks in which each stationary mesh node is equipped with multi-radio interfaces that relays traffic to the extend networks by using multi-hop transmissions. We have two main design goals for HEI-ETT. First, we will characterize interferences as Hidden-terminal Interference and Exposed-terminal Interference regardless of inter- or intra-flow interference and should take into account both interference effects while computing the path metric. Second, an efficient transmission rate adaptation should be employed in HEI-ETT to enhance the network throughput. We incorporated our metric in well known Optimized Link State Routing protocol version 2 (OLSRv2) which is one of the two standard routing protocols for MANETs and evaluated the performance of our metric by simulation. The results show that our metric outperforms existing metrics such as ETX, ETT and WCETT.

  20. Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

    Science.gov (United States)

    Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

    2018-01-01

    Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio. PMID:29562628

  1. An empirical evaluation of lightweight random walk based routing protocol in duty cycle aware wireless sensor networks.

    Science.gov (United States)

    Mian, Adnan Noor; Fatima, Mehwish; Khan, Raees; Prakash, Ravi

    2014-01-01

    Energy efficiency is an important design paradigm in Wireless Sensor Networks (WSNs) and its consumption in dynamic environment is even more critical. Duty cycling of sensor nodes is used to address the energy consumption problem. However, along with advantages, duty cycle aware networks introduce some complexities like synchronization and latency. Due to their inherent characteristics, many traditional routing protocols show low performance in densely deployed WSNs with duty cycle awareness, when sensor nodes are supposed to have high mobility. In this paper we first present a three messages exchange Lightweight Random Walk Routing (LRWR) protocol and then evaluate its performance in WSNs for routing low data rate packets. Through NS-2 based simulations, we examine the LRWR protocol by comparing it with DYMO, a widely used WSN protocol, in both static and dynamic environments with varying duty cycles, assuming the standard IEEE 802.15.4 in lower layers. Results for the three metrics, that is, reliability, end-to-end delay, and energy consumption, show that LRWR protocol outperforms DYMO in scalability, mobility, and robustness, showing this protocol as a suitable choice in low duty cycle and dense WSNs.

  2. On the MAC/network/energy performance evaluation of Wireless Sensor Networks: Contrasting MPH, AODV, DSR and ZTR routing protocols.

    Science.gov (United States)

    Del-Valle-Soto, Carolina; Mex-Perera, Carlos; Orozco-Lugo, Aldo; Lara, Mauricio; Galván-Tejada, Giselle M; Olmedo, Oscar

    2014-12-02

    Wireless Sensor Networks deliver valuable information for long periods, then it is desirable to have optimum performance, reduced delays, low overhead, and reliable delivery of information. In this work, proposed metrics that influence energy consumption are used for a performance comparison among our proposed routing protocol, called Multi-Parent Hierarchical (MPH), the well-known protocols for sensor networks, Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Zigbee Tree Routing (ZTR), all of them working with the IEEE 802.15.4 MAC layer. Results show how some communication metrics affect performance, throughput, reliability and energy consumption. It can be concluded that MPH is an efficient protocol since it reaches the best performance against the other three protocols under evaluation, such as 19.3% reduction of packet retransmissions, 26.9% decrease of overhead, and 41.2% improvement on the capacity of the protocol for recovering the topology from failures with respect to AODV protocol. We implemented and tested MPH in a real network of 99 nodes during ten days and analyzed parameters as number of hops, connectivity and delay, in order to validate our Sensors 2014, 14 22812 simulator and obtain reliable results. Moreover, an energy model of CC2530 chip is proposed and used for simulations of the four aforementioned protocols, showing that MPH has 15.9% reduction of energy consumption with respect to AODV, 13.7% versus DSR, and 5% against ZTR.

  3. Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Shaobo Wu

    2018-03-01

    Full Text Available Wireless sensor networks (WSNs involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

  4. A fully distributed geo-routing scheme for wireless sensor networks

    KAUST Repository

    Bader, Ahmed

    2013-12-01

    When marrying randomized distributed space-time coding (RDSTC) to beaconless geo-routing, new performance horizons can be created. In order to reach those horizons, however, beaconless geo-routing protocols must evolve to operate in a fully distributed fashion. In this letter, we expose a technique to construct a fully distributed geo-routing scheme in conjunction with RDSTC. We then demonstrate the performance gains of this novel scheme by comparing it to one of the prominent classical schemes. © 2013 IEEE.

  5. R-bUCRP: A Novel Reputation-Based Uneven Clustering Routing Protocol for Cognitive Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Mingchuan Zhang

    2016-01-01

    Full Text Available Energy of nodes is an important factor that affects the performance of Wireless Sensor Networks (WSNs, especially in the case of existing selfish nodes, which attracted many researchers’ attention recently. In this paper, we present a reputation-based uneven clustering routing protocol (R-bUCRP considering both energy saving and reputation assessment. In the cluster establishment phase, we adopt an uneven clustering mechanism which controls the competitive scope of cluster head candidates to save the energy of WSNs. In the cluster heads election phase, the residual energy and reputation value are used as the indexes to select the optimal cluster head, where the reputation mechanism is introduced to support reputation assessment. Simulation results show that the proposed R-bUCRP can save node energy consumption, balance network energy distribution, and prolong network lifetime.

  6. Analysis of In-Route Wireless Charging for the Shuttle System at Zion National Park

    Energy Technology Data Exchange (ETDEWEB)

    Meintz, Andrew; Prohaska, Robert; Konan, Arnaud; Ragatz, Adam; Markel, Tony; Kelly, Ken

    2016-12-08

    System right-sizing is critical to implementation of wireless power transfer (WPT) for electric vehicles. This study will analyze potential WPT scenarios for the electrification of shuttle buses at Zion National Park utilizing a modelling tool developed by the National Renewable Energy Laboratory called WPTSim. This tool uses second-by-second speed, location, and road grade data from the conventional shuttles in operation to simulate the incorporation of WPT at fine granularity. Vehicle power and state of charge are simulated over the drive cycle to evaluate potential system designs. The required battery capacity is determined based on the rated power at a variable number of charging locations. The outcome of this work is an analysis of the design tradeoffs for the electrification of the shuttle fleet with wireless charging versus conventional overnight charging.

  7. Analysis of In-Route Wireless Charging for the Shuttle System at Zion National Park

    Energy Technology Data Exchange (ETDEWEB)

    Meintz, Andrew; Prohaska, Robert; Konan, Arnaud; Ragatz, Adam; Markel, Tony; Kelly, Ken

    2016-10-05

    System right-sizing is critical to implementation of wireless power transfer (WPT) for electric vehicles (EVs). This study will analyze potential WPT scenarios for the electrification of shuttle buses at Zion National Park utilizing a modelling tool developed by NREL called WPTSim. This tool uses second-by-second speed, location, and road grade data from the conventional shuttles in operation to simulate the incorporation of WPT at fine granularity. Vehicle power and state of charge are simulated over the drive cycle to evaluate potential system designs. The required battery capacity is determined based on the rated power at a variable number of charging locations. The outcome of this work is an analysis of the design tradeoffs for the electrification of the shuttle fleet with wireless charging versus conventional overnight charging.

  8. DARAL: A Dynamic and Adaptive Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Francisco José Estévez

    2016-06-01

    Full Text Available The evolution of Smart City projects is pushing researchers and companies to develop more efficient embedded hardware and also more efficient communication technologies. These communication technologies are the focus of this work, presenting a new routing algorithm based on dynamically-allocated sub-networks and node roles. Among these features, our algorithm presents a fast set-up time, a reduced overhead and a hierarchical organization, which allows for the application of complex management techniques. This work presents a routing algorithm based on a dynamically-allocated hierarchical clustering, which uses the link quality indicator as a reference parameter, maximizing the network coverage and minimizing the control message overhead and the convergence time. The present work based its test scenario and analysis in the density measure, considered as a node degree. The routing algorithm is compared with some of the most well known routing algorithms for different scenario densities.

  9. Model-Checking Driven Design of QoS-Based Routing Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zhi Chen

    2015-01-01

    Full Text Available Accurate and reliable routing protocols with Quality of Service (QoS support determine the mission-critical application efficiency in WSNs. This paper proposes a model-checking design driven framework for designing the QoS-based routing protocols of WSNs, which involves the light-weight design process, the timed automata model, and the alternative QoS verification properties. The accurate feedback of continually model checking in the iterative design process effectively stimulates the parameter tuning of the protocols. We demonstrate the straightforward and modular characteristics of the proposed framework in designing a prototype QoS-based routing protocol. The prototype study shows that the model-checking design framework may complement other design methods and ensure the QoS implementation of the QoS-based routing protocol design for WSNs.

  10. 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...

  11. Towards designing energy-efficient routing protocol for wireless mesh networks

    CSIR Research Space (South Africa)

    Dludla, AG

    2009-08-01

    Full Text Available Different studies have proposed number of routing protocols to overcome data transmission challenges. Very few of these protocols consider node energy. In this study, the state of art work from various studies is reviewed and compared based...

  12. Design and Development of Energy Efficient Routing Protocol for Wireless Sensor Networks using Fuzzy Logic

    OpenAIRE

    K. Nattar Kannan; B. Paramasivan

    2014-01-01

    Wireless Sensor Networks (WSNs) is a emerging technology of real time embedded systems for a variety of applications. In general, WSNs has great challenges in the factor of limited computation, energy and memory resources. Clustering techniques play a vital role in WSNs to increase the network lifetime and also made energy efficiency. Existing clustering approaches like LEACH uses neighboring information of the nodes for selecting cluster heads and other nodes spent more energy for transmitti...

  13. An Efficient Data Collection Protocol Based on Multihop Routing and Single-Node Cooperation in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Guoqiang Zheng

    2014-01-01

    Full Text Available Considering the constrained resource and energy in wireless sensor networks, an efficient data collection protocol named ESCDD which adopts the multihop routing technology and the single-node selection cooperative communication is proposed to make the communication protocol more simple and easy to realize for the large-scale multihop wireless sensor networks. ESCDD uses the greedy strategy and the control information based on RTS/CTS to select forwarding nodes. Then, the hops in the multihop data transmission are reduced. Based on the power control in physical layer and the control frame called CoTS in MAC layer, ESCDD chooses a single cooperative node to perform cooperative transmission. The receiving node adopts maximal ratio combining (MRC to recover original data. The energy consumption per hop is reduced. Furthermore, the total energy consumption in data collection process is shared by more nodes and the network lifetime is extended. Compared with GeRaF, EERNFS, and REEFG protocol, the simulation results show that ESCDD can effectively reduce the average delay of multihop data transmission, improve the successful delivery rate of data packets, significantly save the energy consumption of network nodes, and make the energy consumption more balanced.

  14. SIMULATION AND ANALYSIS OF GREEDY ROUTING PROTOCOL IN VIEW OF ENERGY CONSUMPTION AND NETWORK LIFETIME IN THREE DIMENSIONAL UNDERWATER WIRELESS SENSOR NETWORK

    Directory of Open Access Journals (Sweden)

    SHEENA KOHLI

    2017-11-01

    Full Text Available Underwater Wireless Sensor Network (UWSN comprises of a number of miniature sized sensing devices deployed in the sea or ocean, connected by dint of acoustic links to each other. The sensors trap the ambient conditions and transmit the data from one end to another. For transmission of data in any medium, routing protocols play a crucial role. Moreover, being battery limited, an unavoidable parameter to be considered in operation and analysis of protocols is the network energy and the network lifetime. The paper discusses the greedy routing protocol for underwater wireless sensor networks. The simulation of this routing protocol also takes into consideration the characteristics of acoustic communication like attenuation, transmission loss, signal to noise ratio, noise, propagation delay. The results from these observations may be used to construct an accurate underwater communication model.

  15. A Secure Routing Protocol for Wireless Sensor Networks Considering Secure Data Aggregation.

    Science.gov (United States)

    Rahayu, Triana Mugia; Lee, Sang-Gon; Lee, Hoon-Jae

    2015-06-26

    The commonly unattended and hostile deployments of WSNs and their resource-constrained sensor devices have led to an increasing demand for secure energy-efficient protocols. Routing and data aggregation receive the most attention since they are among the daily network routines. With the awareness of such demand, we found that so far there has been no work that lays out a secure routing protocol as the foundation for a secure data aggregation protocol. We argue that the secure routing role would be rendered useless if the data aggregation scheme built on it is not secure. Conversely, the secure data aggregation protocol needs a secure underlying routing protocol as its foundation in order to be effectively optimal. As an attempt for the solution, we devise an energy-aware protocol based on LEACH and ESPDA that combines secure routing protocol and secure data aggregation protocol. We then evaluate its security effectiveness and its energy-efficiency aspects, knowing that there are always trade-off between both.

  16. A Secure Routing Protocol for Wireless Sensor Networks Considering Secure Data Aggregation

    Directory of Open Access Journals (Sweden)

    Triana Mugia Rahayu

    2015-06-01

    Full Text Available The commonly unattended and hostile deployments of WSNs and their resource-constrained sensor devices have led to an increasing demand for secure energy-efficient protocols. Routing and data aggregation receive the most attention since they are among the daily network routines. With the awareness of such demand, we found that so far there has been no work that lays out a secure routing protocol as the foundation for a secure data aggregation protocol. We argue that the secure routing role would be rendered useless if the data aggregation scheme built on it is not secure. Conversely, the secure data aggregation protocol needs a secure underlying routing protocol as its foundation in order to be effectively optimal. As an attempt for the solution, we devise an energy-aware protocol based on LEACH and ESPDA that combines secure routing protocol and secure data aggregation protocol. We then evaluate its security effectiveness and its energy-efficiency aspects, knowing that there are always trade-off between both.

  17. A Data-Gathering Scheme with Joint Routing and Compressive Sensing Based on Modified Diffusion Wavelets in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xiangping Gu

    2018-02-01

    Full Text Available Compressive sensing (CS-based data gathering is a promising method to reduce energy consumption in wireless sensor networks (WSNs. Traditional CS-based data-gathering approaches require a large number of sensor nodes to participate in each CS measurement task, resulting in high energy consumption, and do not guarantee load balance. In this paper, we propose a sparser analysis that depends on modified diffusion wavelets, which exploit sensor readings’ spatial correlation in WSNs. In particular, a novel data-gathering scheme with joint routing and CS is presented. A modified ant colony algorithm is adopted, where next hop node selection takes a node’s residual energy and path length into consideration simultaneously. Moreover, in order to speed up the coverage rate and avoid the local optimal of the algorithm, an improved pheromone impact factor is put forward. More importantly, theoretical proof is given that the equivalent sensing matrix generated can satisfy the restricted isometric property (RIP. The simulation results demonstrate that the modified diffusion wavelets’ sparsity affects the sensor signal and has better reconstruction performance than DFT. Furthermore, our data gathering with joint routing and CS can dramatically reduce the energy consumption of WSNs, balance the load, and prolong the network lifetime in comparison to state-of-the-art CS-based methods.

  18. A Data-Gathering Scheme with Joint Routing and Compressive Sensing Based on Modified Diffusion Wavelets in Wireless Sensor Networks.

    Science.gov (United States)

    Gu, Xiangping; Zhou, Xiaofeng; Sun, Yanjing

    2018-02-28

    Compressive sensing (CS)-based data gathering is a promising method to reduce energy consumption in wireless sensor networks (WSNs). Traditional CS-based data-gathering approaches require a large number of sensor nodes to participate in each CS measurement task, resulting in high energy consumption, and do not guarantee load balance. In this paper, we propose a sparser analysis that depends on modified diffusion wavelets, which exploit sensor readings' spatial correlation in WSNs. In particular, a novel data-gathering scheme with joint routing and CS is presented. A modified ant colony algorithm is adopted, where next hop node selection takes a node's residual energy and path length into consideration simultaneously. Moreover, in order to speed up the coverage rate and avoid the local optimal of the algorithm, an improved pheromone impact factor is put forward. More importantly, theoretical proof is given that the equivalent sensing matrix generated can satisfy the restricted isometric property (RIP). The simulation results demonstrate that the modified diffusion wavelets' sparsity affects the sensor signal and has better reconstruction performance than DFT. Furthermore, our data gathering with joint routing and CS can dramatically reduce the energy consumption of WSNs, balance the load, and prolong the network lifetime in comparison to state-of-the-art CS-based methods.

  19. AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Farzad Kiani

    2016-01-01

    Full Text Available Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase, the sensors are placed into virtual layers. The second phase (data transmission is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.

  20. Joint Optimization of Sensor Selection and Routing for Distributed Estimation in Wireless Sensor Networks

    OpenAIRE

    Shah, Santosh

    2014-01-01

    Avances recientes en redes inalámbricos de sensores (WSNs, Wireless Sensor Networks) han posibilitado que pequeños sensores, baratos y con recursos limitados tanto en sensado, comunicación, como en computación, sean desplegados a gran escala. En consecuencia, las WSNs pueden ofrecer diversos servicios en importantes aplicaciones para la sociedad. Entre las varias restricciones que aparecen en el diseño de WSNs, tales como la limitación en energía disponible, procesamiento y memoria, la limita...

  1. A Decentralized Fuzzy C-Means-Based Energy-Efficient Routing Protocol for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Osama Moh’d Alia

    2014-01-01

    Full Text Available Energy conservation in wireless sensor networks (WSNs is a vital consideration when designing wireless networking protocols. In this paper, we propose a Decentralized Fuzzy Clustering Protocol, named DCFP, which minimizes total network energy dissipation to promote maximum network lifetime. The process of constructing the infrastructure for a given WSN is performed only once at the beginning of the protocol at a base station, which remains unchanged throughout the network’s lifetime. In this initial construction step, a fuzzy C-means algorithm is adopted to allocate sensor nodes into their most appropriate clusters. Subsequently, the protocol runs its rounds where each round is divided into a CH-Election phase and a Data Transmission phase. In the CH-Election phase, the election of new cluster heads is done locally in each cluster where a new multicriteria objective function is proposed to enhance the quality of elected cluster heads. In the Data Transmission phase, the sensing and data transmission from each sensor node to their respective cluster head is performed and cluster heads in turn aggregate and send the sensed data to the base station. Simulation results demonstrate that the proposed protocol improves network lifetime, data delivery, and energy consumption compared to other well-known energy-efficient protocols.

  2. A decentralized fuzzy C-means-based energy-efficient routing protocol for wireless sensor networks.

    Science.gov (United States)

    Alia, Osama Moh'd

    2014-01-01

    Energy conservation in wireless sensor networks (WSNs) is a vital consideration when designing wireless networking protocols. In this paper, we propose a Decentralized Fuzzy Clustering Protocol, named DCFP, which minimizes total network energy dissipation to promote maximum network lifetime. The process of constructing the infrastructure for a given WSN is performed only once at the beginning of the protocol at a base station, which remains unchanged throughout the network's lifetime. In this initial construction step, a fuzzy C-means algorithm is adopted to allocate sensor nodes into their most appropriate clusters. Subsequently, the protocol runs its rounds where each round is divided into a CH-Election phase and a Data Transmission phase. In the CH-Election phase, the election of new cluster heads is done locally in each cluster where a new multicriteria objective function is proposed to enhance the quality of elected cluster heads. In the Data Transmission phase, the sensing and data transmission from each sensor node to their respective cluster head is performed and cluster heads in turn aggregate and send the sensed data to the base station. Simulation results demonstrate that the proposed protocol improves network lifetime, data delivery, and energy consumption compared to other well-known energy-efficient protocols.

  3. Lightweight Context Aware Routing in Wireless Sensor Networks for Real Environments

    Directory of Open Access Journals (Sweden)

    Samia Aijaz

    2015-07-01

    Full Text Available Design and implementation of a WSN (Wireless Sensor Network that can efficiently work for a longer time period must include identification of the deployment environment context and to conform to the behavior of the sensor nodes. The context information when treated with evaluation factor becomes a process of context awareness and the evaluation factor is called the context attribute. In this paper, we consider the context factor of energy. The paper identifies analyses and evaluates efficiency of two when used in a context aware environment. Furthermore, the study also highlights the strengths and weaknesses of sensor SPIN (Sensor Protocol for Information via Negotiation and LEACH (Low Energy Adaptive Clustering Hierarchy protocols with respect to the support for WSN with heavy network traffic conditions. The performance has been evaluated in terms of energy efficiency, data packet transmission, network status, data management, reliability, etc.

  4. Energy Efficient Routing and Node Activity Scheduling in the OCARI Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Saoucene Mahfoudh

    2010-08-01

    Full Text Available Sensor nodes are characterized by a small size, a low cost, an advanced communication technology, but also a limited amount of energy. Energy efficient strategies are required in such networks to maximize network lifetime. In this paper, we focus on a solution integrating energy efficient routing and node activity scheduling. The energy efficient routing we propose, called EOLSR, selects the route and minimizes the energy consumed by an end-to-end transmission, while avoiding nodes with low residual energy. Simulation results show that EOLSR outperforms the solution selecting the route of minimum energy as well as the solution based on node residual energy. Cross-layering allows EOLSR to use information from the application layer or the MAC layer to reduce its overhead and increase network lifetime. Node activity scheduling is based on the following observation: the sleep state is the least power consuming state. So, to schedule node active and sleeping periods, we propose SERENA that colors all network nodes using a small number of colors, such that two nodes with the same color can transmit without interfering. The node color is mapped into a time slot during which the node can transmit. Consequently, each node is awake during its slot and the slots of its one-hop neighbors, and sleeps in the remaining time. We evaluate SERENA benefits obtained in terms of bandwidth, delay and energy. We also show how cross-layering with the application layer can improve the end-to-end delays for data gathering applications.

  5. A survey on the taxonomy of cluster-based routing protocols for homogeneous wireless sensor networks.

    Science.gov (United States)

    Naeimi, Soroush; Ghafghazi, Hamidreza; Chow, Chee-Onn; Ishii, Hiroshi

    2012-01-01

    The past few years have witnessed increased interest among researchers in cluster-based protocols for homogeneous networks because of their better scalability and higher energy efficiency than other routing protocols. Given the limited capabilities of sensor nodes in terms of energy resources, processing and communication range, the cluster-based protocols should be compatible with these constraints in either the setup state or steady data transmission state. With focus on these constraints, we classify routing protocols according to their objectives and methods towards addressing the shortcomings of clustering process on each stage of cluster head selection, cluster formation, data aggregation and data communication. We summarize the techniques and methods used in these categories, while the weakness and strength of each protocol is pointed out in details. Furthermore, taxonomy of the protocols in each phase is given to provide a deeper understanding of current clustering approaches. Ultimately based on the existing research, a summary of the issues and solutions of the attributes and characteristics of clustering approaches and some open research areas in cluster-based routing protocols that can be further pursued are provided.

  6. Region-Based Collision Avoidance Beaconless Geographic Routing Protocol in Wireless Sensor Networks.

    Science.gov (United States)

    Lee, JeongCheol; Park, HoSung; Kang, SeokYoon; Kim, Ki-Il

    2015-06-05

    Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols.

  7. A Survey on the Taxonomy of Cluster-Based Routing Protocols for Homogeneous Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Hiroshi Ishii

    2012-05-01

    Full Text Available The past few years have witnessed increased interest among researchers in cluster-based protocols for homogeneous networks because of their better scalability and higher energy efficiency than other routing protocols. Given the limited capabilities of sensor nodes in terms of energy resources, processing and communication range, the cluster-based protocols should be compatible with these constraints in either the setup state or steady data transmission state. With focus on these constraints, we classify routing protocols according to their objectives and methods towards addressing the shortcomings of clustering process on each stage of cluster head selection, cluster formation, data aggregation and data communication. We summarize the techniques and methods used in these categories, while the weakness and strength of each protocol is pointed out in details. Furthermore, taxonomy of the protocols in each phase is given to provide a deeper understanding of current clustering approaches. Ultimately based on the existing research, a summary of the issues and solutions of the attributes and characteristics of clustering approaches and some open research areas in cluster-based routing protocols that can be further pursued are provided.

  8. An Energy-Aware Routing Protocol for Query-Based Applications in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Ehsan Ahvar

    2014-01-01

    attempt to efficiently distribute the consumption of energy throughout the network. In general terms, energy saving protocols are not necessarily good at balancing energy consumption and energy balancing protocols are not always good at reducing energy consumption. In this paper, we propose an energy-aware routing protocol (ERP for query-based applications in WSNs, which offers a good trade-off between traditional energy balancing and energy saving objectives and supports a soft real time packet delivery. This is achieved by means of fuzzy sets and learning automata techniques along with zonal broadcasting to decrease total energy consumption.

  9. OPTIMASI OLSR ROUTING PROTOCOL PADA JARINGAN WIRELESS MESH DENGAN ADAPTIVE REFRESHING TIME INTERVAL DAN ENHANCE MULTI POINT RELAY SELECTING ALGORITHM

    Directory of Open Access Journals (Sweden)

    Faosan Mapa

    2014-01-01

    Full Text Available Normal 0 false false false IN X-NONE X-NONE MicrosoftInternetExplorer4 /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Wireless Mesh Network (WMN adalah suatu konektivitas jaringan yang self-organized, self-configured dan multi-hop. Tujuan dari WMN adalah menawarkan pengguna suatu bentuk jaringan nirkabel yang dapat dengan mudah berkomunikasi dengan jaringan konvensional dengan kecepatan tinggi dan dengan cakupan yang lebih luas serta biaya awal yang minimal. Diperlukan suatu desain protokol routing yang efisien untuk WMN yang secara adaptif dapat mendukung mesh routers dan mesh clients. Dalam tulisan ini, diusulkan untuk mengoptimalkan protokol OLSR, yang merupakan protokol routing proaktif. Digunakan heuristik yang meningkatkan protokol OLSR melalui adaptive refreshing time interval dan memperbaiki metode MPR selecting algorithm. Suatu analisa dalam meningkatkan protokol OLSR melalui adaptive refreshing time interval dan memperbaiki algoritma pemilihan MPR menunjukkan kinerja yang signifikan dalam hal throughput jika dibandingkan dengan protokol OLSR yang asli. Akan tetapi, terdapat kenaikan dalam hal delay. Pada simulasi yang dilakukan dapat disimpulkan bahwa OLSR dapat dioptimalkan dengan memodifikasi pemilihan node MPR berdasarkan cost effective dan penyesuaian waktu interval refreshing hello message sesuai dengan keadaan

  10. Anonymity Preserving Routing In Location Privacy Schemes In Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    R Regin

    2015-12-01

    Full Text Available Location privacy measures need to be developed to prevent the opponent from determining the physical locations of source sensors and sinks. An opponent can easily intercept network traffic due to the use of a broadcast medium for routing packets and get detailed information such as packet transmission time and frequency to perform traffic analysis and infer the locations of monitored objects and data sinks. On the other hand, sensors usually have limited processing speed and energy supplies. It is very expensive to apply traditional anonymous communication techniques for hiding the communication between sensor nodes and sinks. The existing source-location privacy protects the location of monitored objects to increase the number of messages sent by the source before the object is located by the attacker. The flooding technique has the source node send each packet through numerous paths to a sink making it difficult for an opponent to trace the source. The locations of sinks can be protected from a local eavesdropper by hashing the ID field in the packet header. But opponent can track sinks by carrying out time correlation and rate monitoring attacks. Besides protection some source nodes are transferring relatively large amounts of data in existing system. As a result, these nodes run out of battery faster due to improper position of nodes and sinks. Thus in the proposed system the sinks should be located as optimally as possible to reduce traffic flow and energy consumption for sensor nodes. Hence Sink placement problem is resolved for minimizing the delay as well as maximizing the lifetime of a WSN. Thus proposed system is efficient in terms of overhead and functionality when compared to existing system.

  11. On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks

    Directory of Open Access Journals (Sweden)

    Muhammad Mostafa Monowar

    2015-06-01

    Full Text Available In this paper, we address the thermal rise and Quality-of-Service (QoS provisioning issue for an intra-body Wireless Body Area Network (WBAN having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s, and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches.

  12. On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks.

    Science.gov (United States)

    Monowar, Muhammad Mostafa; Bajaber, Fuad

    2015-06-15

    In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches.

  13. On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks

    OpenAIRE

    Monowar, Muhammad Mostafa; Bajaber, Fuad

    2015-01-01

    In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level....

  14. Routing in IPv6 over Low-Power Wireless Personal Area Networks (6LoWPAN: A Survey

    Directory of Open Access Journals (Sweden)

    Vinay Kumar

    2012-01-01

    Full Text Available 6LoWPANs (IPv6-based Low-Power Personal Area Networks are formulated by devices that are compatible with the IEEE 802.15.4 standard. To moderate the effects of network mobility, the Internet Protocol (IP does not calculate routes; it is left to a routing protocol, which maintains routing tables in the routers. 6LowPAN uses an adaptation layer between the network (IPv6 and data link layer (IEEE802.15.4 MAC to fragment and reassemble IPv6 packets. The routing in 6LoWPAN is primarily divided on the basis of routing decision taken on adaptation or network layer. The objective of this paper is to present a state-of-the-art survey of existing routing protocols: LOAD, M-LOAD, DYMO-Low, Hi-Low, Extended Hi-Low, and S-AODV. These routing protocols have compared on the basis of different metric like energy consumption, memory uses, mobility, scalability, routing delay, an RERR message, a Hello message, and local repair. We have also presented the taxonomy of routing requirement; parameter for evaluating routing algorithm, and it was found that the routing protocol has its own advantages depending upon the application where it is used.

  15. An analytic Study of the Key Factors In uencing the Design and Routing Techniques of a Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Yogita Bahuguna

    2017-03-01

    Full Text Available A wireless sensor network contains various nodes having certain sensing, processing and communication capabilities. Actually they are multifunctional battery operated nodes called motes. These motes are small in size and battery constrained. They are operated by a power source. A wireless sensor network consists of a huge number of tiny sensor nodes which are deployed either randomly or according to some predefined distribution. The sensors nodes in a sensor network are cooperative among themselves having self-organizing ability. This ensures that a wireless network serves a wide variety of applications. Few of them are weather monitoring, health, security and military etc. As their applications are wide, this requires that sensors in a sensor network must play their role very efficiently. But, as discussed above, the sensor nodes have energy limitation. This limitation leads failure of nodes after certain round of communication. So, a sensor network suffers with sensors having energy limitations. Beside this, sensor nodes in a sensor network must fulfill connectivity and coverage requirements. In this paper, we have discussed various issues affecting the design of a wireless sensor network. This provides the readers various research issues in designing a wireless sensor network.

  16. Protocols for Detection and Removal of Wormholes for Secure Routing and Neighborhood Creation in Wireless Ad Hoc Networks

    Science.gov (United States)

    Hayajneh, Thaier Saleh

    2009-01-01

    Wireless ad hoc networks are suitable and sometimes the only solution for several applications. Many applications, particularly those in military and critical civilian domains (such as battlefield surveillance and emergency rescue) require that ad hoc networks be secure and stable. In fact, security is one of the main barriers to the extensive use…

  17. A Data-Gathering Scheme with Joint Routing and Compressive Sensing Based on Modified Diffusion Wavelets in Wireless Sensor Networks

    OpenAIRE

    Xiangping Gu; Xiaofeng Zhou; Yanjing Sun

    2018-01-01

    Compressive sensing (CS)-based data gathering is a promising method to reduce energy consumption in wireless sensor networks (WSNs). Traditional CS-based data-gathering approaches require a large number of sensor nodes to participate in each CS measurement task, resulting in high energy consumption, and do not guarantee load balance. In this paper, we propose a sparser analysis that depends on modified diffusion wavelets, which exploit sensor readings’ spatial correlation in WSNs. In particul...

  18. Utilizing joint routing and capacity assignment algorithms to achieve inter- and intra-group delay fairness in multi-rate multicast wireless sensor networks.

    Science.gov (United States)

    Lin, Frank Yeong-Sung; Hsiao, Chiu-Han; Lin, Leo Shih-Chang; Wen, Yean-Fu

    2013-03-14

    Recent advance in wireless sensor network (WSN) applications such as the Internet of Things (IoT) have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS) is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay) becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency.

  19. Utilizing Joint Routing and Capacity Assignment Algorithms to Achieve Inter- and Intra-Group Delay Fairness in Multi-Rate Multicast Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Yean-Fu Wen

    2013-03-01

    Full Text Available Recent advance in wireless sensor network (WSN applications such as the Internet of Things (IoT have attracted a lot of attention. Sensor nodes have to monitor and cooperatively pass their data, such as temperature, sound, pressure, etc. through the network under constrained physical or environmental conditions. The Quality of Service (QoS is very sensitive to network delays. When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay becomes a very critical problem. In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed. Granting equal consideration to both network link capacity assignment and routing strategies for each multicast group guarantees the intra-group and inter-group delay fairness of end-to-end delay. Minimizing delay and achieving fairness is ultimately achieved through the Lagrangean Relaxation method and Subgradient Optimization Technique. Test results indicate that the new system runs with greater effectiveness and efficiency.

  20. 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

  1. An Energy-Efficient Secure Routing and Key Management Scheme for Mobile Sinks in Wireless Sensor Networks Using Deployment Knowledge

    Directory of Open Access Journals (Sweden)

    Le Xuan Hung

    2008-12-01

    Full Text Available For many sensor network applications such as military or homeland security, it is essential for users (sinks to access the sensor network while they are moving. Sink mobility brings new challenges to secure routing in large-scale sensor networks. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. Also, studies and experiences have shown that considering security during design time is the best way to provide security for sensor network routing. This paper presents an energy-efficient secure routing and key management for mobile sinks in sensor networks, called SCODEplus. It is a significant extension of our previous study in five aspects: (1 Key management scheme and routing protocol are considered during design time to increase security and efficiency; (2 The network topology is organized in a hexagonal plane which supports more efficiency than previous square-grid topology; (3 The key management scheme can eliminate the impacts of node compromise attacks on links between non-compromised nodes; (4 Sensor node deployment is based on Gaussian distribution which is more realistic than uniform distribution; (5 No GPS or like is required to provide sensor node location information. Our security analysis demonstrates that the proposed scheme can defend against common attacks in sensor networks including node compromise attacks, replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Both mathematical and simulation-based performance evaluation show that the SCODEplus significantly reduces the communication overhead, energy consumption, packet delivery latency while it always delivers more than 97 percent of packets successfully.

  2. An Energy-Efficient Secure Routing and Key Management Scheme for Mobile Sinks in Wireless Sensor Networks Using Deployment Knowledge.

    Science.gov (United States)

    Hung, Le Xuan; Canh, Ngo Trong; Lee, Sungyoung; Lee, Young-Koo; Lee, Heejo

    2008-12-03

    For many sensor network applications such as military or homeland security, it is essential for users (sinks) to access the sensor network while they are moving. Sink mobility brings new challenges to secure routing in large-scale sensor networks. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. Also, studies and experiences have shown that considering security during design time is the best way to provide security for sensor network routing. This paper presents an energy-efficient secure routing and key management for mobile sinks in sensor networks, called SCODE plus . It is a significant extension of our previous study in five aspects: (1) Key management scheme and routing protocol are considered during design time to increase security and efficiency; (2) The network topology is organized in a hexagonal plane which supports more efficiency than previous square-grid topology; (3) The key management scheme can eliminate the impacts of node compromise attacks on links between non-compromised nodes; (4) Sensor node deployment is based on Gaussian distribution which is more realistic than uniform distribution; (5) No GPS or like is required to provide sensor node location information. Our security analysis demonstrates that the proposed scheme can defend against common attacks in sensor networks including node compromise attacks, replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Both mathematical and simulation-based performance evaluation show that the SCODE plus significantly reduces the communication overhead, energy consumption, packet delivery latency while it always delivers more than 97 percent of packets successfully.

  3. YouTube Fridays: Engaging the Net Generation in 5 Minutes a Week

    Science.gov (United States)

    Liberatore, Matthew W.

    2010-01-01

    YouTube Fridays is a teaching tool that devotes the first five minutes of class each Friday to a YouTube video related to the course. Students select the videos, which expand the class's educational content in courses such as thermodynamics and material and energy balances. From assessments of two pilot studies using YouTube Fridays in Chemical…

  4. Stock returns and Friday the 13th effect in five African countries ...

    African Journals Online (AJOL)

    This study is concerned with Friday the 13th and daily stock market returns in five African countries. Using the MSCI Global Equity Indices during various periods, the evidence overwhelmingly suggests that there is no Friday the 13th effect. Keywords: Friday the 13th, stock returns, anomalies, Africa ...

  5. Traffic modifications on Routes Rutherford, Democrite and Fermi

    CERN Multimedia

    2015-01-01

    The GS Department would like to inform you that until the end of December, the construction of Building 245 will result in the following traffic modifications: Traffic on Route Rutherford will be partially restricted in front of the construction site, Traffic on Route Democrite will be one-way towards Route Rutherford. Also, please note that due to construction work in front of Building 377, Route Fermi will be closed from Wednesday, 10 June until Friday, 7 August. Thank you for your understanding.

  6. 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...

  7. Females do not have more injury road accidents on Friday the 13th

    Directory of Open Access Journals (Sweden)

    Summala Heikki

    2004-11-01

    Full Text Available Abstract Background This study reinvestigated the recent finding that females – but not males – die in traffic accidents on Friday the 13th more often than on other Fridays (Näyhä S: Traffic deaths and superstition on Friday the 13th. Am J Psychiatry 2002, 159: 2110–2111. The current study used matched setting and injury accident data base that is more numerous than fatality data. If such an effect would be caused by impaired psychic and psychomotor functioning due to more frequent anxiety among women, it should also appear in injury crashes. Methods We used the national Finnish road accident database for 1989–2002. To control seasonal variation, 21 Fridays the 13th were compared in a matched design to previous and following Fridays, excluding all holidays, on number of accidents, male/female responsibility for accidents, and the number of dead, injured and overall number of active participants (drivers, pedestrians and bicyclists as a consequence of the accident. Results There were no significant differences in any examined aspect of road injury accidents among the three Fridays, either in females or males. Women were not overrepresented in crashes that occurred on Fridays 13th. Conclusion There is no consistent evidence for females having more road traffic crashes on Fridays the 13th, based on deaths or road accident statistics. However, this does not imply a non-existent effect of superstition related anxiety on accident risk as no exposure-to-risk data are available. People who are anxious of "Black Friday" may stay home, or at least avoid driving a car.

  8. Fiber wireless networks

    Science.gov (United States)

    Nirmalathas, A.; Bakaul, M.; Lim, C.; Novak, D.; Waterhouse, R.

    2005-11-01

    Broadband wireless networks based on a number of new frequency windows at higher microwave and millimeter-wave frequencies have been actively pursued to provide ultra-high bandwidth services over a wireless networks. These networks will have a large number of antenna base-stations with high throughput. Significant reductions in antenna base-station complexity can be achieved if most of the signal routing and switching functions centralized at a central office in the network. In such a network, fiber feed networks can be effectively deployed to provide high bandwidth interconnections between multiple antenna base-stations and the central office. With wavelength division multiplexing, efficient optical fiber feed network architectures could be realised to provide interconnection to a large number of antenna base-stations. In this paper, we present an over view of our recent research into system technologies for fiber wireless networks.

  9. Wireless Access

    Indian Academy of Sciences (India)

    First page Back Continue Last page Overview Graphics. Wireless Access. Wireless connect to the Base station. Easy and Convenient access. Costlier as compared to the wired technology. Reliability challenges. We see it as a complementary technology to the DSL.

  10. Subsurface Wireless Sensor Networks

    Science.gov (United States)

    Niemeier, J. J.; Davies, J. L.; Kruger, A.

    2008-12-01

    Conventional thinking holds that underground- and underwater radio communication is not possible, except at very low frequencies employing very long antennas and high transmit power. However, researchers at The University of Iowa have demonstrated that using inexpensive, low-power radios, it is in fact possible to achieve reliable underground radio communication over distances of several meters. This allows for creating underground wireless sensor networks. A proof-of-concept network was established at The University of Iowa, where nodes that measure soil moisture content are buried over a 20×20 m area (up to 1 m deep). The nodes organize themselves into a wireless sensor network, reconfigure routes as radio link quality waxes and wanes, cooperate in routing data packets to a surface base station, and so on. In an agricultural research setting, an advantage of such buried wireless sensor networks is that, if nodes were buried deep enough, they may be left in place during agricultural field work. Power consumption is an important issue in wireless sensor networks. This is especially true in a buried network where battery replacement is a major undertaking. The focus of continuing research is developing methods of inductively recharging buried sensor batteries.

  11. 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

  12. Friday Forum and the AICPA Core Competency Framework: Honing Students' Personal Competencies

    Science.gov (United States)

    Johnson, Grace F.

    2013-01-01

    This paper shares one learning technique for honing undergraduate students' personal competencies. The senior accounting capstone course at a small Midwestern private liberal college includes a weekly seminar series, called the Friday Forum, where students and practitioners meet to discuss a current professional accounting article. Since Spring…

  13. YouTube Fridays: Student Led Development of Engineering Estimate Problems

    Science.gov (United States)

    Liberatore, Matthew W.; Vestal, Charles R.; Herring, Andrew M.

    2012-01-01

    YouTube Fridays devotes a small fraction of class time to student-selected videos related to the course topic, e.g., thermodynamics. The students then write and solve a homework-like problem based on the events in the video. Three recent pilots involving over 300 students have developed a database of videos and questions that reinforce important…

  14. 78 FR 43882 - Sunshine Act Meeting; Open Commission Meeting; Friday, July 19, 2013

    Science.gov (United States)

    2013-07-22

    ... COMMUNICATIONS & Communications and Video MEDIA. Accessibility Act (CVAA). SUMMARY: In recognition of the 23rd... format and alternative media, including large print/ type; digital disk; and audio and video tape. Best... FEDERAL COMMUNICATIONS COMMISSION Sunshine Act Meeting; Open Commission Meeting; Friday, July 19...

  15. 77 FR 26007 - Sunshine Act Meeting; Open Commission Meeting; Friday, April 27, 2012

    Science.gov (United States)

    2012-05-02

    ...-5563; TTY (202) 488-5562. These copies are available in paper format and alternative media, including... FEDERAL COMMUNICATIONS COMMISSION Sunshine Act Meeting; Open Commission Meeting; Friday, April 27, 2012 Date: April 20, 2012. The Federal Communications Commission will hold an Open Meeting on the...

  16. 78 FR 49514 - Sunshine Act Meeting; Open Commission Meeting; Friday, August 9, 2013

    Science.gov (United States)

    2013-08-14

    ... are available in paper format and alternative media, including large print/ type; digital disk; and... FEDERAL COMMUNICATIONS COMMISSION Sunshine Act Meeting; Open Commission Meeting; Friday, August 9, 2013 August 2, 2013. The Federal Communications Commission will hold an Open Meeting on the subjects...

  17. 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.

  18. Performance Evaluation of the WSN Routing Protocols Scalability

    Directory of Open Access Journals (Sweden)

    L. Alazzawi

    2008-01-01

    Full Text Available Scalability is an important factor in designing an efficient routing protocol for wireless sensor networks (WSNs. A good routing protocol has to be scalable and adaptive to the changes in the network topology. Thus scalable protocol should perform well as the network grows larger or as the workload increases. In this paper, routing protocols for wireless sensor networks are simulated and their performances are evaluated to determine their capability for supporting network scalability.

  19. Geographic GReedy routing with ACO recovery strategy GRACO

    OpenAIRE

    Rekik, Mouna; Mitton, Nathalie; Chtourou, Zied

    2015-01-01

    International audience; Geographic routing is an attractive routing strategy in wireless sensor networks. It works well in dense networks, but it may suffer from the void problem. For this purpose, a recovery step is required to guarantee packet delivery. Face routing has widely been used as a recovery strategy since proved to guarantee delivery. However, it relies on a planar graph not always achievable in realistic wireless networks and may generate long paths. In this paper, we propose GRA...

  20. Wireless virtualization

    CERN Document Server

    Wen, Heming; Le-Ngoc, Tho

    2013-01-01

    This SpringerBriefs is an overview of the emerging field of wireless access and mobile network virtualization. It provides a clear and relevant picture of the current virtualization trends in wireless technologies by summarizing and comparing different architectures, techniques and technologies applicable to a future virtualized wireless network infrastructure. The readers are exposed to a short walkthrough of the future Internet initiative and network virtualization technologies in order to understand the potential role of wireless virtualization in the broader context of next-generation ubiq

  1. Traffic modifications on Routes Rutherford, Democrite and Fermi

    CERN Multimedia

    2015-01-01

    The GS Department would like to inform you that, until the end of December, the construction of Building 245 will result in the following traffic modifications: Traffic on Route Rutherford will be partially restricted in front of the construction site, Traffic on Route Democrite will be one-way towards Route Rutherford. Also, please note that due to construction work in front of Building 377, Route Fermi will be closed from Wednesday, 10 June until Friday, 7 August. Thank you for your understanding.

  2. Wireless Internet

    NARCIS (Netherlands)

    el Zarki, M.; Heijenk, Geert; Lee, Kenneth S.; Bidgoli, H.

    This chapter addresses the topic of wireless Internet, the extension of the wireline Internet architecture to the wireless domain. As such the chapter introduces the reader to the dominant characteristics of the Internet, from its structure to the protocols that control the forwarding of data and

  3. Distributed wireless quantum communication networks

    International Nuclear Information System (INIS)

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

    2013-01-01

    The distributed wireless quantum communication network (DWQCN) has a distributed network topology and transmits information by quantum states. In this paper, we present the concept of the DWQCN and propose a system scheme to transfer quantum states in the DWQCN. The system scheme for transmitting information between any two nodes in the DWQCN includes a routing protocol and a scheme for transferring quantum states. The routing protocol is on-demand and the routing metric is selected based on the number of entangled particle pairs. After setting up a route, quantum teleportation and entanglement swapping are used for transferring quantum states. Entanglement swapping is achieved along with the process of routing set up and the acknowledgment packet transmission. The measurement results of each entanglement swapping are piggybacked with route reply packets or acknowledgment packets. After entanglement swapping, a direct quantum link between source and destination is set up and quantum states are transferred by quantum teleportation. Adopting this scheme, the measurement results of entanglement swapping do not need to be transmitted specially, which decreases the wireless transmission cost and transmission delay. (general)

  4. Review: Lisa Mackenrodt, Swahili Spirit Possession and Islamic Healing in Contemporary Tanzania: The Jinn Fly on Friday (2011 Buchbesprechung: Lisa Mackenrodt, Swahili Spirit Possession and Islamic Healing in Contemporary Tanzania: The Jinn Fly on Friday (2011

    Directory of Open Access Journals (Sweden)

    Jigal Beez

    2013-01-01

    Full Text Available Review of the monograph:Lisa Mackenrodt, Swahili Spirit Possession and Islamic Healing in Contemporary Tanzania: The Jinn Fly on Friday, Hamburg: Verlag Dr. Kovač, 2011, ISBN 978-3-8300-5806-9, 216 pagesBesprechung der Monographie:Lisa Mackenrodt, Swahili Spirit Possession and Islamic Healing in Contemporary Tanzania: The Jinn Fly on Friday, Hamburg: Verlag Dr. Kovač, 2011, ISBN 978-3-8300-5806-9, 216 Seiten

  5. Wireless communications networks for the smart grid

    CERN Document Server

    Ho, Quang-Dung; Rajalingham, Gowdemy; Le-Ngoc, Tho

    2014-01-01

    This brief presents a comprehensive review of the network architecture and communication technologies of the smart grid communication network (SGCN). It then studies the strengths, weaknesses and applications of two promising wireless mesh routing protocols that could be used to implement the SGCN. Packet transmission reliability, latency and robustness of these two protocols are evaluated and compared by simulations in various practical SGCN scenarios. Finally, technical challenges and open research opportunities of the SGCN are addressed. Wireless Communications Networks for Smart Grid provi

  6. Various administrative services and AIS applications unavailable on Friday 18th May 2007

    CERN Multimedia

    Administrative Information Services

    2007-01-01

    Due to a major upgrade Oracle HR application won't be available from Wednesday 16th May evening until Sunday 20th May. For that reason, various administrative services won't offer full service or will even be closed on Friday 18th May 2007. These services include: Users Office Registration Office (building 55) Records Office (HR) ...and others (full list available on http://ais.cern.ch website) We thank you for your understanding. AIS Administrative Information Services ais.support@cern.ch

  7. Various administrative services and AIS applications unavailable on Friday 18th May 2007

    CERN Document Server

    AIS Administrative Information Services

    2007-01-01

    Due to a major upgrade the Oracle HR application will not be available from Wednesday 16th May in the evening until Sunday 20th May. For that reason, various administrative services won't offer full service or will even be closed on Friday 18th May 2007. These services include: Users' Office Registration Office (building 55) Records Office (HR) ... and others (full list available on http://ais.cern.ch website) We thank you for your understanding. AIS Administrative Information Services ais.support@cern.ch

  8. Improving signalling performance of proactive MANET routing protocols.

    OpenAIRE

    Huang, Y.

    2007-01-01

    A mobile ad hoc network (MANET) comprises a set of nodes connected by radio wireless links in a temporary manner. The topology of a MANET may change rapidly and unpredictably because of node mobility. Resources in such networks (such as bandwidth and battery life) are constrained. These issues make routing packets between any node pair a challenging task, especially for proactive MANET routing protocols. Each node of a proactive MANET routing protocol maintains routing information to every ot...

  9. Doing Business in the House of God: Negotiation Space between Worship and Economics on Friday Prayer

    Directory of Open Access Journals (Sweden)

    Muhammad Yafiz

    2016-10-01

    Full Text Available This article describes about  negotiation space between worship and economics on Friday prayer at Masjid Ulul Albab (MUA Medan. The main focus on this research is the appearance of pedagang kagetan (sudden traders on Friday pray laying down their merchandises such as worship equipments, Moslem clothing, meal, snack, mineral water, etc around the mosque. The findings of this articles is the phenomenon where there is  there is a change  function of the mosque becomes  a market. To understand the phenomenon, there are two questions appear:  what are the factors that contribute to the negotiations of worship and the economy and how the practice of economic progress. This paper explains that the factors pushing this situation because  there is  “blurring” between the room of worship and economic boundaries. Thus  there is dominance of economic  in the worship space. It happens because there is mutual need between merchants and pilgrims. It is done to meet the needs of the merchant family.

  10. HARDWARE IMPLEMENTATION OF SECURE AODV FOR WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    S. Sharmila

    2010-12-01

    Full Text Available Wireless Sensor Networks are extremely vulnerable to any kind of routing attacks due to several factors such as wireless transmission and resource-constrained nodes. In this respect, securing the packets is of great importance when designing the infrastructure and protocols of sensor networks. This paper describes the hardware architecture of secure routing for wireless sensor networks. The routing path is selected using Ad-hoc on demand distance vector routing protocol (AODV. The data packets are converted into digest using hash functions. The functionality of the proposed method is modeled using Verilog HDL in MODELSIM simulator and the performance is compared with various target devices. The results show that the data packets are secured and defend against the routing attacks with minimum energy consumption.

  11. 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 ...

  12. 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.

  13. Enhanced SWEET protocol for energy efficient wireless sensor networks

    CSIR Research Space (South Africa)

    Dludla, AG

    2013-10-01

    Full Text Available SWEET routing protocol is one of the many pro- tocols developed for cluster formation and routing in wireless sensor networks. The SWEET protocol is a decentralized clus- tering protocol, it uses timers and interim updated cluster head estimation...

  14. La formule des traces tordue d’après le Friday Morning Seminar

    CERN Document Server

    Labesse, Jean-Pierre

    2013-01-01

    La formule des traces pour un groupe réductif connexe arbitraire est due à James Arthur. Le cas tordu a fait l'objet du Friday Morning Seminar à l'Institute for Advanced Study de Princeton pendant l'année académique 1983-1984. Lors de ce séminaire, des exposés ont été présentés par Laurent Clozel, Jean-Pierre Labesse et Robert Langlands. Les notes de ces exposés, rédigées dans l'urgence, avaient besoin d'être revues et complétées. L'ambition des auteurs du présent ouvrage est de donner, en s'appuyant sur ces notes, une preuve complète pour la formule des traces tordue, dans sa version primitive i.e. sa forme non invariante. Ceci est la première étape du projet de l'équipe parisienne animée par Laurent Clozel et Jean-Loup Waldspurger, dont le but est de donner une preuve complète de la stabilisation de la formule des traces tordue, qui est l'outil fondamental utilisé par J. Arthur dans son livre à paraître sur l'endoscopie tordue pour le groupe linéaire avec application aux groupes ...

  15. Wireless Biological Electronic Sensors.

    Science.gov (United States)

    Cui, Yue

    2017-10-09

    The development of wireless biological electronic sensors could open up significant advances for both fundamental studies and practical applications in a variety of areas, including medical diagnosis, environmental monitoring, and defense applications. One of the major challenges in the development of wireless bioelectronic sensors is the successful integration of biosensing units and wireless signal transducers. In recent years, there are a few types of wireless communication systems that have been integrated with biosensing systems to construct wireless bioelectronic sensors. To successfully construct wireless biological electronic sensors, there are several interesting questions: What types of biosensing transducers can be used in wireless bioelectronic sensors? What types of wireless systems can be integrated with biosensing transducers to construct wireless bioelectronic sensors? How are the electrical sensing signals generated and transmitted? This review will highlight the early attempts to address these questions in the development of wireless biological electronic sensors.

  16. Reliability of Wireless Sensor Networks

    Science.gov (United States)

    Dâmaso, Antônio; Rosa, Nelson; Maciel, Paulo

    2014-01-01

    Wireless Sensor Networks (WSNs) consist of hundreds or thousands of sensor nodes with limited processing, storage, and battery capabilities. There are several strategies to reduce the power consumption of WSN nodes (by increasing the network lifetime) and increase the reliability of the network (by improving the WSN Quality of Service). However, there is an inherent conflict between power consumption and reliability: an increase in reliability usually leads to an increase in power consumption. For example, routing algorithms can send the same packet though different paths (multipath strategy), which it is important for reliability, but they significantly increase the WSN power consumption. In this context, this paper proposes a model for evaluating the reliability of WSNs considering the battery level as a key factor. Moreover, this model is based on routing algorithms used by WSNs. In order to evaluate the proposed models, three scenarios were considered to show the impact of the power consumption on the reliability of WSNs. PMID:25157553

  17. A Wireless Sensor Enabled by Wireless Power

    Science.gov (United States)

    Lee, Da-Sheng; Liu, Yu-Hong; Lin, Chii-Ruey

    2012-01-01

    Through harvesting energy by wireless charging and delivering data by wireless communication, this study proposes the concept of a wireless sensor enabled by wireless power (WPWS) and reports the fabrication of a prototype for functional tests. One WPWS node consists of wireless power module and sensor module with different chip-type sensors. Its main feature is the dual antenna structure. Following RFID system architecture, a power harvesting antenna was designed to gather power from a standard reader working in the 915 MHz band. Referring to the Modbus protocol, the other wireless communication antenna was integrated on a node to send sensor data in parallel. The dual antenna structure integrates both the advantages of an RFID system and a wireless sensor. Using a standard UHF RFID reader, WPWS can be enabled in a distributed area with a diameter up to 4 m. Working status is similar to that of a passive tag, except that a tag can only be queried statically, while the WPWS can send dynamic data from the sensors. The function is the same as a wireless sensor node. Different WPWSs equipped with temperature and humidity, optical and airflow velocity sensors are tested in this study. All sensors can send back detection data within 8 s. The accuracy is within 8% deviation compared with laboratory equipment. A wireless sensor network enabled by wireless power should be a totally wireless sensor network using WPWS. However, distributed WPWSs only can form a star topology, the simplest topology for constructing a sensor network. Because of shielding effects, it is difficult to apply other complex topologies. Despite this limitation, WPWS still can be used to extend sensor network applications in hazardous environments. Further research is needed to improve WPWS to realize a totally wireless sensor network. PMID:23443370

  18. A Wireless Sensor Enabled by Wireless Power

    Directory of Open Access Journals (Sweden)

    Da-Sheng Lee

    2012-11-01

    Full Text Available Through harvesting energy by wireless charging and delivering data by wireless communication, this study proposes the concept of a wireless sensor enabled by wireless power (WPWS and reports the fabrication of a prototype for functional tests. One WPWS node consists of wireless power module and sensor module with different chip-type sensors. Its main feature is the dual antenna structure. Following RFID system architecture, a power harvesting antenna was designed to gather power from a standard reader working in the 915 MHz band. Referring to the Modbus protocol, the other wireless communication antenna was integrated on a node to send sensor data in parallel. The dual antenna structure integrates both the advantages of an RFID system and a wireless sensor. Using a standard UHF RFID reader, WPWS can be enabled in a distributed area with a diameter up to 4 m. Working status is similar to that of a passive tag, except that a tag can only be queried statically, while the WPWS can send dynamic data from the sensors. The function is the same as a wireless sensor node. Different WPWSs equipped with temperature and humidity, optical and airflow velocity sensors are tested in this study. All sensors can send back detection data within 8 s. The accuracy is within 8% deviation compared with laboratory equipment. A wireless sensor network enabled by wireless power should be a totally wireless sensor network using WPWS. However, distributed WPWSs only can form a star topology, the simplest topology for constructing a sensor network. Because of shielding effects, it is difficult to apply other complex topologies. Despite this limitation, WPWS still can be used to extend sensor network applications in hazardous environments. Further research is needed to improve WPWS to realize a totally wireless sensor network.

  19. A wireless sensor enabled by wireless power.

    Science.gov (United States)

    Lee, Da-Sheng; Liu, Yu-Hong; Lin, Chii-Ruey

    2012-11-22

    Through harvesting energy by wireless charging and delivering data by wireless communication, this study proposes the concept of a wireless sensor enabled by wireless power (WPWS) and reports the fabrication of a prototype for functional tests. One WPWS node consists of wireless power module and sensor module with different chip-type sensors. Its main feature is the dual antenna structure. Following RFID system architecture, a power harvesting antenna was designed to gather power from a standard reader working in the 915 MHz band. Referring to the Modbus protocol, the other wireless communication antenna was integrated on a node to send sensor data in parallel. The dual antenna structure integrates both the advantages of an RFID system and a wireless sensor. Using a standard UHF RFID reader, WPWS can be enabled in a distributed area with a diameter up to 4 m. Working status is similar to that of a passive tag, except that a tag can only be queried statically, while the WPWS can send dynamic data from the sensors. The function is the same as a wireless sensor node. Different WPWSs equipped with temperature and humidity, optical and airflow velocity sensors are tested in this study. All sensors can send back detection data within 8 s. The accuracy is within 8% deviation compared with laboratory equipment. A wireless sensor network enabled by wireless power should be a totally wireless sensor network using WPWS. However, distributed WPWSs only can form a star topology, the simplest topology for constructing a sensor network. Because of shielding effects, it is difficult to apply other complex topologies. Despite this limitation, WPWS still can be used to extend sensor network applications in hazardous environments. Further research is needed to improve WPWS to realize a totally wireless sensor network.

  20. Increased Efficiency of Face Recognition System using Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Rajani Muraleedharan

    2006-02-01

    Full Text Available This research was inspired by the need of a flexible and cost effective biometric security system. The flexibility of the wireless sensor network makes it a natural choice for data transmission. Swarm intelligence (SI is used to optimize routing in distributed time varying network. In this paper, SI maintains the required bit error rate (BER for varied channel conditions while consuming minimal energy. A specific biometric, the face recognition system, is discussed as an example. Simulation shows that the wireless sensor network is efficient in energy consumption while keeping the transmission accuracy, and the wireless face recognition system is competitive to the traditional wired face recognition system in classification accuracy.

  1. Simulation and Evaluation of Routing Protocols for Mobile Ad Hoc Networks (MANETs)

    National Research Council Canada - National Science Library

    Kioumourtzis, George

    2005-01-01

    .... The nodes act as routers in an environment without a fixed infrastructure, the nodes are mobile, the wireless medium has its own limitations compared to wired networks, and existing routing protocols...

  2. Adaptive Wireless Transceiver Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Many wireless technologies are already available for sensor applications. It is inevitable that many non-interoperable wireless technologies between 400 MHz and 5.8...

  3. Reconfigurable Robust Routing for Mobile Outreach Network

    Science.gov (United States)

    Lin, Ching-Fang

    2010-01-01

    The Reconfigurable Robust Routing for Mobile Outreach Network (R3MOO N) provides advanced communications networking technologies suitable for the lunar surface environment and applications. The R3MOON techn ology is based on a detailed concept of operations tailored for luna r surface networks, and includes intelligent routing algorithms and wireless mesh network implementation on AGNC's Coremicro Robots. The product's features include an integrated communication solution inco rporating energy efficiency and disruption-tolerance in a mobile ad h oc network, and a real-time control module to provide researchers an d engineers a convenient tool for reconfiguration, investigation, an d management.

  4. Enabling Routes as Context in Mobile Services

    DEFF Research Database (Denmark)

    Brilingaite, Agne; Jensen, Christian Søndergaard; Zokaite, Nora

    With the continuing advances in wireless communications, geo-positioning, and portable electronics, an infrastructure is emerging that enables the delivery of on-line, location-enabled services to very large numbers of mobile users. A typical usage situation for mobile services is one characterized...... aware. Mobile users frequently follow the same route to a destination as they did during previous trips to the destination, and the route and destination constitute important aspects of the context for a range of services. This paper presents key concepts underlying a software component that identifies...

  5. Mathematical Aspects of Network Routing Optimization

    CERN Document Server

    Oliveira, Carlos AS

    2011-01-01

    Before the appearance of broadband links and wireless systems, networks have been used to connect people in new ways. Now, the modern world is connected through large-scale, computational networked systems such as the Internet. Because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in this area. "Mathematical Aspects of Network Routing Optimization" focuses on computational issues arising from the process of optimizing network routes, such as quality of the resulting links and their reli

  6. A peer-to-peer file search and download protocol for wireless ad-hoc networks

    NARCIS (Netherlands)

    Sözer, Hasan; Tekkalmaz, M.; Korpeoglu, I.

    Deployment of traditional peer-to-peer file sharing systems on a wireless ad-hoc network introduces several challenges. Information and workload distribution as well as routing are major problems for members of a wireless ad-hoc network, which are only aware of their immediate neighborhood. In this

  7. Wireless surveillance sytem for greenhouse crops

    OpenAIRE

    Cama-Pinto, Alejandro; Gil-Montoya, Francisco; Gómez-López, Julio; García-Cruz, Amos; Manzano-Agugliaro, Francisco

    2014-01-01

    The agriculture in the southeast Spain has experimented important changes in the last years due to the greenhouse crops. In this kind of crops is very important the use of advanced techniques and new technologies to improve the crop efficiency. This work presents an advanced system to monitor the variables applied on greenhouse crops. The monitoring system uses a wireless sensor network (WSN) that works with 6LoWPAN and RPL as the routing protocol. It measures humidity, temperature, light, an...

  8. Wireless Communication Technologies

    Indian Academy of Sciences (India)

    First page Back Continue Last page Overview Graphics. Wireless Communication Technologies. Since 1999, the wireless LAN has experienced a tremendous growth. Reasons: Adoption of industry standards. Interoperability testing. The progress of wireless equipments to higher data rates. Rapid decrease in product ...

  9. CCNA Wireless Study Guide

    CERN Document Server

    Lammle, Todd

    2010-01-01

    A complete guide to the CCNA Wireless exam by leading networking authority Todd Lammle. The CCNA Wireless certification is the most respected entry-level certification in this rapidly growing field. Todd Lammle is the undisputed authority on networking, and this book focuses exclusively on the skills covered in this Cisco certification exam. The CCNA Wireless Study Guide joins the popular Sybex study guide family and helps network administrators advance their careers with a highly desirable certification.: The CCNA Wireless certification is the most respected entry-level wireless certification

  10. 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.

  11. Wireless Plug and Play Control Systems: Hardware, Networks, and Protocols

    DEFF Research Database (Denmark)

    Meybodi, Soroush Afkhami

    2012-01-01

    the protocols that can fulfill the stringent requirements of P3C case studies in general. In this part, after a thorough review of available Access and Routing protocols in industrial wireless networks, a combination of a deterministic Medium Access Control (MAC) protocol and a clustered flooding-based routing......D project are presented in two distinct areas which are: 1) Signal propagation in underground and confined areas, and 2) Access and Networking protocols that accommodate the required flexibility, scalability, and quality of services for plug and play control systems. The first category finds application...... is recommended for wireless plug and play control systems. Formation and maintenance of clusters of nodes are directly linked to the top level application layer via a novel application-based routing metric. The proposed routing metric facilitates implementation of the networking topology in accordance...

  12. Popular belief meets surgical reality: impact of lunar phases, Friday the 13th and zodiac signs on emergency operations and intraoperative blood loss.

    Science.gov (United States)

    Schuld, Jochen; Slotta, Jan E; Schuld, Simone; Kollmar, Otto; Schilling, Martin K; Richter, Sven

    2011-09-01

    The influence of superstition, moon calendars, and popular belief on evidence-based medicine is stunning. More than 40% of medical staff is convinced that lunar phases can affect human behavior. The idea that Friday the 13th is associated with adverse events and bad luck is deep-rooted in the population of Western industrial countries. The aim of the present study was to test the hypothesis that these myths are transferable to real-life surgery. We analyzed the extent to which moon phases, zodiac signs, and Friday the 13th influence blood loss, emergency frequency, and intestinal perforations by evaluating the operation records of all 27,914 consecutive patients of our institution undergoing general, visceral, or vascular surgery between August 2001 and August 2010. Dates of surgery were allocated to lunar phases and to zodiac signs, as well as to Friday the 13th. A total of 111 lunar cycles and 15 Fridays the 13th occurred within the 3,281-day observation period. Patients' characteristics did not differ in lunar phases, zodiac signs, or Fridays the 13th. Full moon phases, the presence of Friday the 13th, and zodiac signs influenced neither intraoperative blood loss nor emergency frequency. No statistical peaks regarding perforated aortic aneurysms and gastrointestinal perforations were found on full moon or Friday the 13th. Scientific analysis of our data does not support the belief that moon phases, zodiac signs, or Friday 13th influence surgical blood loss and emergency frequency. Our data indicate that such beliefs are myths far beyond reality.

  13. 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

  14. Implementation Of The Precision Agriculture Using LEACH Protocol Of Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Than Htike Aung

    2015-08-01

    Full Text Available The evolution of wireless sensor network technology leads to develop advanced systems for real-time monitoring. Wireless sensor network WSN is a major technology that drives the development of precision agriculture.By forming wireless sensor networkagricultural practicescan be made good monitoring systems.Various agricultural parameters like soil moisture temperature and humidity are monitored by monitoring units.The paper explains about how to utilize thesensors in agricultural practices and explains about routing protocols of wireless sensor network. In this paper agricultural parameter of temperature will monitor with the use of LEACH protocol.

  15. Enabling Routes as Context in Mobile Services

    DEFF Research Database (Denmark)

    Brilingaite, Agne; Jensen, Christian Søndergaard; Zokaite, Nora

    2004-01-01

    With the continuing advances in wireless communications, geo-positioning, and portable electronics, an infrastructure is emerging that enables the delivery of on-line, location-enabled services to very large numbers of mobile users. A typical usage situation for mobile services is one characterized...... by a small screen and no keyboard, and by the service being only a secondary focus of the user. It is therefore particularly important to deliver the "right" information and service at the right time, with as little user interaction as possible. This may be achieved by making services context aware.......Mobile users frequently follow the same route to a destination as they did during previous trips to the destination, and the route and destination are important aspects of the context for a range of services. This paper presents key concepts underlying a software component that discovers the routes of a user...

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

    Indian Academy of Sciences (India)

    Multi-sensor data fusion; optimization techniques; energy aware routing; ant colony optimization; wireless sensor network ... The executions of proposed arnd low-energy adaptive clustering hierarchy algorithms were carried out and the results show that the proposed algorithms could efficiently reduce the use of energy and ...

  17. Snow route optimization.

    Science.gov (United States)

    2016-01-01

    Route optimization is a method of creating a set of winter highway treatment routes to meet a range of targets, including : service level improvements, resource reallocation and changes to overriding constraints. These routes will allow the : operato...

  18. Hurricane Evacuation Routes

    Data.gov (United States)

    Department of Homeland Security — Hurricane Evacuation Routes in the United States A hurricane evacuation route is a designated route used to direct traffic inland in case of a hurricane threat. This...

  19. Design of verification platform for wireless vision sensor networks

    Science.gov (United States)

    Ye, Juanjuan; Shang, Fei; Yu, Chuang

    2017-08-01

    At present, the majority of research for wireless vision sensor networks (WVSNs) still remains in the software simulation stage, and the verification platforms of WVSNs that available for use are very few. This situation seriously restricts the transformation from theory research of WVSNs to practical application. Therefore, it is necessary to study the construction of verification platform of WVSNs. This paper combines wireless transceiver module, visual information acquisition module and power acquisition module, designs a high-performance wireless vision sensor node whose core is ARM11 microprocessor and selects AODV as the routing protocol to set up a verification platform called AdvanWorks for WVSNs. Experiments show that the AdvanWorks can successfully achieve functions of image acquisition, coding, wireless transmission, and obtain the effective distance parameters between nodes, which lays a good foundation for the follow-up application of WVSNs.

  20. Wireless physical layer security

    OpenAIRE

    Poor, H. Vincent; Schaefer, Rafael F.

    2016-01-01

    Security is a very important issue in the design and use of wireless networks. Traditional methods of providing security in such networks are impractical for some emerging types of wireless networks due to the light computational abilities of some wireless devices [such as radio-frequency identification (RFID) tags, certain sensors, etc.] or to the very large scale or loose organizational structure of some networks. Physical layer security has the potential to address these concerns by taking...

  1. Wireless security in mobile health.

    Science.gov (United States)

    Osunmuyiwa, Olufolabi; Ulusoy, Ali Hakan

    2012-12-01

    Mobile health (m-health) is an extremely broad term that embraces mobile communication in the health sector and data packaging. The four broad categories of wireless networks are wireless personal area network, wireless metropolitan area network, wireless wide area network, and wireless local area network. Wireless local area network is the most notable of the wireless networking tools obtainable in the health sector. Transfer of delicate and critical information on radio frequencies should be secure, and the right to use must be meticulous. This article covers the business opportunities in m-health, threats faced by wireless networks in hospitals, and methods of mitigating these threats.

  2. Wireless Emulation Laboratory

    Data.gov (United States)

    Federal Laboratory Consortium — The Wireless Emulation Laboratory (WEL) is a researchtest bed used to investigate fundamental issues in networkscience. It is a research infrastructure that emulates...

  3. Adaptive Wireless Transceiver Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Wireless technologies are an increasingly attractive means for spatial data, input, manipulation, and distribution. Mobitrum is proposing an innovative Adaptive...

  4. Wireless sensor networks principles, design and applications

    CERN Document Server

    Yang, Shuang-Hua

    2014-01-01

    Wireless Sensor Networks presents the latest practical solutions to the design issues presented in wireless-sensor-network-based systems. Novel features of the text, distributed throughout, include workable solutions, demonstration systems and case studies of the design and application of wireless sensor networks (WSNs) based on the first-hand research and development experience of the author, and the chapters on real applications: building fire safety protection; smart home automation; and logistics resource management. Case studies and applications illustrate the practical perspectives of: ·         sensor node design; ·         embedded software design; ·         routing algorithms; ·         sink node positioning; ·         co-existence with other wireless systems; ·         data fusion; ·         security; ·         indoor location tracking; ·         integrating with radio-frequency identification; and ·         In...

  5. Tohoku's earthquake of Friday March 11, 2011 (5:46 UT), magnitude 9.0, off Honshu island (Japan)

    International Nuclear Information System (INIS)

    2011-01-01

    On Friday March 11, 2011, at 5:46 UT (2:46 PM local time), a magnitude 9.0 earthquake took place at 80 km east of Honshu island (Japan). The earthquake generated a tsunami which led to the loss of the cooling systems of the Fukushima Dai-ichi and Fukushima Daini power plants. This paper describes the seismo-tectonic and historical seismic context of the Japan archipelago and the first analyses of the Tohoku earthquake impact: magnitudes of first shock and of aftershocks, impact on nuclear facilities (maximum acceleration values detected with respect to design basis values, subsidence of coastal areas and submersion of power plant platforms). (J.S.)

  6. Reduced service of the “IT Service Desk” (Computing Helpdesk) on the after noon of Friday 8 October 2010

    CERN Document Server

    IT Department

    2010-01-01

    Please note that due to relocation, the “IT Service Desk” will be operating a reduced service on Friday 8th October from 12-30. In particular, the telephone line 78888 will not be available and users will be invited to submit their requests by e-mail (Computing.Helpdesk@cern.ch). E-mail requests will be treated as normal, but some delays are possible. In the event of urgent problems you may call the IT Manager on Duty on 163013. We also take this opportunity to remind you about the “IT Service Status Board” where all computing incidents and scheduled interventions are updated online. Please see: http://cern.ch/it-servicestatus. Normal service will be resumed at 8-30 a.m on Monday 11 October. Thank you in advance for your understanding. The CERN “User Support” Team (IT-UDS-HUS)

  7. Major earthquake of Friday March 11, 2011, magnitude 8.9 at 5:46 UT, off Honshu island (Japan)

    International Nuclear Information System (INIS)

    2011-01-01

    On Friday March 11, 2011, at 5:46 UT (2:46 PM local time), a magnitude 8.9 earthquake took place at 80 km east of Honshu island (Japan). The earthquake affected a large part of the Honshu territory and led to the automatic emergency shutdown of all nuclear power plants of the east coast. This paper recalls first the seismo-tectonic and historical seismic context of the Japan archipelago and the first analyses of the Tohoku earthquake impact on nuclear facilities. At the time of publication of this information report, no radioactive release in the environment and no anomaly at the Tokai-Mura and Rokkasho-Mura sites were mentioned. However, the evacuation of populations in a 3 to 10 km area around the Fukushima-Dai-ichi power plant had been ordered by the Governor as preventive measure, which made one think that the situation at this specific site was particularly worrying. (J.S.)

  8. Enhancing traffic capacity of scale-free networks by employing hybrid routing strategy

    Science.gov (United States)

    Jiang, Zhong-Yuan; Ma, Jian-Feng; Jing, Xu

    2015-03-01

    Based on the consideration of easy implementation of new routing strategies on many real complex networks such as the Internet, we propose a hybrid routing mechanism composed of the shortest path routing and the global dynamic routing strategy to improve the network traffic capacity. Under the background of current routing policy and network structure, packets can be sent along the shortest paths or by using source routing information. In this work, a global dynamic source routing strategy is employed as a supplementary routing mechanism to bypass central nodes and increase the delivery capacity utilization of all nodes significantly in the network. The traffic capacity of networked complex systems can be enhanced tens of times at the cost of a little average path lengthening. This hybrid routing method is very useful to network service providers and can be constitutionally supported on several networked complex systems such as the Internet and wireless ad hoc networks.

  9. Wireless mobile Internet security

    CERN Document Server

    Rhee, Man Young

    2013-01-01

      The mobile industry for wireless cellular services has grown at a rapid pace over the past decade. Similarly, Internet service technology has also made dramatic growth through the World Wide Web with a wire line infrastructure. Realization for complete wired/wireless mobile Internet technologies will become the future objectives for convergence of these technologies thr

  10. Secure Wireless Sensor Networks: Problems and Solutions

    Directory of Open Access Journals (Sweden)

    Fei Hu

    2003-08-01

    Full Text Available As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, the main research focus has been on making sensor networks feasible and useful, and less emphasis was placed on security. This paper analyzes security challenges in wireless sensor networks and summarizes key issues that should be solved for achieving the ad hoc security. It gives an overview of the current state of solutions on such key issues as secure routing, prevention of denial-of-service and key management service. We also present some secure methods to achieve security in wireless sensor networks. Finally we present our integrated approach to securing sensor networks.

  11. 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.

  12. Trust-Based Route Selection in Dynamic Source Routin

    DEFF Research Database (Denmark)

    Jensen, Christian D.; Connell, Paul O

    2006-01-01

    in the mobile wireless network. However, blindly trusting all other nodes to respect the routing protocol exposes the local node to a wide variety of vulnerabilities. Traditional security mechanisms rely on either the authenticated identity of the requesting principal or some form of credentials that authorise...... the client to perform certain actions. Generally, these mechanisms require some underlying infrastructure, e.g., a public key infrastructure (PKI). However, we cannot assume such infrastructures to be in place in an ad hoc network. In this paper we propose an extension to an existing ad hoc routing protocols......, which selects the route based on a local evaluation of the trustworthiness of all known intermediary nodes (routers) on the route to the destination. We have implemented this mechanism in an existing ad hoc routing protocol, and we show how trust can be built from previous experience and how trust can...

  13. Resource optimization scheme for multimedia-enabled wireless mesh networks.

    Science.gov (United States)

    Ali, Amjad; Ahmed, Muhammad Ejaz; Piran, Md Jalil; Suh, Doug Young

    2014-08-08

    Wireless mesh networking is a promising technology that can support numerous multimedia applications. Multimedia applications have stringent quality of service (QoS) requirements, i.e., bandwidth, delay, jitter, and packet loss ratio. Enabling such QoS-demanding applications over wireless mesh networks (WMNs) require QoS provisioning routing protocols that lead to the network resource underutilization problem. Moreover, random topology deployment leads to have some unused network resources. Therefore, resource optimization is one of the most critical design issues in multi-hop, multi-radio WMNs enabled with multimedia applications. Resource optimization has been studied extensively in the literature for wireless Ad Hoc and sensor networks, but existing studies have not considered resource underutilization issues caused by QoS provisioning routing and random topology deployment. Finding a QoS-provisioned path in wireless mesh networks is an NP complete problem. In this paper, we propose a novel Integer Linear Programming (ILP) optimization model to reconstruct the optimal connected mesh backbone topology with a minimum number of links and relay nodes which satisfies the given end-to-end QoS demands for multimedia traffic and identification of extra resources, while maintaining redundancy. We further propose a polynomial time heuristic algorithm called Link and Node Removal Considering Residual Capacity and Traffic Demands (LNR-RCTD). Simulation studies prove that our heuristic algorithm provides near-optimal results and saves about 20% of resources from being wasted by QoS provisioning routing and random topology deployment.

  14. Routing in opportunistic networks

    CERN Document Server

    Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

    2013-01-01

    This book provides a comprehensive guide to selected topics, both ongoing and emerging, in routing in OppNets. The book is edited by worldwide technical leaders, prolific researchers and outstanding academics, Dr. Isaac Woungang and co-editors, Dr. Sanjay Kumar Dhurandher, Prof. Alagan Anpalagan and Prof. Athanasios Vasilakos. Consisting of contributions from well known and high profile researchers and scientists in their respective specialties, the main topics that are covered in this book include mobility and routing, social-aware routing, context-based routing, energy-aware routing, incentive-aware routing, stochastic routing, modeling of intermittent connectivity, in both infrastructure and infrastructure-less OppNets. Key Features: Discusses existing and emerging techniques for routing in infrastructure and infrastructure-less OppNets. Provides a unified covering of otherwise disperse selected topics on routing in infrastructure and infrastructure-less OppNets.  Includes a set of PowerPoint slides and g...

  15. The wireless internet explained

    CERN Document Server

    Rhoton, John

    2001-01-01

    The Wireless Internet Explained covers the full spectrum of wireless technologies from a wide range of vendors, including initiatives by Microsoft and Compaq. The Wireless Internet Explained takes a practical look at wireless technology. Rhoton explains the concepts behind the physics, and provides an overview that clarifies the convoluted set of standards heaped together under the umbrella of wireless. It then expands on these technical foundations to give a panorama of the increasingly crowded landscape of wireless product offerings. When it comes to actual implementation the book gives abundant down-to-earth advice on topics ranging from the selection and deployment of mobile devices to the extremely sensitive subject of security.Written by an expert on Internet messaging, the author of Digital Press''s successful Programmer''s Guide to Internet Mail and X.400 and SMTP: Battle of the E-mail Protocols, The Wireless Internet Explained describes and evaluates the current state of the fast-growing and crucial...

  16. Wireless networks and security issues, challenges and research trends

    CERN Document Server

    Pathan, Al-Sakib

    2013-01-01

     “Wireless Networks and Security” provides a broad coverage of wireless security issues including cryptographic coprocessors, encryption, authentication, key management, attacks and countermeasures, secure routing, secure medium access control, intrusion detection, epidemics, security performance analysis, security issues in applications. The contributions identify various vulnerabilities in the physical layer, MAC layer, network layer, transport layer, and application layer, and focus on ways of strengthening security mechanisms and services throughout the layers. This carefully edited monograph is targeting  for researchers, post-graduate students in universities, academics, and industry practitioners or professionals.  

  17. Handbook of sensor networks compact wireless and wired sensing systems

    CERN Document Server

    Ilyas, Mohammad

    2004-01-01

    INTRODUCTION Opportunities and Challenges in Wireless Sensor Networks, M. Haenggi, Next Generation Technologies to Enable Sensor Networks, J. I.  Goodman, A. I. Reuther, and D. R. Martinez Sensor Networks Management, L. B. Ruiz, J. M. Nogueira, and A. A. F. Loureiro Models for Programmability in Sensor Networks, A. Boulis Miniaturizing Sensor Networks with MEMS, Brett Warneke A Taxonomy of Routing Techniques in Wireless Sensor Networks, J. N. Al-Karaki and A. E. Kamal Artificial Perceptual Systems, A. Loutfi, M. Lindquist, and P. Wide APPLICATIONS Sensor Network Architecture and Appl

  18. An Air-Ground Wireless Sensor Network for Crop Monitoring

    Directory of Open Access Journals (Sweden)

    Claudio Rossi

    2011-06-01

    Full Text Available This paper presents a collaborative system made up of a Wireless Sensor Network (WSN and an aerial robot, which is applied to real-time frost monitoring in vineyards. The core feature of our system is a dynamic mobile node carried by an aerial robot, which ensures communication between sparse clusters located at fragmented parcels and a base station. This system overcomes some limitations of the wireless networks in areas with such characteristics. The use of a dedicated communication channel enables data routing to/from unlimited distances.

  19. Survey of Security Technologies on Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Qiuwei Yang

    2015-01-01

    Full Text Available Because of their low cost and adaptability, wireless sensor networks are widely used in civil, military, and commercial fields and other fields. However, since the sensor node in the calculation of the capacity, battery capacity, and storage capacity are restricted by the limitations and inherent characteristics of the sensor networks, compared to traditional networks, which makes wireless sensor networks face more security threats. This paper summarized research progress of sensor network security issues as three aspects, key management, authentication, and secure routing, analyzed and commented on these results advantages and disadvantages and pointed out the future direction of the hot research field.

  20. Wireless Sensor Networks Data Processing Summary Based on Compressive Sensing

    Directory of Open Access Journals (Sweden)

    Caiyun Huang

    2014-07-01

    Full Text Available As a newly proposed theory, compressive sensing (CS is commonly used in signal processing area. This paper investigates the applications of compressed sensing (CS in wireless sensor networks (WSNs. First, the development and research status of compressed sensing technology and wireless sensor networks are described, then a detailed investigation of WSNs research based on CS are conducted from aspects of data fusion, signal acquisition, signal routing transmission, and signal reconstruction. At the end of the paper, we conclude our survey and point out the possible future research directions.

  1. 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

  2. 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

  3. Wireless mesh networks

    CERN Document Server

    Held, Gilbert

    2005-01-01

    Wireless mesh networking is a new technology that has the potential to revolutionize how we access the Internet and communicate with co-workers and friends. Wireless Mesh Networks examines the concept and explores its advantages over existing technologies. This book explores existing and future applications, and examines how some of the networking protocols operate.The text offers a detailed analysis of the significant problems affecting wireless mesh networking, including network scale issues, security, and radio frequency interference, and suggests actual and potential solutions for each pro

  4. Optical and wireless technologies

    CERN Document Server

    Tiwari, Manish; Singh, Ghanshyam; Minzioni, Paolo

    2018-01-01

    This book presents selected papers from 1st International Conference on Optical and Wireless Technologies, providing insights into the analytical, experimental, and developmental aspects of systems, techniques, and devices in these spheres. It explores the combined use of various optical and wireless technologies in next-generation networking applications, and discusses the latest developments in applications such as photonics, high-speed communication systems and networks, visible light communication, nanophotonics, and wireless and multiple-input-multiple-output (MIMO) systems. The book will serve as a valuable reference resource for academics and researchers across the globe.

  5. Simulations of the Impact of Controlled Mobility for Routing Protocols

    Directory of Open Access Journals (Sweden)

    Loscrí Valeria

    2010-01-01

    Full Text Available This paper addresses mobility control routing in wireless networks. Given a data flow request between a source-destination pair, the problem is to move nodes towards the best placement, such that the performance of the network is improved. Our purpose is to find the best nodes selection depending on the minimization of the maximum distance that nodes have to travel to reach their final position. We propose a routing protocol, the Routing Protocol based on Controlled Mobility (RPCM, where the chosen nodes' path minimizes the total travelled distance to reach desirable position. Specifically, controlled mobility is intended as a new design dimension network allowing to drive nodes to specific best position in order to achieve some common objectives. The main aim of this paper is to show by simulation the effectiveness of controlled mobility when it is used as a new design dimension in wireless networks. Extensive simulations are conducted to evaluate the proposed routing algorithm. Results show how our protocol outperforms a well-known routing protocol, the Ad hoc On Demand Distance Vector routing (AODV, in terms of throughput, average end-to-end data packet delay and energy spent to send a packet unit.

  6. Armstrong Flight Research Center Flight Test Capabilities and Opportunities for the Applications of Wireless Data Acquisition Systems

    Science.gov (United States)

    Hang, Richard

    2015-01-01

    The presentation will overview NASA Armstrong Flight Research Centers flight test capabilities, which can provide various means for flight testing of passive and active wireless sensor systems, also, it will address the needs of the wireless data acquisition solutions for the centers flight instrumentation issues such as additional weight caused by added instrumentation wire bundles, connectors, wire cables routing, moving components, etc., that the Passive Wireless Sensor Technology Workshop may help. The presentation shows the constraints and requirements that the wireless sensor systems will face in the flight test applications.

  7. Hazmat Routes (National)

    Data.gov (United States)

    Department of Transportation — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes (NTAD) were developed using the 2004 First Edition TIGER/Line files. The routes are...

  8. A road map for wireless mesh routing with DSA

    CSIR Research Space (South Africa)

    Maliwatu, R

    2016-09-01

    Full Text Available of Secondary Access to TV White Spaces Using Cognitive Radio, In 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, pages 1–6, Houston, TX, 2011. [4] Amit Kumar and David Lloyd Johnson. White Space Communication: advances...

  9. Performance analysis of routing strategies for wireless sensor networks

    Directory of Open Access Journals (Sweden)

    Raúl Aquino-Santos

    2010-01-01

    Full Text Available Este trabajo presenta el análisis de funcionamiento de estrategias de enrutamiento de fuente, de la trayectoria más corta, jerárquica y geográfica, las cuales son tres de las estrategias más comúnmente implementadas para redes ad hoc y de sensores. Enrutamiento de fuente se seleccionó debido a que no requiere un mantenimiento topológico costoso, mientras el enrutamiento de la trayectoria más corta fue elegido por su simplicidad en el descubrimiento de la ruta y la estrategia de enrutamiento jerárquica y geográfica fue seleccionada debido a que utiliza información de un sistema de posicionamiento global (GPS. Muchas aplicaciones actuales requieren el conocimiento preciso de la posición física, particularmente en las áreas de salud, militar, agricultura, robótica y monitoreo estructural y ambiental. Adicionalmente, la técnica de enrutamiento de trayectoria más corta fue seleccionada por que se emplea en algoritmos de redes de sensores inalámbricos centrados en datos, tales como: Difusión Directa, Enrutamiento por Rumor, Enrutamiento basado en Gradientes y el Estándar ZigBEE. El funcionamiento de estas tres estrategias de enrutamiento se evalúa a través de simulaciones y en términos de latencia, retardo punto a punto, tasa de entrega de paquetes, sobre procesamiento de enrutamiento, sobre procesamiento general y la carga de enrutamiento.

  10. Wireless capsule endoscopy

    Science.gov (United States)

    Iddan, Gavriel; Meron, Gavriel; Glukhovsky, Arkady; Swain, Paul

    2000-05-01

    We have developed a new type of endoscopy, which for the first time allows painless endoscopic imaging of the whole of the small bowel. This procedure involves a wireless capsule endoscope and we describe here its successful testing in humans.

  11. 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...

  12. Wireless radio a history

    CERN Document Server

    Coe, Lewis

    2006-01-01

    ""Informative...recommended""--Choice; ""interesting...a good read...well worth reading""--Contact Magazine. This history first looks at Marconi's wireless communications system and then explores its many applications, including marine radio, cellular telephones, police and military uses, television and radar. Radio collecting is also discussed, and brief biographies are provided for the major figures in the development and use of the wireless.

  13. Wireless Networks Security

    OpenAIRE

    Jenko, Marko

    2016-01-01

    In this thesis we deal with security, penetration testing and different types of attacks on wireless networks. We theoretically familiarize with the field of wireless networks, security mechanisms and the most used security standards. Then we systematically overview the field of penetration testing. We divide the penetration testing on types and different methodologies. We explain the tasks of the provider and the subscriber in penetration testing. Description of the process of conducting the...

  14. A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

    OpenAIRE

    Lin Zhang; Na Yin; Xiong Fu; Qiaomin Lin; Ruchuan Wang

    2017-01-01

    With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems....

  15. Changes in population evacuation potential for tsunami hazards in Seward, Alaska, since the 1964 Good Friday earthquake

    Science.gov (United States)

    Wood, Nathan J.; Schmidtlein, Mathew C.; Peters, Jeff

    2014-01-01

    Pedestrian evacuation modeling for tsunami hazards typically focuses on current land-cover conditions and population distributions. To examine how post-disaster redevelopment may influence the evacuation potential of at-risk populations to future threats, we modeled pedestrian travel times to safety in Seward, Alaska, based on conditions before the 1964 Good Friday earthquake and tsunami disaster and on modern conditions. Anisotropic, path distance modeling is conducted to estimate travel times to safety during the 1964 event and in modern Seward, and results are merged with various population data, including the location and number of residents, employees, public venues, and dependent care facilities. Results suggest that modeled travel time estimates conform well to the fatality patterns of the 1964 event and that evacuation travel times have increased in modern Seward due to the relocation and expansion of port and harbor facilities after the disaster. The majority of individuals threatened by tsunamis today in Seward are employee, customer, and tourist populations, rather than residents in their homes. Modern evacuation travel times to safety for the majority of the region are less than wave arrival times for future tectonic tsunamis but greater than arrival times for landslide-related tsunamis. Evacuation travel times will likely be higher in the winter time, when the presence of snow may constrain evacuations to roads.

  16. 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…

  17. A Feedback-Based Secure Path Approach for Wireless Sensor Network Data Collection

    Directory of Open Access Journals (Sweden)

    Guiyi Wei

    2010-10-01

    Full Text Available The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. Therefore, how to preserve secure data collection is an important issue to wireless sensor networks. In this paper, we propose a novel approach of secure data collection for wireless sensor networks. We explore secret sharing and multipath routing to achieve secure data collection in wireless sensor network with compromised nodes. We present a novel tracing-feedback mechanism, which makes full use of the routing functionality of wireless sensor networks, to improve the quality of data collection. The major advantage of the approach is that the secure paths are constructed as a by-product of data collection. The process of secure routing causes little overhead to the sensor nodes in the network. Compared with existing works, the algorithms of the proposed approach are easy to implement and execute in resource-constrained wireless sensor networks. According to the result of a simulation experiment, the performance of the approach is better than the recent approaches with a similar purpose.

  18. State alternative route designations

    International Nuclear Information System (INIS)

    1989-07-01

    Pursuant to the Hazardous Materials Transportation Act (HMTA), the Department of Transportation (DOT) has promulgated a comprehensive set of regulations regarding the highway transportation of high-level radioactive materials. These regulations, under HM-164 and HM-164A, establish interstate highways as the preferred routes for the transportation of radioactive materials within and through the states. The regulations also provide a methodology by which a state may select alternative routes. First,the state must establish a ''state routing agency,'' defined as an entity authorized to use the state legal process to impose routing requirements on carriers of radioactive material (49 CFR 171.8). Once identified, the state routing agency must select routes in accordance with Large Quantity Shipments of Radioactive Materials or an equivalent routing analysis. Adjoining states and localities should be consulted on the impact of proposed alternative routes as a prerequisite of final route selection. Lastly, the states must provide written notice of DOT of any alternative route designation before the routes are deemed effective

  19. Ninth International Conference on Wireless Communication and Sensor Networks

    CERN Document Server

    Tiwari, Murlidhar; Arora, Anish

    2014-01-01

    Wireless communication and sensor networks would form the backbone to create pervasive and ubiquitous environments that would have profound influence on the society and thus are important to the society. The wireless communication technologies and wireless sensor networks would encompass a wide range of domains such as HW devices such as motes, sensors and associated instrumentation, actuators, transmitters, receivers, antennas, etc., sensor network aspects such as topologies, routing algorithms, integration of heterogeneous network elements and topologies, designing RF devices and systems for energy efficiency and reliability etc. These sensor networks would provide opportunity to continuously and in a distributed manner monitor the environment and generate the necessary warnings and actions. However most of the developments have been demonstrated only in controlled and laboratory environments. So we are yet to see those powerful, ubiquitous applications for the benefit of the society. The conference and con...

  20. Sending policies in dynamic wireless mesh using network coding

    DEFF Research Database (Denmark)

    Pandi, Sreekrishna; Fitzek, Frank; Pihl, Jeppe

    2015-01-01

    This paper demonstrates the quick prototyping capabilities of the Python-Kodo library for network coding based performance evaluation and investigates the problem of data redundancy in a network coded wireless mesh with opportunistic overhearing. By means of several wireless meshed architectures...... of appropriate relays. Finally, various sending policies that can be employed by the nodes in order to improve the overall transmission efficiency in a dynamic wireless mesh network are discussed and their performance is analysed on the constructed simulation setup....... simulated on the constructed test-bed, the advantage of network coding over state of the art routing schemes and the challenges of this new technology are shown. By providing maximum control of the network coding parameters and the simulation environment to the user, the test-bed facilitates quick...

  1. On the Effect of Security and Communication Factors in the Reliability of Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Damian Rusinek

    2014-03-01

    Full Text Available The ensuring reliability of wireless sensor networks (WSN is one of most important problems to be solved. In this article, the influence of the security and communication factors in the reliability of Wireless Sensor Networks was analyzed. Balancing security against performance in WSN is another issue to be solved. These factors should be considered during security analysis of quality of protection of realized protocol. In the article, we analyze wireless sensor network where hierarchical topologies is implemented with high performance routing sensors that forward big amount of data. We present the experiment results which were performed by high-performance Imote2 sensor platform and TinyOS operating system.

  2. A New Intrusion Detection System Based on KNN Classification Algorithm in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Wenchao Li

    2014-01-01

    abnormal nodes from normal nodes by observing their abnormal behaviors, and we analyse parameter selection and error rate of the intrusion detection system. The paper elaborates on the design and implementation of the detection system. This system has achieved efficient, rapid intrusion detection by improving the wireless ad hoc on-demand distance vector routing protocol (Ad hoc On-Demand Distance the Vector Routing, AODV. Finally, the test results show that: the system has high detection accuracy and speed, in accordance with the requirement of wireless sensor network intrusion detection.

  3. Radio link quality estimation in low-power wireless networks

    CERN Document Server

    2013-01-01

    This book provides a comprehensive survey on related work for radio link quality estimation, which covers the characteristics of low-power links, the fundamental concepts of link quality estimation in wireless sensor networks, a taxonomy of existing link quality estimators and their performance analysis. It then shows how link quality estimation can be used for designing protocols and mechanisms such as routing and hand-off. The final part is dedicated to radio interference estimation, generation and mitigation.

  4. OPTICAL WIRELESS COMMUNICATION SYSTEM

    Directory of Open Access Journals (Sweden)

    JOSHUA L.Y. CHIENG

    2016-02-01

    Full Text Available The growing demand of bandwidth in this modern internet age has been testing the existing telecommunication infrastructures around the world. With broadband speeds moving towards the region of Gbps and Tbps, many researches have begun on the development of using optical wireless technology as feasible and future methods to the current wireless technology. Unlike the existing radio frequency wireless applications, optical wireless uses electromagnetic spectrums that are unlicensed and free. With that, this project aim to understand and gain better understanding of optical wireless communication system by building an experimental and simulated model. The quality of service and system performance will be investigated and reviewed. This project employs laser diode as the propagation medium and successfully transferred audio signals as far as 15 meters. On its quality of service, results of the project model reveal that the bit error rate increases, signal-to-noise ratio and quality factor decreases as the link distance between the transmitter and receiver increases. OptiSystem was used to build the simulated model and MATLAB was used to assist signal-to-noise ratio calculations. By comparing the simulated and experimental receiver’s power output, the experimental model’s efficiency is at 66.3%. Other than the system’s performance, challenges and factors affecting the system have been investigated and discussed. Such challenges include beam divergence, misalignment and particle absorption.

  5. EXPERIMENTAL PERFORMANCE ANALYSIS OF WIRELESS ...

    African Journals Online (AJOL)

    ABSTRACT. Wireless networking is currently being deployed for various applications. However, the application of wireless networking in healthcare remains a challenge mainly because of security and reliability concerns. This paper presents experimental results of performance analysis of a wireless network for healthcare ...

  6. An optimized node-disjoint multipath routing scheme in mobile ad hoc

    Science.gov (United States)

    Yu, Yang; Liang, Mangui; Liu, Zhiyu

    2016-02-01

    In mobile ad hoc networks (MANETs), link failures are caused frequently because of node’s mobility and use of unreliable wireless channels for data transmission. Multipath routing strategy can cope with the problem of the traffic overloads while balancing the network resource consumption. In the paper, an optimized node-disjoint multipath routing (ONMR) protocol based on ad hoc on-demand vector (AODV) is proposed to establish effective multipath to enhance the network reliability and robustness. The scheme combines the characteristics of reverse AODV (R-AODV) strategy and on-demand node-disjoint multipath routing protocol to determine available node-disjoint routes with minimum routing control overhead. Meanwhile, it adds the backup routing strategy to make the process of data salvation more efficient in case of link failure. The results obtained through various simulations show the effectiveness of the proposed scheme in terms of route availability, control overhead and packet delivery ratio.

  7. Performance of the hybrid wireless mesh protocol for wireless mesh networks

    DEFF Research Database (Denmark)

    Boye, Magnus; Staalhagen, Lars

    2010-01-01

    . These challenges must first be overcome before satisfactory network stability and throughput can be achieved. This paper studies the performance of the Hybrid Wireless Mesh Protocol, the proposed routing protocol for the upcoming IEEE 802.11s standard. HWMP supports two modes of path selection: reactive...... and proactive. Two scenarios of different node density are considered for both path selection modes. The results presented in this paper are based on a simulation model of the HWMP specification in the IEEE 802.11s draft 4.0 implemented in OPNET Modeler....

  8. Developing a new wireless sensor network platform and its application in precision agriculture.

    Science.gov (United States)

    Aquino-Santos, Raúl; González-Potes, Apolinar; Edwards-Block, Arthur; Virgen-Ortiz, Raúl Alejandro

    2011-01-01

    Wireless sensor networks are gaining greater attention from the research community and industrial professionals because these small pieces of "smart dust" offer great advantages due to their small size, low power consumption, easy integration and support for "green" applications. Green applications are considered a hot topic in intelligent environments, ubiquitous and pervasive computing. This work evaluates a new wireless sensor network platform and its application in precision agriculture, including its embedded operating system and its routing algorithm. To validate the technological platform and the embedded operating system, two different routing strategies were compared: hierarchical and flat. Both of these routing algorithms were tested in a small-scale network applied to a watermelon field. However, we strongly believe that this technological platform can be also applied to precision agriculture because it incorporates a modified version of LORA-CBF, a wireless location-based routing algorithm that uses cluster-based flooding. Cluster-based flooding addresses the scalability concerns of wireless sensor networks, while the modified LORA-CBF routing algorithm includes a metric to monitor residual battery energy. Furthermore, results show that the modified version of LORA-CBF functions well with both the flat and hierarchical algorithms, although it functions better with the flat algorithm in a small-scale agricultural network.

  9. Developing a New Wireless Sensor Network Platform and Its Application in Precision Agriculture

    Directory of Open Access Journals (Sweden)

    Raúl Alejandro Virgen-Ortiz

    2011-01-01

    Full Text Available Wireless sensor networks are gaining greater attention from the research community and industrial professionals because these small pieces of “smart dust” offer great advantages due to their small size, low power consumption, easy integration and support for “green” applications. Green applications are considered a hot topic in intelligent environments, ubiquitous and pervasive computing. This work evaluates a new wireless sensor network platform and its application in precision agriculture, including its embedded operating system and its routing algorithm. To validate the technological platform and the embedded operating system, two different routing strategies were compared: hierarchical and flat. Both of these routing algorithms were tested in a small-scale network applied to a watermelon field. However, we strongly believe that this technological platform can be also applied to precision agriculture because it incorporates a modified version of LORA-CBF, a wireless location-based routing algorithm that uses cluster-based flooding. Cluster-based flooding addresses the scalability concerns of wireless sensor networks, while the modified LORA-CBF routing algorithm includes a metric to monitor residual battery energy. Furthermore, results show that the modified version of LORA-CBF functions well with both the flat and hierarchical algorithms, although it functions better with the flat algorithm in a small-scale agricultural network.

  10. Modeling and Performance Analysis of Route-Over and Mesh-Under Routing Schemes in 6LoWPAN under Error-Prone Channel Condition

    Directory of Open Access Journals (Sweden)

    Tsung-Han Lee

    2013-01-01

    Full Text Available 6LoWPAN technology has attracted extensive attention recently. It is because 6LoWPAN is one of Internet of Things standard and it adapts to IPv6 protocol stack over low-rate wireless personal area network, such as IEEE 802.15.4. One view is that IP architecture is not suitable for low-rate wireless personal area network. It is a challenge to implement the IPv6 protocol stack into IEEE 802.15.4 devices due to that the size of IPv6 packet is much larger than the maximum packet size of IEEE 802.15.4 in data link layer. In order to solve this problem, 6LoWPAN provides header compression to reduce the transmission overhead for IP packets. In addition, two selected routing schemes, mesh-under and route-over routing schemes, are also proposed in 6LoWPAN to forward IP fragmentations under IEEE 802.15.4 radio link. The distinction is based on which layer of the 6LoWPAN protocol stack is in charge of routing decisions. In route-over routing scheme, the routing distinction is taken at the network layer and, in mesh-under, is taken by the adaptation layer. Thus, the goal of this research is to understand the performance of two routing schemes in 6LoWPAN under error-prone channel condition.

  11. Wireless physical layer security

    Science.gov (United States)

    Poor, H. Vincent; Schaefer, Rafael F.

    2017-01-01

    Security in wireless networks has traditionally been considered to be an issue to be addressed separately from the physical radio transmission aspects of wireless systems. However, with the emergence of new networking architectures that are not amenable to traditional methods of secure communication such as data encryption, there has been an increase in interest in the potential of the physical properties of the radio channel itself to provide communications security. Information theory provides a natural framework for the study of this issue, and there has been considerable recent research devoted to using this framework to develop a greater understanding of the fundamental ability of the so-called physical layer to provide security in wireless networks. Moreover, this approach is also suggestive in many cases of coding techniques that can approach fundamental limits in practice and of techniques for other security tasks such as authentication. This paper provides an overview of these developments.

  12. Radial transfer of tracking data with wireless links

    CERN Document Server

    Pelikan, Daniel; Brenner, Richard; Dancila, Dragos; Gustafsson, Leif

    2014-01-01

    Wireless data transfer has revolutionized the consumer mar ket for the last decade giving products equipped with transmitters and receiver for wireless data t ransfer. Wireless technology has fea- tures attractive for data transfer in future tracking detec tors. The removal of wires and connectors for data links is certainly beneficial both for the material b udget and the reliability of the system. One other advantage is the freedom of routing signals which t oday is particularly complicated when bringing the data the first 50 cm outside the tracker. Wit h wireless links intelligence can be built into a tracker by introducing communication betwee n tracking layers within a Region Of Interest which would allow the construction of track primit ives in real time. The wireless signal is transmitted by a passive antenna structure which is a radiat ion hard and much less complex object than an optical link. Due to the requirement of high data rate s in detectors a high bandwidth is required. The frequency band aro...

  13. Contact Graph Routing

    Science.gov (United States)

    Burleigh, Scott C.

    2011-01-01

    Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic

  14. Route Availabililty Planning Tool -

    Data.gov (United States)

    Department of Transportation — The Route Availability Planning Tool (RAPT) is a weather-assimilated decision support tool (DST) that supports the development and execution of departure management...

  15. Terabit Wireless Communication Challenges

    Science.gov (United States)

    Hwu, Shian U.

    2012-01-01

    This presentation briefly discusses a research effort on Terabit Wireless communication systems for possible space applications. Recently, terahertz (THz) technology (300-3000 GHz frequency) has attracted a great deal of interest from academia and industry. This is due to a number of interesting features of THz waves, including the nearly unlimited bandwidths available, and the non-ionizing radiation nature which does not damage human tissues and DNA with minimum health threat. Also, as millimeter-wave communication systems mature, the focus of research is, naturally, moving to the THz range. Many scientists regard THz as the last great frontier of the electromagnetic spectrum, but finding new applications outside the traditional niches of radio astronomy, Earth and planetary remote sensing, and molecular spectroscopy particularly in biomedical imaging and wireless communications has been relatively slow. Radiologists find this area of study so attractive because t-rays are non-ionizing, which suggests no harm is done to tissue or DNA. They also offer the possibility of performing spectroscopic measurements over a very wide frequency range, and can even capture signatures from liquids and solids. According to Shannon theory, the broad bandwidth of the THz frequency bands can be used for terabit-per-second (Tb/s) wireless communication systems. This enables several new applications, such as cell phones with 360 degrees autostereoscopic displays, optic-fiber replacement, and wireless Tb/s file transferring. Although THz technology could satisfy the demand for an extremely high data rate, a number of technical challenges need to be overcome before its development. This presentation provides an overview the state-of-the- art in THz wireless communication and the technical challenges for an emerging application in Terabit wireless systems. The main issue for THz wave propagation is the high atmospheric attenuation, which is dominated by water vapor absorption in the THz

  16. Wireless distributed functional electrical stimulation system.

    Science.gov (United States)

    Jovičić, Nenad S; Saranovac, Lazar V; Popović, Dejan B

    2012-08-09

    The control of movement in humans is hierarchical and distributed and uses feedback. An assistive system could be best integrated into the therapy of a human with a central nervous system lesion if the system is controlled in a similar manner. Here, we present a novel wireless architecture and routing protocol for a distributed functional electrical stimulation system that enables control of movement. The new system comprises a set of miniature battery-powered devices with stimulating and sensing functionality mounted on the body of the subject. The devices communicate wirelessly with one coordinator device, which is connected to a host computer. The control algorithm runs on the computer in open- or closed-loop form. A prototype of the system was designed using commercial, off-the-shelf components. The propagation characteristics of electromagnetic waves and the distributed nature of the system were considered during the development of a two-hop routing protocol, which was implemented in the prototype's software. The outcomes of this research include a novel system architecture and routing protocol and a functional prototype based on commercial, off-the-shelf components. A proof-of-concept study was performed on a hemiplegic subject with paresis of the right arm. The subject was tasked with generating a fully functional palmar grasp (closing of the fingers). One node was used to provide this movement, while a second node controlled the activation of extensor muscles to eliminate undesired wrist flexion. The system was tested with the open- and closed-loop control algorithms. The system fulfilled technical and application requirements. The novel communication protocol enabled reliable real-time use of the system in both closed- and open-loop forms. The testing on a patient showed that the multi-node system could operate effectively to generate functional movement.

  17. Wireless distributed functional electrical stimulation system

    Directory of Open Access Journals (Sweden)

    Jovičić Nenad S

    2012-08-01

    Full Text Available Abstract Background The control of movement in humans is hierarchical and distributed and uses feedback. An assistive system could be best integrated into the therapy of a human with a central nervous system lesion if the system is controlled in a similar manner. Here, we present a novel wireless architecture and routing protocol for a distributed functional electrical stimulation system that enables control of movement. Methods The new system comprises a set of miniature battery-powered devices with stimulating and sensing functionality mounted on the body of the subject. The devices communicate wirelessly with one coordinator device, which is connected to a host computer. The control algorithm runs on the computer in open- or closed-loop form. A prototype of the system was designed using commercial, off-the-shelf components. The propagation characteristics of electromagnetic waves and the distributed nature of the system were considered during the development of a two-hop routing protocol, which was implemented in the prototype’s software. Results The outcomes of this research include a novel system architecture and routing protocol and a functional prototype based on commercial, off-the-shelf components. A proof-of-concept study was performed on a hemiplegic subject with paresis of the right arm. The subject was tasked with generating a fully functional palmar grasp (closing of the fingers. One node was used to provide this movement, while a second node controlled the activation of extensor muscles to eliminate undesired wrist flexion. The system was tested with the open- and closed-loop control algorithms. Conclusions The system fulfilled technical and application requirements. The novel communication protocol enabled reliable real-time use of the system in both closed- and open-loop forms. The testing on a patient showed that the multi-node system could operate effectively to generate functional movement.

  18. Wireless communications algorithmic techniques

    CERN Document Server

    Vitetta, Giorgio; Colavolpe, Giulio; Pancaldi, Fabrizio; Martin, Philippa A

    2013-01-01

    This book introduces the theoretical elements at the basis of various classes of algorithms commonly employed in the physical layer (and, in part, in MAC layer) of wireless communications systems. It focuses on single user systems, so ignoring multiple access techniques. Moreover, emphasis is put on single-input single-output (SISO) systems, although some relevant topics about multiple-input multiple-output (MIMO) systems are also illustrated.Comprehensive wireless specific guide to algorithmic techniquesProvides a detailed analysis of channel equalization and channel coding for wi

  19. Pervasive wireless environments

    CERN Document Server

    Yang, Jie; Trappe, Wade; Cheng, Jerry

    2014-01-01

    This Springer Brief provides a new approach to prevent user spoofing by using the physical properties associated with wireless transmissions to detect the presence of user spoofing. The most common method, applying cryptographic authentication, requires additional management and computational power that cannot be deployed consistently. The authors present the new approach by offering a summary of the recent research and exploring the benefits and potential challenges of this method. This brief discusses the feasibility of launching user spoofing attacks and their impact on the wireless and sen

  20. Wireless optical telecommunications

    CERN Document Server

    Bouchet, Olivier

    2013-01-01

    Wireless optical communication refers to communication based on the unguided propagation of optical waves. The past 30 years have seen significant improvements in this technique - a wireless communication solution for the current millennium - that offers an alternative to radio systems; a technique that could gain attractiveness due to recent concerns regarding the potential effects of radiofrequency waves on human health.The aim of this book is to look at the free space optics that are already used for the exchange of current information; its many benefits, such as incorporating chan

  1. Wireless telecommunication systems

    CERN Document Server

    Terré, Michel; Vivier, Emmanuelle

    2013-01-01

    Wireless telecommunication systems generate a huge amount of interest. In the last two decades, these systems have experienced at least three major technological leaps, and it has become impossible to imagine how society was organized without them. In this book, we propose a macroscopic approach on wireless systems, and aim at answering key questions about power, data rates, multiple access, cellular engineering and access networks architectures.We present a series of solved problems, whose objective is to establish the main elements of a global link budget in several radiocommunicati

  2. Data converters for wireless standards

    CERN Document Server

    Shi, Chunlei

    2002-01-01

    Wireless communication is witnessing tremendous growth with proliferation of different standards covering wide, local and personal area networks (WAN, LAN and PAN). The trends call for designs that allow 1) smooth migration to future generations of wireless standards with higher data rates for multimedia applications, 2) convergence of wireless services allowing access to different standards from the same wireless device, 3) inter-continental roaming. This requires designs that work across multiple wireless standards, can easily be reused, achieve maximum hardware share at a minimum power consumption levels particularly for mobile battery-operated devices.

  3. Evaluation and development the routing protocol of a fully functional simulation environment for VANETs

    Science.gov (United States)

    Ali, Azhar Tareq; Warip, Mohd Nazri Mohd; Yaakob, Naimah; Abduljabbar, Waleed Khalid; Atta, Abdu Mohammed Ali

    2017-11-01

    Vehicular Ad-hoc Networks (VANETs) is an area of wireless technologies that is attracting a great deal of interest. There are still several areas of VANETS, such as security and routing protocols, medium access control, that lack large amounts of research. There is also a lack of freely available simulators that can quickly and accurately simulate VANETs. The main goal of this paper is to develop a freely available VANETS simulator and to evaluate popular mobile ad-hoc network routing protocols in several VANETS scenarios. The VANETS simulator consisted of a network simulator, traffic (mobility simulator) and used a client-server application to keep the two simulators in sync. The VANETS simulator also models buildings to create a more realistic wireless network environment. Ad-Hoc Distance Vector routing (AODV), Dynamic Source Routing (DSR) and Dynamic MANET On-demand (DYMO) were initially simulated in a city, country, and highway environment to provide an overall evaluation.

  4. 75 FR 8400 - In the Matter of Certain Wireless Communications System Server Software, Wireless Handheld...

    Science.gov (United States)

    2010-02-24

    ... Communications System Server Software, Wireless Handheld Devices and Battery Packs; Notice of Investigation... within the United States after importation of certain wireless communications system server software... certain wireless communications system server software, wireless handheld devices or battery packs that...

  5. 75 FR 43206 - In the Matter of Certain Wireless Communications System Server Software, Wireless Handheld...

    Science.gov (United States)

    2010-07-23

    ... INTERNATIONAL TRADE COMMISSION [Investigation No. 337-TA-706] In the Matter of Certain Wireless Communications System Server Software, Wireless Handheld Devices and Battery Packs: Notice of Commission... United States after importation of certain wireless communications system server software, wireless...

  6. Effects of wireless packet loss in industrial process control systems.

    Science.gov (United States)

    Liu, Yongkang; Candell, Richard; Moayeri, Nader

    2017-05-01

    controller to the burstiness of packet loss is also characterized in different process stages. The performance results indicate that wireless links with redundant bandwidth reservation can meet the requirements of the TE process model under normal operational conditions. When disturbances are introduced in the TE plant model, wireless packet loss during transitions between process stages need further protection in severely impaired links. Techniques such as retransmission scheduling, multipath routing and enhanced physical layer design are discussed and the latest industrial wireless protocols are compared. Published by Elsevier Ltd.

  7. Resource management in wireless networking

    CERN Document Server

    Cardei, Mihaela; Du, Ding-Zhu

    2005-01-01

    This is the first book that provides readers with a deep technical overview of recent advances in resource management for wireless networks at different layers of the protocol stack. The subject is explored in various wireless networks, such as ad hoc wireless networks, 3G/4G cellular, IEEE 802.11, and Bluetooth personal area networks.Survey chapters give an excellent introduction to key topics in resource management for wireless networks, while experts will be satisfied by the technical depth of the knowledge imparted in chapters exploring hot research topics.The subject area discussed in this book is very relevant today, considering the recent remarkable growth of wireless networking and the convergence of wireless personal communications, internet technologies and real-time multimedia.This volume is a very good companion for practitioners working on implementing solutions for multimedia and Quality of Service - sensitive applications over wireless networks.Written for:Researchers, faculty members, students...

  8. A Group Vehicular Mobility Model for Routing Protocol Analysis in Mobile Ad Hoc Network

    OpenAIRE

    Kulkarni, Shrirang Ambaji; Rao, G Raghavendra

    2010-01-01

    Performance of routing protocols in mobile ad-hoc networks is greatly affected by the dynamic nature of nodes, route failures, wireless channels with variable bandwidth and scalability issues. A mobility model imitates the real world movement of mobile nodes and is central component to simulation based studies. In this paper we consider mobility nodes which mimic the vehicular motion of nodes like Manhattan mobility model and City Section mobility model. We also propose a new Group Vehicular ...

  9. An Efficient Route Maintenance Protocol for Dynamic Bluetooth Networks

    Directory of Open Access Journals (Sweden)

    Sabeen Tahir

    2017-10-01

    Full Text Available Bluetooth is a widespread technology for small wireless networks that permits Bluetooth devices to construct a multi-hop network called scatternet. Routing in multi-hop dynamic Bluetooth network, where a number of masters and bridges exist creates technical hitches. It is observed that frequent link disconnections and a new route construction consume extra system resources that degrade the whole network performance. Therefore, in this paper an Efficient Route Maintenance Protocol for Dynamic Bluetooth Networks (ERMP is proposed that repairs the weak routing paths based on the prediction of weak links and weak devices. The ERMP predicts the weak links through the signal strength and weak devices through low energy levels. During the main route construction, routing masters and bridges keep the information of the Fall Back Devices (FBDs for route maintenance. On the prediction of a weak link, the ERMP activates an alternate link, on the other hand, for a weak device it activates the FBD. The proposed ERMP is compared with some existing closely related protocols, and the simulation results show that the proposed ERMP successfully recovers the weak paths and improves the system performance.

  10. Wireless Distributed Antenna MIMO

    DEFF Research Database (Denmark)

    2015-01-01

    The present disclosure relates to system applications of multicore optical fibers. One embodiment relates to a base transceiver station for a wireless telecommunication system comprising a plurality of antenna units arranged in a MIMO configuration and adapted for transmission and/or reception...

  11. Wireless Remote Control System

    Directory of Open Access Journals (Sweden)

    Adrian Tigauan

    2012-06-01

    Full Text Available This paper presents the design of a wireless remote control system based on the ZigBee communication protocol. Gathering data from sensors or performing control tasks through wireless communication is advantageous in situations in which the use of cables is impractical. An Atmega328 microcontroller (from slave device is used for gathering data from the sensors and transmitting it to a coordinator device with the help of the XBee modules. The ZigBee standard is suitable for low-cost, low-data-rate and low-power wireless networks implementations. The XBee-PRO module, designed to meet ZigBee standards, requires minimal power for reliable data exchange between devices over a distance of up to 1600m outdoors. A key component of the ZigBee protocol is the ability to support networking and this can be used in a wireless remote control system. This system may be employed e.g. to control temperature and humidity (SHT11 sensor and light intensity (TSL230 sensor levels inside a commercial greenhouse.

  12. 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.

  13. Wireless networked music performance

    CERN Document Server

    Gabrielli, Leonardo

    2016-01-01

    This book presents a comprehensive overview of the state of the art in Networked Music Performance (NMP) and a historical survey of computer music networking. It introduces current technical trends in NMP and technical issues yet to be addressed. It also lists wireless communication protocols and compares these to the requirements of NMP. Practical use cases and advancements are also discussed.

  14. Inter–Vehicular Communications Using Wireless Ad–Hoc Networks

    Directory of Open Access Journals (Sweden)

    R. Aquino–Santos

    2008-10-01

    Full Text Available This paper proposes a new routing algorithm to facilitate communication in highly mobile wireless ad–hoc networks for motorway environments with no physical infrastructure which undergo frequent topological changes. This new reactive routing algorithm for inter–vehicular communication is based on location information in which the source node ascertains the position of its communication partner before it initiates communication. The advantage of this algorithm is that it does not require global knowledge to send information between transmitter–receiver pairs. Instead, this algorithm requires knowledge of the relative positions of its neighbor nodes and the position of the destination. This paper discusses simulations of 250 vehicles driving on a six–lane circular highway using Location Routing Algorithm with Cluster–Based Flooding (LORA–CBF. Highway vehicular mobility is simulated by a microscopic traffic model, developed in OPNET, to evaluate the performance of the LORA–CBF and Greedy Perimeter Stateless Routing (GPSR algorithms in terms of Route Discovery Time (RDT, End–to–End Delay (EED, Routing Overhead (RO, Routing Load (RL and Delivery Ratio (DR.

  15. NASA Bluetooth Wireless Communications

    Science.gov (United States)

    Miller, Robert D.

    2007-01-01

    NASA has been interested in wireless communications for many years, especially when the crew size of the International Space Station (ISS) was reduced to two members. NASA began a study to find ways to improve crew efficiency to make sure the ISS could be maintained with limited crew capacity and still be a valuable research testbed in Low-Earth Orbit (LEO). Currently the ISS audio system requires astronauts to be tethered to the audio system, specifically a device called the Audio Terminal Unit (ATU). Wireless communications would remove the tether and allow astronauts to freely float from experiment to experiment without having to worry about moving and reconnecting the associated cabling or finding the space equivalent of an extension cord. A wireless communication system would also improve safety and reduce system susceptibility to Electromagnetic Interference (EMI). Safety would be improved because a crewmember could quickly escape a fire while maintaining communications with the ground and other crewmembers at any location. In addition, it would allow the crew to overcome the volume limitations of the ISS ATU. This is especially important to the Portable Breathing Apparatus (PBA). The next generation of space vehicles and habitats also demand wireless attention. Orion will carry up to six crewmembers in a relatively small cabin. Yet, wireless could become a driving factor to reduce launch weight and increase habitable volume. Six crewmembers, each tethered to a panel, could result in a wiring mess even in nominal operations. In addition to Orion, research is being conducted to determine if Bluetooth is appropriate for Lunar Habitat applications.

  16. Interference Effects Redress over Power-Efficient Wireless-Friendly Mesh Networks for Ubiquitous Sensor Communications across Smart Cities.

    Science.gov (United States)

    Santana, Jose; Marrero, Domingo; Macías, Elsa; Mena, Vicente; Suárez, Álvaro

    2017-07-21

    Ubiquitous sensing allows smart cities to take control of many parameters (e.g., road traffic, air or noise pollution levels, etc.). An inexpensive Wireless Mesh Network can be used as an efficient way to transport sensed data. When that mesh is autonomously powered (e.g., solar powered), it constitutes an ideal portable network system which can be deployed when needed. Nevertheless, its power consumption must be restrained to extend its operational cycle and for preserving the environment. To this end, our strategy fosters wireless interface deactivation among nodes which do not participate in any route. As we show, this contributes to a significant power saving for the mesh. Furthermore, our strategy is wireless-friendly, meaning that it gives priority to deactivation of nodes receiving (and also causing) interferences from (to) the rest of the smart city. We also show that a routing protocol can adapt to this strategy in which certain nodes deactivate their own wireless interfaces.

  17. Understanding individual routing behaviour.

    Science.gov (United States)

    Lima, Antonio; Stanojevic, Rade; Papagiannaki, Dina; Rodriguez, Pablo; González, Marta C

    2016-03-01

    Knowing how individuals move between places is fundamental to advance our understanding of human mobility (González et al. 2008 Nature 453, 779-782. (doi:10.1038/nature06958)), improve our urban infrastructure (Prato 2009 J. Choice Model. 2, 65-100. (doi:10.1016/S1755-5345(13)70005-8)) and drive the development of transportation systems. Current route-choice models that are used in transportation planning are based on the widely accepted assumption that people follow the minimum cost path (Wardrop 1952 Proc. Inst. Civ. Eng. 1, 325-362. (doi:10.1680/ipeds.1952.11362)), despite little empirical support. Fine-grained location traces collected by smart devices give us today an unprecedented opportunity to learn how citizens organize their travel plans into a set of routes, and how similar behaviour patterns emerge among distinct individual choices. Here we study 92 419 anonymized GPS trajectories describing the movement of personal cars over an 18-month period. We group user trips by origin-destination and we find that most drivers use a small number of routes for their routine journeys, and tend to have a preferred route for frequent trips. In contrast to the cost minimization assumption, we also find that a significant fraction of drivers' routes are not optimal. We present a spatial probability distribution that bounds the route selection space within an ellipse, having the origin and the destination as focal points, characterized by high eccentricity independent of the scale. While individual routing choices are not captured by path optimization, their spatial bounds are similar, even for trips performed by distinct individuals and at various scales. These basic discoveries can inform realistic route-choice models that are not based on optimization, having an impact on several applications, such as infrastructure planning, routing recommendation systems and new mobility solutions. © 2016 The Author(s).

  18. Energy aware GPSR routing protocol in a WSN | Nouh | Zede Journal

    African Journals Online (AJOL)

    Energy is the scarce resource in wireless sensor networks (WSNs), and it determines the lifetime of WSNs. For this reason, WSN algorithms and routing protocols should be selected in a manner which fulfills these energy requirements. This paper presents a solution to increase the lifetime of WSNs by decreasing their ...

  19. Multipath routing and multiple description coding in ad-hoc networks: A simulation study

    NARCIS (Netherlands)

    Díaz, I.F.; Epema, D.; Jongh, J. de

    2004-01-01

    The nature of wireless multihop ad-hoc networks makes it a challenge to offer connections of an assured quality. In order to improve the performance of such networks, multipath routing in combination with Multiple Description Coding (MDC) has been proposed. By splitting up streams of multimedia

  20. A node-disjoint multi-path routing protocol based on location ...

    African Journals Online (AJOL)

    user

    control message overhead. Keywords: Multi-path Routing Protocol, Mobile Ad hoc Networks, Location Prediction, Node Disjoint, Simulation. 1. Introduction ..... synchronization algorithms (example: Naumov et al., 2006; Sheu et al., 2007) have been proposed for wireless ad hoc networks. The destination node computes and ...

  1. Energy consumption and control response evaluations of AODV routing in WSANs for building-temperature control.

    Science.gov (United States)

    Booranawong, Apidet; Teerapabkajorndet, Wiklom; Limsakul, Chusak

    2013-06-27

    The main objective of this paper is to investigate the effects of routing protocols on wireless sensor and actuator networks (WSANs), focusing on the control system response and the energy consumption of nodes in a network. We demonstrate that routing algorithms designed without considering the relationship between communication and control cannot be appropriately used in wireless networked control applications. For this purpose, an ad-hoc on-demand distance vector (AODV) routing, an IEEE 802.15.4, and a building-temperature control system are employed for this exploration. The findings from our scenarios show that the AODV routing can select a path with a high traffic load for data transmission. It takes a long time before deciding to change a new route although it experiences the unsuccessful transmission of packets. As a result, the desirable control target cannot be achieved in time, and nodes consume more energy due to frequent packet collisions and retransmissions. Consequently, we propose a simple routing solution to alleviate these research problems by modifying the original AODV routing protocol. The delay-threshold is considered to avoid any congested connection during routing procedures. The simulation results demonstrate that our solution can be appropriately applied in WSANs. Both the energy consumption and the control system response are improved.

  2. Power Balance AODV Routing Algorithm of WSN in Precision Agriculture Environment Monitoring

    Directory of Open Access Journals (Sweden)

    Xiaoqin Qin

    2013-11-01

    Full Text Available As one of important technologies of IOT (Internet of Things, WSN (Wireless Sensor Networks has been widely used in precision agriculture environment monitoring. WSN is a kind of energy-constrained network, but power balance is not taken into account in traditional routing protocols. A novel routing algorithm, named Power Balance Ad hoc On-Demand Distance Vector (PB-AODV, is proposed on cross-layer design. In the route discovery process of PB-AODV, routing path is established by the Received Signal Strength Indication (RSSI value. The optimal transmitting power, which is computed according to RSSI value, power threshold and node’s surplus energy, is encapsulated into Route Reply Packet. Hence, the sender node can adjust its transmission power to save energy according to the Route Reply Packet. Simulation results show that the proposed algorithm is effective for load balancing, and increases the WSN’s lifetime 14.3% consequently.

  3. A survey on bio inspired meta heuristic based clustering protocols for wireless sensor networks

    Science.gov (United States)

    Datta, A.; Nandakumar, S.

    2017-11-01

    Recent studies have shown that utilizing a mobile sink to harvest and carry data from a Wireless Sensor Network (WSN) can improve network operational efficiency as well as maintain uniform energy consumption by the sensor nodes in the network. Due to Sink mobility, the path between two sensor nodes continuously changes and this has a profound effect on the operational longevity of the network and a need arises for a protocol which utilizes minimal resources in maintaining routes between the mobile sink and the sensor nodes. Swarm Intelligence based techniques inspired by the foraging behavior of ants, termites and honey bees can be artificially simulated and utilized to solve real wireless network problems. The author presents a brief survey on various bio inspired swarm intelligence based protocols used in routing data in wireless sensor networks while outlining their general principle and operation.

  4. Optimization of wireless sensor networks based on chicken swarm optimization algorithm

    Science.gov (United States)

    Wang, Qingxi; Zhu, Lihua

    2017-05-01

    In order to reduce the energy consumption of wireless sensor network and improve the survival time of network, the clustering routing protocol of wireless sensor networks based on chicken swarm optimization algorithm was proposed. On the basis of LEACH agreement, it was improved and perfected that the points on the cluster and the selection of cluster head using the chicken group optimization algorithm, and update the location of chicken which fall into the local optimum by Levy flight, enhance population diversity, ensure the global search capability of the algorithm. The new protocol avoided the die of partial node of intensive using by making balanced use of the network nodes, improved the survival time of wireless sensor network. The simulation experiments proved that the protocol is better than LEACH protocol on energy consumption, also is better than that of clustering routing protocol based on particle swarm optimization algorithm.

  5. 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

  6. Contention aware mobility prediction routing for intermittently connected mobile networks

    KAUST Repository

    Elwhishi, Ahmed

    2013-04-26

    This paper introduces a novel multi-copy routing protocol, called predict and forward (PF), for delay tolerant networks, which aims to explore the possibility of using mobile nodes as message carriers for end-to-end delivery of the messages. With PF, the message forwarding decision is made by manipulating the probability distribution of future inter-contact and contact durations based on the network status, including wireless link condition and nodal buffer availability. In particular, PF is based on the observations that the node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. We implemented the proposed protocol and compared it with a number of existing encounter-based routing approaches in terms of delivery delay, delivery ratio, and the number of transmissions required for message delivery. The simulation results show that PF outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

  7. The Lure of Wireless Encryption

    CERN Multimedia

    Computer Security Team

    2013-01-01

    Following our article entitled “Jekyll or Hyde? Better browse securely” in the last issue of the Bulletin, some people wondered why the CERN wireless network is not encrypted…   There are many arguments why it is not. The simplest is usability: the communication and management of the corresponding access keys would be challenging given the sheer number of wireless devices the CERN network hosts. Keys would quickly become public, e.g. at conferences, and might be shared, written on whiteboards, etc. Then there are all the devices which cannot be easily configured to use encryption protocols - a fact which would create plenty of calls to the CERN Service Desk… But our main argument is that wireless encryption is DECEPTIVE. Wireless encryption is deceptive as it only protects the wireless network against unauthorised access (and the CERN network already has other means to protect against that). Wireless encryption however, does not really help you. You ...

  8. IEEE 802.11s Wireless Mesh Networks: Challenges and Perspectives

    Science.gov (United States)

    Sgora, Aggeliki; Vergados, Dimitris D.; Chatzimisios, Periklis

    A promising solution for wireless environments is the wireless mesh technology that envisages supplementing wired infrastructure with a wireless backbone for providing Internet connectivity to mobile nodes (MNs) or users in residential areas and offices. The IEEE 802.11 TGs has started to work in developing a mesh standard for local area wireless networks. Although a lot of progress has been made and a few new drafts have been released recently, there exist many issues that demand enhanced or even new solutions to 802.11s mesh networking. This paper aims to overview the latest version of the IEEE 802.11s protocol (Draft 2.02), especially the MAC and routing layers, and to point out the challenges that these networks have to overcome in these layers.

  9. Routes and Stations

    Data.gov (United States)

    Department of Homeland Security — he Routes_Stations table is composed of fixed rail transit systems within the Continental United States, Alaska, Hawaii, the District of Columbia, and Puerto Rico....

  10. Class network routing

    Science.gov (United States)

    Bhanot, Gyan [Princeton, NJ; Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Takken, Todd E [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

    2009-09-08

    Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

  11. Matching theory for wireless networks

    CERN Document Server

    Han, Zhu; Saad, Walid

    2017-01-01

    This book provides the fundamental knowledge of the classical matching theory problems. It builds up the bridge between the matching theory and the 5G wireless communication resource allocation problems. The potentials and challenges of implementing the semi-distributive matching theory framework into the wireless resource allocations are analyzed both theoretically and through implementation examples. Academics, researchers, engineers, and so on, who are interested in efficient distributive wireless resource allocation solutions, will find this book to be an exceptional resource. .

  12. An Assessment of Emerging Wireless Broadband Technologies

    National Research Council Canada - National Science Library

    Fountanas, Leonidas

    2001-01-01

    ... technologies in providing broadband services today, emerging wireless broadband technologies are expected to significantly increase their market share over the next years, Deploying a wireless network...

  13. Wireless Sensor Portal Technology Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Recognizing the needs and challenges facing NASA Earth Science for data input, manipulation and distribution, Mobitrum is proposing a ? Wireless Sensor Portal...

  14. Adaptive Wireless Transceiver, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — Wireless technologies are an increasingly attractive means for spatial data, input, manipulation, and distribution. Mobitrum is proposing an innovative Adaptive...

  15. Smart Home Wireless Sensor Nodes

    DEFF Research Database (Denmark)

    Lynggaard, Per

    Smart homes are further development of intelligent buildings and home automation, where context awareness and autonomous behaviour are added. They are based on a combination of the Internet and emerging technologies like wireless sensor nodes. These wireless sensor nodes are challenging because....... This paper introduces an approach that considerably lowers the wireless sensor node power consumption and the amount of transmitted sensor events. It uses smart objects that include artificial intelligence to efficiently process the sensor event on location and thereby saves the costly wireless...

  16. Some Challenges in Wireless Security

    National Research Council Canada - National Science Library

    Banerjee, Suman

    2007-01-01

    Wireless communication technologies provide users with significant flexibility and portability and hence is being widely adopted as a preferred mode of communication in many military and civilian applications...

  17. Smart Home Wireless Sensor Nodes

    DEFF Research Database (Denmark)

    Lynggaard, Per

    . This paper introduces an approach that considerably lowers the wireless sensor node power consumption and the amount of transmitted sensor events. It uses smart objects that include artificial intelligence to efficiently process the sensor event on location and thereby saves the costly wireless......Smart homes are further development of intelligent buildings and home automation, where context awareness and autonomous behaviour are added. They are based on a combination of the Internet and emerging technologies like wireless sensor nodes. These wireless sensor nodes are challenging because...

  18. Radiation detection and wireless networked early warning

    Science.gov (United States)

    Burns, David A.; Litz, Marc S.; Carroll, James J.; Katsis, Dimosthenis

    2012-06-01

    We have designed a compact, wireless, GPS-enabled array of inexpensive radiation sensors based on scintillation counting. Each sensor has a scintillator, photomultiplier tube, and pulse-counting circuit that includes a comparator, digital potentiometer and microcontroller. This design provides a high level of sensitivity and reliability. A 0.2 m2 PV panel powers each sensor providing a maintenance-free 24/7 energy source. The sensor can be mounted within a roadway light-post and monitor radiological activity along transport routes. Each sensor wirelessly transmits real-time data (as counts per second) up to 2 miles with a XBee radio module, and the data is received by a XBee receive-module on a computer. Data collection software logs the information from all sensors and provides real-time identification of radiation events. Measurements performed to-date demonstrate the ability of a sensor to detect a 20 μCi source at 3.5 meters when packaged with a PVT (plastic) scintillator, and 7 meters for a sensor with a CsI crystal (more expensive but ~5 times more sensitive). It is calculated that the sensor-architecture can detect sources moving as fast as 130 km/h based on the current data rate and statistical bounds of 3-sigma threshold detection. The sensor array is suitable for identifying and tracking a radiation threat from a dirty bomb along roadways.

  19. Cognitive wireless networks

    CERN Document Server

    Feng, Zhiyong; Zhang, Ping

    2015-01-01

    This brief examines the current research in cognitive wireless networks (CWNs). Along with a review of challenges in CWNs, this brief presents novel theoretical studies and architecture models for CWNs, advances in the cognitive information awareness and delivery, and intelligent resource management technologies. The brief presents the motivations and concepts of CWNs, including theoretical studies of temporal and geographic distribution entropy as well as cognitive information metrics. A new architecture model of CWNs is proposed with theoretical, functional and deployment architectures suppo

  20. Reinforcement Learning for Routing in Cognitive Radio Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Hasan A. A. Al-Rawi

    2014-01-01

    Full Text Available Cognitive radio (CR enables unlicensed users (or secondary users, SUs to sense for and exploit underutilized licensed spectrum owned by the licensed users (or primary users, PUs. Reinforcement learning (RL is an artificial intelligence approach that enables a node to observe, learn, and make appropriate decisions on action selection in order to maximize network performance. Routing enables a source node to search for a least-cost route to its destination node. While there have been increasing efforts to enhance the traditional RL approach for routing in wireless networks, this research area remains largely unexplored in the domain of routing in CR networks. This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate through simulation. New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing. Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs’ network performance without significantly jeopardizing PUs’ network performance, specifically SUs’ interference to PUs.

  1. Reinforcement learning for routing in cognitive radio ad hoc networks.

    Science.gov (United States)

    Al-Rawi, Hasan A A; Yau, Kok-Lim Alvin; Mohamad, Hafizal; Ramli, Nordin; Hashim, Wahidah

    2014-01-01

    Cognitive radio (CR) enables unlicensed users (or secondary users, SUs) to sense for and exploit underutilized licensed spectrum owned by the licensed users (or primary users, PUs). Reinforcement learning (RL) is an artificial intelligence approach that enables a node to observe, learn, and make appropriate decisions on action selection in order to maximize network performance. Routing enables a source node to search for a least-cost route to its destination node. While there have been increasing efforts to enhance the traditional RL approach for routing in wireless networks, this research area remains largely unexplored in the domain of routing in CR networks. This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate) through simulation. New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing. Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs' network performance without significantly jeopardizing PUs' network performance, specifically SUs' interference to PUs.

  2. Energy Efficient and QoS sensitive Routing Protocol for Ad Hoc Networks

    International Nuclear Information System (INIS)

    Tanoli, Tariq Saeed; Khan, Muhammad Khalid

    2013-01-01

    Efficient routing is an important part of wireless ad hoc networks. Since in ad hoc networks we have limited resources, there are many limitations like bandwidth, battery consumption, and processing cycle etc. Reliability is also necessary since there is no allowance for invalid or incomplete information (and expired data is useless). There are various protocols that perform routing by considering one parameter but ignoring other parameters. In this paper we present a protocol that finds route on the basis of bandwidth, energy and mobility of the nodes participating in the communication

  3. Network Coding Based Security for Routing Attacks in WRN: Frechet Interference and Rayleigh Outage Evaluation

    Directory of Open Access Journals (Sweden)

    R. Villalpando-Hernández

    2011-08-01

    Full Text Available We present a network coding security method capable of detecting several routing attacks in wireless reconfigurablenetworks. Routing security attacks include selective forwarding, black holes, and wormholes. The proposed methodperforms linear network coding over intermediate nodes composing a given route, not only to distribute content, butalso to provide data confidentiality by cooperation as a mechanism of detection. The method presents a robust,accurate and fast response under security attacks for varying network conditions, such as interference and outagedue to channel fading. It also provides a gain in network throughput by increasing the number of successfully receivedpackets without a significant increase of the bandwidth usage.

  4. Key Management for Secure Multicast over IPv6 Wireless Networks

    Directory of Open Access Journals (Sweden)

    Siddiqi Mohammad Umar

    2006-01-01

    Full Text Available Multicasting is an efficient method for transmission and routing of packets to multiple destinations using fewer network resources. Along with widespread deployment of wireless networks, secure multicast over wireless networks is an important and challenging goal. In this paper, we extend the scope of a recent new key distribution scheme to a security framework that offers a novel solution for secure multicast over IPv6 wireless networks. Our key management framework includes two scenarios for securely distributing the group key and rekey messages for joining and leaving a mobile host in secure multicast group. In addition, we perform the security analysis and provide performance comparisons between our approach and two recently published scenarios. The benefits of our proposed techniques are that they minimize the number of transmissions required to rekey the multicast group and impose minimal storage requirements on the multicast group. In addition, our proposed schemes are also very desirable from the viewpoint of transmission bandwidth savings since an efficient rekeying mechanism is provided for membership changes and they significantly reduce the required bandwidth due to key updating in mobile networks. Moreover, they achieve the security and scalability requirements in wireless networks.

  5. 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)

  6. Underwater Optical Wireless Communications, Networking, and Localization: A Survey

    KAUST Repository

    Saeed, Nasir

    2018-02-28

    Underwater wireless communications can be carried out through acoustic, radio frequency (RF), and optical waves. Compared to its bandwidth limited acoustic and RF counterparts, underwater optical wireless communications (UOWCs) can support higher data rates at low latency levels. However, severe aquatic channel conditions (e.g., absorption, scattering, turbulence, etc.) pose great challenges for UOWCs and significantly reduce the attainable communication ranges, which necessitates efficient networking and localization solutions. Therefore, we provide a comprehensive survey on the challenges, advances, and prospects of underwater optical wireless networks (UOWNs) from a layer by layer perspective which includes: 1) Potential network architectures; 2) Physical layer issues including propagation characteristics, channel modeling, and modulation techniques 3) Data link layer problems covering link configurations, link budgets, performance metrics, and multiple access schemes; 4) Network layer topics containing relaying techniques and potential routing algorithms; 5) Transport layer subjects such as connectivity, reliability, flow and congestion control; 6) Application layer goals and state-of-the-art UOWN applications, and 7) Localization and its impacts on UOWN layers. Finally, we outline the open research challenges and point out the future directions for underwater optical wireless communications, networking, and localization research.

  7. From early wireless to Everest.

    Science.gov (United States)

    Allen, A

    1998-01-01

    Medical information has been transmitted using wireless technologies for almost 80 years. A "wired wireless" electronic stethoscope was developed by the U.S. Army Signal Corps in the early 1920's, for potential use in ship-to-shore transmission of cardiac sounds. [Winters SR. Diagnosis by wireless. Scientific American June 11, 1921, p. 465] Today, wireless is used in a wide range of medical applications and at sites from transoceanic air flights to offshore oil platforms to Mt. Everest. 'Wireless LANs' are often used in medical environments. Typically, nurses and physicians in a hospital or clinic use hand-held "wireless thin client" pen computers that exchange patient information and images with the hospital server. Numerous companies, such as Fujitsu (article below) and Cruise Technologies (www.cruisetech.com) manufacture handheld pen-entry computers. One company, LXE, integrates radio-frequency (RF) enhanced hand-held computers specifically designed for production use within a wireless LAN (www.lxe.com). Other companies (Proxim, Symbol, and others) supply the wireless RF LAN infrastructure for the enterprise. Unfortunately, there have been problems with widespread deployment of wireless LANs. Perhaps the biggest impediment has been the lack of standards. Although an international standard (IEEE 802.11) was adopted in 1997, most wireless LAN products still are not compatible with the equipment of competing companies. A problem with the current standard for LAN adapters is that throughput is limited to 3 Mbps--compared to at least 10 Mbps, and often 100 Mbps, in a hard-wired Ethernet LAN. An II Mbps standard is due out in the next year or so, but it will be at least 2 years before standards-compliant products are available. This story profiles some of the ways that wireless is being used to overcome gaps in terrestrial and within-enterprise communication.

  8. EHRA: Specification and Analysis of Energy-Harvesting Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Dung, Phan Anh; Hansen, Michael Reichhardt; Madsen, Jan

    2014-01-01

    Although energy consumption of wireless sensor network has been studied extensively, we are far behind in understanding the dynamics of the power consumption along with energy production using harvesters. We introduce Energy Harvesting Routing Analysis (EHRA) as a formal modelling framework...... to study wireless sensor networks (WSN) with energy-harvesting capabilities. The purpose of the framework is to analyze WSNs at a high level of abstraction, that is, before the protocols are implemented and before the WSN is deployed. The conceptual basis of EHRA comprises the environment, the medium...... is developed as a simulator implemented using the functional programming language F#. This simulator is used to analyze global properties of WSNs such as network fragmentation,routing trends, and energy profiles for the nodes. Three routing protocols, with a progression in the energy-harvesting awareness...

  9. Routing in Vehicular Networks: Feasibility, Modeling, and Security

    Directory of Open Access Journals (Sweden)

    Ioannis Broustis

    2008-01-01

    Full Text Available Vehicular networks are sets of surface transportation systems that have the ability to communicate with each other. There are several possible network architectures to organize their in-vehicle computing systems. Potential schemes may include vehicle-to-vehicle ad hoc networks, wired backbone with wireless last hops, or hybrid architectures using vehicle-to-vehicle communications to augment roadside communication infrastructures. Some special properties of these networks, such as high mobility, network partitioning, and constrained topology, differentiate them from other types of wireless networks. We provide an in-depth discussion on the important studies related to architectural design and routing for such networks. Moreover, we discuss the major security concerns appearing in vehicular networks.

  10. 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.

  11. Wireless Networks: a brief introduction

    Indian Academy of Sciences (India)

    First page Back Continue Last page Overview Graphics. Wireless Networks: a brief introduction. Wireless communication: What? Why? How many types? What is cell? Is it different from fixed landline structure? 1G systems: FDMA/FDD and Analog FM [voice comm]. (Introduced in 1983 in Chicago by AMPS). 2G systems: 3 ...

  12. An Analysis Of Wireless Security

    OpenAIRE

    Salendra Prasad

    2017-01-01

    The WLAN security includes Wired Equivalent Primary WEP and WI-FI protected Access WPA. Today WEP is regarded as very poor security standard. WEP was regarded as very old security standard and has many security issues which users need to be addressed. In this Paper we will discuss Wireless Security and ways to improve on wireless security.

  13. 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.

  14. New Heterogeneous Clustering Protocol for Prolonging Wireless Sensor Networks Lifetime

    Directory of Open Access Journals (Sweden)

    Md. Golam Rashed

    2014-06-01

    Full Text Available Clustering in wireless sensor networks is one of the crucial methods for increasing of network lifetime. The network characteristics of existing classical clustering protocols for wireless sensor network are homogeneous. Clustering protocols fail to maintain the stability of the system, especially when nodes are heterogeneous. We have seen that the behavior of Heterogeneous-Hierarchical Energy Aware Routing Protocol (H-HEARP becomes very unstable once the first node dies, especially in the presence of node heterogeneity. In this paper we assume a new clustering protocol whose network characteristics is heterogeneous for prolonging of network lifetime. The computer simulation results demonstrate that the proposed clustering algorithm outperforms than other clustering algorithms in terms of the time interval before the death of the first node (we refer to as stability period. The simulation results also show the high performance of the proposed clustering algorithm for higher values of extra energy brought by more powerful nodes.

  15. Imaging and steering an optical wireless nanoantenna link.

    Science.gov (United States)

    Dregely, Daniel; Lindfors, Klas; Lippitz, Markus; Engheta, Nader; Totzeck, Michael; Giessen, Harald

    2014-07-04

    Optical nanoantennas tailor the transmission and reception of optical signals. Owing to their capacity to control the direction and angular distribution of optical radiation over a broad spectral range, nanoantennas are promising components for optical communication in nanocircuits. Here we measure wireless optical power transfer between plasmonic nanoantennas in the far-field and demonstrate changeable signal routing to different nanoscopic receivers via beamsteering. We image the radiation pattern of single-optical nanoantennas using a photoluminescence technique, which allows mapping of the unperturbed intensity distribution around plasmonic structures. We quantify the distance dependence of the power transmission between transmitter and receiver by deterministically positioning nanoscopic fluorescent receivers around the transmitting nanoantenna. By adjusting the wavefront of the optical field incident on the transmitter, we achieve directional control of the transmitted radiation over a broad range of 29°. This enables wireless power transfer from one transmitter to different receivers.

  16. Request-Centric Wireless Bus Information Management System

    Directory of Open Access Journals (Sweden)

    Ying-Chih Chen

    2016-11-01

    Full Text Available This invention relates to a wireless bus information management system, which includes bus stop and vehicle management subsystems. The management signals are transmittable between bus stops and the vehicle. Based on vehicle management signals, the bus stop management subsystem can obtain information about the bus route identification, the number of unoccupied seats, the intention to stop or not, etc. Similarly, with the bus stop management signals, the vehicle management subsystem can make the decision of stopping. Accordingly, when a passenger wants to get off the vehicle or there are unoccupied seats, the vehicle management subsystem will inform the bus stop management subsystem such that the passengers waiting at the bus stop may flexibly schedule their travel plan. The proposed distributed wireless system is detailed by a prototype implementation and a simulation analysis, which is shown to be feasible and scalable.

  17. Optimizing well intervention routes

    Energy Technology Data Exchange (ETDEWEB)

    Paiva, Ronaldo O. [PETROBRAS S.A., Vitoria, ES (Brazil); Schiozer, Denis J.; Bordalo, Sergio N. [Universidade Estadual de Campinas, SP (Brazil). Faculdade de Engenharia Mecanica. Centro de Estudo do Petroleo (CEPETRO)]. E-mail: denis@dep.fem.unicamp.br; bordalo@dep.fem.unicamp.br

    2000-07-01

    This work presents a method for optimizing the itinerary of work over rigs, i.e., the search for the route of minimum total cost, and demonstrates the importance of the dynamics of reservoir behaviour. The total cost of a route includes the rig expenses (transport, assembly and operation), which are functions of time and distances, plus the losses of revenue in wells waiting for the rig, which are also dependent of time. A reservoir simulator is used to evaluate the monetary influence of the well shutdown on the present value of the production curve. Finally, search algorithms are employed to determine the route of minimal cost. The Simulated Annealing algorithm was also successful in optimizing the distribution of a list of wells among different work over rigs. The rational approach presented here is recommended for management teams as a standard procedure to define the priority of wells scheduled for work over. (author)

  18. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    be that the objects routed have an availability time window and a delivery time window or that locations on the path have a service time window. When routing moving transportation objects such as vehicles and vessels schedules are made in connection with the routing. Such schedules represent the time for the presence......In today’s globalized society, transport contributes to our daily life in many different ways. The production of the parts for a shelf ready product may take place on several continents and our travel between home and work, vacation travel and business trips has increased in distance the last...... couple of decades. To deliver competitive service and price, transportation today needs to be cost effective. A company requiring for things to be shipped will aim at having the freight shipped as cheaply as possible while often satisfying certain time constraints. For the transportation company...

  19. Collective network routing

    Science.gov (United States)

    Hoenicke, Dirk

    2014-12-02

    Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

  20. A Passive Testing Approach for Protocols in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Xiaoping Che

    2015-11-01

    Full Text Available Smart systems are today increasingly developed with the number of wireless sensor devices drastically increasing. They are implemented within several contexts throughout our environment. Thus, sensed data transported in ubiquitous systems are important, and the way to carry them must be efficient and reliable. For that purpose, several routing protocols have been proposed for wireless sensor networks (WSN. However, one stage that is often neglected before their deployment is the conformance testing process, a crucial and challenging step. Compared to active testing techniques commonly used in wired networks, passive approaches are more suitable to the WSN environment. While some works propose to specify the protocol with state models or to analyze them with simulators and emulators, we here propose a logic-based approach for formally specifying some functional requirements of a novel WSN routing protocol. We provide an algorithm to evaluate these properties on collected protocol execution traces. Further, we demonstrate the efficiency and suitability of our approach by its application into common WSN functional properties, as well as specific ones designed from our own routing protocol. We provide relevant testing verdicts through a real indoor testbed and the implementation of our protocol. Furthermore, the flexibility, genericity and practicability of our approach have been proven by the experimental results.

  1. A Passive Testing Approach for Protocols in Wireless Sensor Networks

    Science.gov (United States)

    Che, Xiaoping; Maag, Stephane; Tan, Hwee-Xian; Tan, Hwee-Pink; Zhou, Zhangbing

    2015-01-01

    Smart systems are today increasingly developed with the number of wireless sensor devices drastically increasing. They are implemented within several contexts throughout our environment. Thus, sensed data transported in ubiquitous systems are important, and the way to carry them must be efficient and reliable. For that purpose, several routing protocols have been proposed for wireless sensor networks (WSN). However, one stage that is often neglected before their deployment is the conformance testing process, a crucial and challenging step. Compared to active testing techniques commonly used in wired networks, passive approaches are more suitable to the WSN environment. While some works propose to specify the protocol with state models or to analyze them with simulators and emulators, we here propose a logic-based approach for formally specifying some functional requirements of a novel WSN routing protocol. We provide an algorithm to evaluate these properties on collected protocol execution traces. Further, we demonstrate the efficiency and suitability of our approach by its application into common WSN functional properties, as well as specific ones designed from our own routing protocol. We provide relevant testing verdicts through a real indoor testbed and the implementation of our protocol. Furthermore, the flexibility, genericity and practicability of our approach have been proven by the experimental results. PMID:26610495

  2. Geographic wormhole detection in wireless sensor networks.

    Directory of Open Access Journals (Sweden)

    Mehdi Sookhak

    Full Text Available Wireless sensor networks (WSNs are ubiquitous and pervasive, and therefore; highly susceptible to a number of security attacks. Denial of Service (DoS attack is considered the most dominant and a major threat to WSNs. Moreover, the wormhole attack represents one of the potential forms of the Denial of Service (DoS attack. Besides, crafting the wormhole attack is comparatively simple; though, its detection is nontrivial. On the contrary, the extant wormhole defense methods need both specialized hardware and strong assumptions to defend against static and dynamic wormhole attack. The ensuing paper introduces a novel scheme to detect wormhole attacks in a geographic routing protocol (DWGRP. The main contribution of this paper is to detect malicious nodes and select the best and the most reliable neighbors based on pairwise key pre-distribution technique and the beacon packet. Moreover, this novel technique is not subject to any specific assumption, requirement, or specialized hardware, such as a precise synchronized clock. The proposed detection method is validated by comparisons with several related techniques in the literature, such as Received Signal Strength (RSS, Authentication of Nodes Scheme (ANS, Wormhole Detection uses Hound Packet (WHOP, and Wormhole Detection with Neighborhood Information (WDI using the NS-2 simulator. The analysis of the simulations shows promising results with low False Detection Rate (FDR in the geographic routing protocols.

  3. Geographic wormhole detection in wireless sensor networks.

    Science.gov (United States)

    Sookhak, Mehdi; Akhundzada, Adnan; Sookhak, Alireza; Eslaminejad, Mohammadreza; Gani, Abdullah; Khurram Khan, Muhammad; Li, Xiong; Wang, Xiaomin

    2015-01-01

    Wireless sensor networks (WSNs) are ubiquitous and pervasive, and therefore; highly susceptible to a number of security attacks. Denial of Service (DoS) attack is considered the most dominant and a major threat to WSNs. Moreover, the wormhole attack represents one of the potential forms of the Denial of Service (DoS) attack. Besides, crafting the wormhole attack is comparatively simple; though, its detection is nontrivial. On the contrary, the extant wormhole defense methods need both specialized hardware and strong assumptions to defend against static and dynamic wormhole attack. The ensuing paper introduces a novel scheme to detect wormhole attacks in a geographic routing protocol (DWGRP). The main contribution of this paper is to detect malicious nodes and select the best and the most reliable neighbors based on pairwise key pre-distribution technique and the beacon packet. Moreover, this novel technique is not subject to any specific assumption, requirement, or specialized hardware, such as a precise synchronized clock. The proposed detection method is validated by comparisons with several related techniques in the literature, such as Received Signal Strength (RSS), Authentication of Nodes Scheme (ANS), Wormhole Detection uses Hound Packet (WHOP), and Wormhole Detection with Neighborhood Information (WDI) using the NS-2 simulator. The analysis of the simulations shows promising results with low False Detection Rate (FDR) in the geographic routing protocols.

  4. Geographic Wormhole Detection in Wireless Sensor Networks

    Science.gov (United States)

    Sookhak, Mehdi; Akhundzada, Adnan; Sookhak, Alireza; Eslaminejad, Mohammadreza; Gani, Abdullah; Khurram Khan, Muhammad; Li, Xiong; Wang, Xiaomin

    2015-01-01

    Wireless sensor networks (WSNs) are ubiquitous and pervasive, and therefore; highly susceptible to a number of security attacks. Denial of Service (DoS) attack is considered the most dominant and a major threat to WSNs. Moreover, the wormhole attack represents one of the potential forms of the Denial of Service (DoS) attack. Besides, crafting the wormhole attack is comparatively simple; though, its detection is nontrivial. On the contrary, the extant wormhole defense methods need both specialized hardware and strong assumptions to defend against static and dynamic wormhole attack. The ensuing paper introduces a novel scheme to detect wormhole attacks in a geographic routing protocol (DWGRP). The main contribution of this paper is to detect malicious nodes and select the best and the most reliable neighbors based on pairwise key pre-distribution technique and the beacon packet. Moreover, this novel technique is not subject to any specific assumption, requirement, or specialized hardware, such as a precise synchronized clock. The proposed detection method is validated by comparisons with several related techniques in the literature, such as Received Signal Strength (RSS), Authentication of Nodes Scheme (ANS), Wormhole Detection uses Hound Packet (WHOP), and Wormhole Detection with Neighborhood Information (WDI) using the NS-2 simulator. The analysis of the simulations shows promising results with low False Detection Rate (FDR) in the geographic routing protocols. PMID:25602616

  5. Wireless Headset Communication System

    Science.gov (United States)

    Lau, Wilfred K.; Swanson, Richard; Christensen, Kurt K.

    1995-01-01

    System combines features of pagers, walkie-talkies, and cordless telephones. Wireless headset communication system uses digital modulation on spread spectrum to avoid interference among units. Consists of base station, 4 radio/antenna modules, and as many as 16 remote units with headsets. Base station serves as network controller, audio-mixing network, and interface to such outside services as computers, telephone networks, and other base stations. Developed for use at Kennedy Space Center, system also useful in industrial maintenance, emergency operations, construction, and airport operations. Also, digital capabilities exploited; by adding bar-code readers for use in taking inventories.

  6. Investigating wireless power transfer

    Science.gov (United States)

    St John, Stuart A.

    2017-09-01

    Understanding Physics is a great end in itself, but is also crucial to keep pace with developments in modern technology. Wireless power transfer, known to many only as a means to charge electric toothbrushes, will soon be commonplace in charging phones, electric cars and implanted medical devices. This article outlines how to produce and use a simple set of equipment to both demonstrate and investigate this phenomenon. It presents some initial findings and aims to encourage Physics educators and their students to conduct further research, pushing the bounds of their understanding.

  7. Dynamic wireless sensor networks

    CERN Document Server

    Oteafy, Sharief M A

    2014-01-01

    In this title, the authors leap into a novel paradigm of scalability and cost-effectiveness, on the basis of resource reuse. In a world with much abundance of wirelessly accessible devices, WSN deployments should capitalize on the resources already available in the region of deployment, and only augment it with the components required to meet new application requirements. However, if the required resources already exist in that region, WSN deployment converges to an assignment and scheduling scheme to accommodate for the new application given the existing resources. Such resources are polled

  8. Wired or Wireless Internet?

    DEFF Research Database (Denmark)

    Gimpel, Gregory

    2010-01-01

    This paper finds that network externalities play a minimal role in the choice of internet access technology. Potential adopters of mobile laptop internet view broadband technology as a black box, the technological details of which donot matter. The study uses qualitative techniques to explore how...... the speed of technological obsolescence, market share dominance, and the black boxing of technology influence consumer intention to adopt WiMax and 3G wireless internet for their laptop computers. The results, implications for industry, and areas for further research are discussed....

  9. Wireless installation standard

    International Nuclear Information System (INIS)

    Lim, Hwang Bin

    2007-12-01

    This is divided six parts which are radio regulation law on securing of radio resource, use of radio resource, protection of radio resource, radio regulation enforcement ordinance with securing, distribution and assignment of radio regulation, radio regulation enforcement regulation on utility of radio resource and technical qualification examination, a wireless installation regulation of technique standard and safety facility standard, radio regulation such as certification regulation of information communicative machines and regulation of radio station on compliance of signal security, radio equipment in radio station, standard frequency station and emergency communication.

  10. Using trust to secure geographic and energy aware routing against multiple attacks.

    Science.gov (United States)

    Zhang, Guanghua; Zhang, Yuqing; Chen, Zhenguo

    2013-01-01

    To address the vulnerability of geographic routing to multiple security threats such as false routing information, selective forwarding and the Sybil attack in wireless sensor networks, this paper proposes a trust-based defending model against above-mentioned multiple attacks. Considering the characteristics of resource-constrained sensor nodes, trust values of neighboring nodes on the routing path can be calculated through the Dirichlet distribution function, which is based on data packets' acknowledgements in a certain period instead of energy-consuming monitoring. Trust is combined with the cost of geographic and energy aware routing for selecting the next hop of routing. At the same time, the initial trust is dynamically determined, service requests are restricted for malicious nodes in accordance with trust values, and the impact of node mobility is weakened by the trust evolution. The simulation results and analysis show that the proposed model under multiple attacks has advantages in packet delivery ratio and network lifetime over the existing models.

  11. Evaluation of RPL-compliant routing solutions in real-life WSNs

    Directory of Open Access Journals (Sweden)

    Zahariadis Theodore

    2016-01-01

    Full Text Available Wireless Sensor Networks (WSN applications continue to expand and already cover almost all our daily activities improving from security and environmental efficiency to gaming experience. The diverse applications running on top of WSNs have led to the design of an immense number of routing protocols. Few years ago, the IETF standardized the IPv6 routing protocol for low-power and lossy networks (RPL which is based on routing metrics to build communication paths between a source and the destination node. While significant efforts have focused on the design of routing metrics that satisfy the various applications, limited work has been reported on validating their performance using real-life motes. In this paper, we focus on validating the simulation results (obtained through the JSim simulator using TelosB motes for a set of routing metrics that have been proposed in our previous articles.

  12. Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

    Science.gov (United States)

    Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

    2017-07-19

    Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

  13. 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.

  14. Survey of a fusion technology for wireless PEC with energy harvesting in nuclear industry

    International Nuclear Information System (INIS)

    Lee, Jae Cheol; Choi, Yoo Rark

    2008-01-01

    The wireless sensor network has a power-supply problem by constitution. Large amount of sensors are used in wireless networks and each sensor needs energy source for its operation. The life of a battery used in a sensor is finite. When a battery went out, we must exchange it with new one. But the number of sensors used in the wireless network is too numerous, so it is somewhat terrible job to exchange the exhausted batteries with new ones. Various researches have been executed to solve this problem. The mainstreams of them are energy efficiency and energy harvesting. The protocols such as flat-based routing, hierarchical-based routing, location-based routing and MAC protocol have been developed and applied to sensor networks for energy efficiency. But energy harvesting methods can be a ultimate solution. Energy harvesting is the process for capturing and storing of energies. A variety of different sources exist for harvesting energy, such as solar power, thermal energy, wind energy, salinity gradients and kinetic energy. We described an energy harvesting technology and a wireless pulsed eddy currents(PEC) inspection based on it

  15. DTN routing in body sensor networks with dynamic postural partitioning.

    Science.gov (United States)

    Quwaider, Muhannad; Biswas, Subir

    2010-11-01

    This paper presents novel store-and-forward packet routing algorithms for Wireless Body Area Networks ( WBAN ) with frequent postural partitioning. A prototype WBAN has been constructed for experimentally characterizing on-body topology disconnections in the presence of ultra short range radio links, unpredictable RF attenuation, and human postural mobility. On-body DTN routing protocols are then developed using a stochastic link cost formulation, capturing multi-scale topological localities in human postural movements. Performance of the proposed protocols are evaluated experimentally and via simulation, and are compared with a number of existing single-copy DTN routing protocols and an on-body packet flooding mechanism that serves as a performance benchmark with delay lower-bound. It is shown that via multi-scale modeling of the spatio-temporal locality of on-body link disconnection patterns, the proposed algorithms can provide better routing performance compared to a number of existing probabilistic, opportunistic, and utility-based DTN routing protocols in the literature.

  16. The Prohibitive Link between Position-based Routing and Planarity

    Directory of Open Access Journals (Sweden)

    David Cairns

    2013-12-01

    Full Text Available Position-based routing is touted as an ideal routing strategy for resource-constrained wireless networks. One persistent barrier to adoption is due to its recovery phase, where messages are forwarded according to leftor right-hand rule (LHR. This is often referred to as face-routing. In this paper we investigate the limits of LHR with respect to planarity.We show that the gap between non-planarity and successful delivery is a single link within a single configuration. Our work begins with an analysis to enumerate all node configurations that cause intersections in the unit-disc graph. We find that left-hand rule is able to recover from all but a single case, the ‘umbrella’ configuration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PLDP that can guarantee delivery over non-planar graphs using standard face-routing techniques. As the name implies, the protocol detects and circumvents the ‘bad’ links that hamper LHR. The goal of this work is to maintain routing guarantees while disturbing the network graph as little as possible. In doing so, a new starting point emerges from which to build rich distributed protocols in the spirit of CLDP and GDSTR.

  17. Multipath Load Balancing Routing for Internet of Things

    Directory of Open Access Journals (Sweden)

    Chinyang Henry Tseng

    2016-01-01

    Full Text Available In the next-generation technology, Internet of Things (IoT, billions of smart objects will communicate with one another to make human lives more convenient. IoT is based on wireless sensor network (WSN, and Zigbee is one of the most popular WSN protocols. A mature IoT environment involves heavy WSN data transmission causing bottleneck problems. However, Zigbee’s AODV routing stack does not have load balance mechanism to handle bursty traffic. Therefore, we develop Multipath Load Balancing (MLB Routing to substitute Zigbee’s AODV routing. Our proposed MLB consists of two main designs: LAYER_DESIGN and LOAD_BALANCE. LAYER_DESIGN assigns nodes into different layers based on node distance to IoT gateway. Nodes can have multiple next-hops delivering IoT data. All neighboring layer nodes exchange flow information containing current load, used by LOAD_BALANCE to estimate future load of next-hops. With MLB, nodes can choose the neighbors with the least load as the next-hops and thus can achieve load balance and avoid bottlenecks. Compared with Zigbee’s AODV and multipath version AODV (AOMDV, experiment results demonstrate that MLB achieves better load balance, lower packet loss rate, and better routing connectivity ratio in both grid and random uniform topologies. MLB provides a more convincing routing solution for IoT applications.

  18. Whirlpool routing for mobility

    KAUST Repository

    Lee, Jung Woo

    2010-01-01

    We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP\\'s design is that data traffic can use an existing routing gradient to efficiently probe the topology, repair the routing gradient, and communicate these repairs to nearby nodes. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane for topology maintenance is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at a destination make the destination have the region of highest traffic. We provide a theoretical basis for WARP\\'s behavior, defining an "update area" in which the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology using the data plane. Compared to existing protocols, such as DYMO and HYPER, WARP\\'s packet drop rate is up to 90% lower while sending up to 90% fewer packets.

  19. Reliable Internet Routing

    Science.gov (United States)

    2011-09-01

    subprefixes. We refer to this attack as sub-prefix hijacking. 66 There are other variants of prefix hijacking, such as wormhole [49] attacks. Wormhole attacks...are a countermeasure the adversary can employ against secure routing protocols. Wormhole attacks are not discussed in this chapter because in our

  20. SET-Routes programme

    CERN Multimedia

    Marietta Schupp, EMBL Photolab

    2008-01-01

    Dr Sabine Hentze, specialist in human genetics, giving an Insight Lecture entitled "Human Genetics – Diagnostics, Indications and Ethical Issues" on 23 September 2008 at EMBL Heidelberg. Activities in a achool in Budapest during a visit of Angela Bekesi, Ambassadors for the SET-Routes programme.

  1. 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

  2. Multipath Load Balancing Routing for Internet of Things

    OpenAIRE

    Tseng, Chinyang Henry

    2016-01-01

    In the next-generation technology, Internet of Things (IoT), billions of smart objects will communicate with one another to make human lives more convenient. IoT is based on wireless sensor network (WSN), and Zigbee is one of the most popular WSN protocols. A mature IoT environment involves heavy WSN data transmission causing bottleneck problems. However, Zigbee’s AODV routing stack does not have load balance mechanism to handle bursty traffic. Therefore, we develop Multipath Load Balancing (...

  3. Household wireless electroencephalogram hat

    Science.gov (United States)

    Szu, Harold; Hsu, Charles; Moon, Gyu; Yamakawa, Takeshi; Tran, Binh

    2012-06-01

    We applied Compressive Sensing to design an affordable, convenient Brain Machine Interface (BMI) measuring the high spatial density, and real-time process of Electroencephalogram (EEG) brainwaves by a Smartphone. It is useful for therapeutic and mental health monitoring, learning disability biofeedback, handicap interfaces, and war gaming. Its spec is adequate for a biomedical laboratory, without the cables hanging over the head and tethered to a fixed computer terminal. Our improved the intrinsic signal to noise ratio (SNR) by using the non-uniform placement of the measuring electrodes to create the proximity of measurement to the source effect. We computing a spatiotemporal average the larger magnitude of EEG data centers in 0.3 second taking on tethered laboratory data, using fuzzy logic, and computing the inside brainwave sources, by Independent Component Analysis (ICA). Consequently, we can overlay them together by non-uniform electrode distribution enhancing the signal noise ratio and therefore the degree of sparseness by threshold. We overcame the conflicting requirements between a high spatial electrode density and precise temporal resolution (beyond Event Related Potential (ERP) P300 brainwave at 0.3 sec), and Smartphone wireless bottleneck of spatiotemporal throughput rate. Our main contribution in this paper is the quality and the speed of iterative compressed image recovery algorithm based on a Block Sparse Code (Baranuick et al, IEEE/IT 2008). As a result, we achieved real-time wireless dynamic measurement of EEG brainwaves, matching well with traditionally tethered high density EEG.

  4. Biomonitoring with Wireless Communications

    Energy Technology Data Exchange (ETDEWEB)

    Budinger, Thomas F.

    2003-03-01

    This review is divided into three sections: technologies for monitoring physiological parameters; biosensors for chemical assays and wireless communications technologies including image transmissions. Applications range from monitoring high risk patients for heart, respiratory activity and falls to sensing levels of physical activity in military, rescue, and sports personnel. The range of measurements include, heart rate, pulse wave form, respiratory rate, blood oxygen, tissue pCO2, exhaled carbon dioxide and physical activity. Other feasible measurements will employ miniature chemical laboratories on silicon or plastic chips. The measurements can be extended to clinical chemical assays ranging from common blood assays to protein or specialized protein measurements (e.g., troponin, creatine, and cytokines such as TNF and IL6). Though the feasibility of using wireless technology to communicate vital signs has been demonstrated 32 years ago (1) it has been only recently that practical and portable devices and communications net works have become generally available for inexpensive deployment of comfortable and affordable devices and systems.

  5. Enhancing the performance of ad hoc wireless networks with smart antennas

    CERN Document Server

    Bandyopadhyay, Somprakash; Ueda, Tetsuro

    2006-01-01

    A large portion of the network capacity of an ad hoc network can be wasted by the medium access mechanisms of omni-directional antennas. To overcome this problem, researchers propose the use of directional or adaptive antennas that largely reduce radio interference, improving the utilization of wireless medium and the resulting network throughput.Enhancing the Performance of Ad Hoc Wireless Networks with Smart Antennas discusses these issues and challenges. Following an introduction to ad hoc networks, it presents an overview of basic Media Access Control (MAC) and routing protocols in ad hoc

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

    CSIR Research Space (South Africa)

    Salami, O

    2009-08-01

    Full Text Available , while a route refers to the last mile connection path between a source and destination pair. In section II, a description of the model of the inter- working wireless network and the node distribution model; and an explanation of the node degree... transmission range of each of the nodes is R and the distance between any two nodes, Xi and Xj in the network is represented by d(Xi,Xj). In a wireless multi-hop network, two nodes are able to communicate with each other if d(Xi, Xj)≤R [2]. B. Node Degree...

  7. 802.11s Wireless Mesh Network Visualization Application

    Science.gov (United States)

    Mauldin, James Alexander

    2014-01-01

    Results of past experimentation at NASA Johnson Space Center showed that the IEEE 802.11s standard has better performance than the widely implemented alternative protocol B.A.T.M.A.N (Better Approach to Mobile Ad hoc Networking). 802.11s is now formally incorporated into the Wi- Fi 802.11-2012 standard, which specifies a hybrid wireless mesh networking protocol (HWMP). In order to quickly analyze changes to the routing algorithm and to support optimizing the mesh network behavior for our intended application a visualization tool was developed by modifying and integrating open source tools.

  8. Graphical user interface for wireless sensor networks simulator

    Science.gov (United States)

    Paczesny, Tomasz; Paczesny, Daniel; Weremczuk, Jerzy

    2008-01-01

    Wireless Sensor Networks (WSN) are currently very popular area of development. It can be suited in many applications form military through environment monitoring, healthcare, home automation and others. Those networks, when working in dynamic, ad-hoc model, need effective protocols which must differ from common computer networks algorithms. Research on those protocols would be difficult without simulation tool, because real applications often use many nodes and tests on such a big networks take much effort and costs. The paper presents Graphical User Interface (GUI) for simulator which is dedicated for WSN studies, especially in routing and data link protocols evaluation.

  9. Structural processing for wireless communications

    CERN Document Server

    Lu, Jianhua; Ge, Ning

    2015-01-01

    This brief presents an alternative viewpoint on processing technology for wireless communications based on recent research advances. As a lever in emerging processing technology, the structure perspective addresses the complexity and uncertainty issues found in current wireless applications. Likewise, this brief aims at providing a new prospective to the development of communication technology and information science, while stimulating new theories and technologies for wireless systems with ever-increasing complexity. Readers of this brief may range from graduate students to researchers in related fields.

  10. Radio Relays Improve Wireless Products

    Science.gov (United States)

    2009-01-01

    Signal Hill, California-based XCOM Wireless Inc. developed radio frequency micromachine (RF MEMS) relays with a Phase II Small Business Innovation Research (SBIR) contract through NASA?s Jet Propulsion Laboratory. In order to improve satellite communication systems, XCOM produced wireless RF MEMS relays and tunable capacitors that use metal-to-metal contact and have the potential to outperform most semiconductor technologies while using less power. These relays are used in high-frequency test equipment and instrumentation, where increased speed can mean significant cost savings. Applications now also include mainstream wireless applications and greatly improved tactical radios.

  11. Wireless Communications in Smart Grid

    Science.gov (United States)

    Bojkovic, Zoran; Bakmaz, Bojan

    Communication networks play a crucial role in smart grid, as the intelligence of this complex system is built based on information exchange across the power grid. Wireless communications and networking are among the most economical ways to build the essential part of the scalable communication infrastructure for smart grid. In particular, wireless networks will be deployed widely in the smart grid for automatic meter reading, remote system and customer site monitoring, as well as equipment fault diagnosing. With an increasing interest from both the academic and industrial communities, this chapter systematically investigates recent advances in wireless communication technology for the smart grid.

  12. 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

  13. Microwave materials for wireless applications

    CERN Document Server

    Cruickshank, David B

    2011-01-01

    This practical resource offers you an in-depth, up-to-date understanding of the use of microwave magnetic materials for cutting-edge wireless applications. The book discusses device applications used in wireless infrastructure base stations, point-to-point radio links, and a range of more specialized microwave systems. You find detailed discussions on the attributes of each family of magnetic materials with respect to specific wireless applications. Moreover, the book addresses two of the hottest topics in the field today - insertion loss and intermodulation. This comprehensive reference also

  14. Wireless device monitoring methods, wireless device monitoring systems, and articles of manufacture

    Science.gov (United States)

    McCown, Steven H [Rigby, ID; Derr, Kurt W [Idaho Falls, ID; Rohde, Kenneth W [Idaho Falls, ID

    2012-05-08

    Wireless device monitoring methods, wireless device monitoring systems, and articles of manufacture are described. According to one embodiment, a wireless device monitoring method includes accessing device configuration information of a wireless device present at a secure area, wherein the device configuration information comprises information regarding a configuration of the wireless device, accessing stored information corresponding to the wireless device, wherein the stored information comprises information regarding the configuration of the wireless device, comparing the device configuration information with the stored information, and indicating the wireless device as one of authorized and unauthorized for presence at the secure area using the comparing.

  15. Analyzing the effect of routing protocols on media access control protocols in radio networks

    Energy Technology Data Exchange (ETDEWEB)

    Barrett, C. L. (Christopher L.); Drozda, M. (Martin); Marathe, A. (Achla); Marathe, M. V. (Madhav V.)

    2002-01-01

    We study the effect of routing protocols on the performance of media access control (MAC) protocols in wireless radio networks. Three well known MAC protocols: 802.11, CSMA, and MACA are considered. Similarly three recently proposed routing protocols: AODV, DSR and LAR scheme 1 are considered. The experimental analysis was carried out using GloMoSim: a tool for simulating wireless networks. The main focus of our experiments was to study how the routing protocols affect the performance of the MAC protocols when the underlying network and traffic parameters are varied. The performance of the protocols was measured w.r.t. five important parameters: (i) number of received packets, (ii) average latency of each packet, (iii) throughput (iv) long term fairness and (v) number of control packets at the MAC layer level. Our results show that combinations of routing and MAC protocols yield varying performance under varying network topology and traffic situations. The result has an important implication; no combination of routing protocol and MAC protocol is the best over all situations. Also, the performance analysis of protocols at a given level in the protocol stack needs to be studied not locally in isolation but as a part of the complete protocol stack. A novel aspect of our work is the use of statistical technique, ANOVA (Analysis of Variance) to characterize the effect of routing protocols on MAC protocols. This technique is of independent interest and can be utilized in several other simulation and empirical studies.

  16. Performance Evaluation of MBA-OLSR Routing Protocol for MANETs

    Directory of Open Access Journals (Sweden)

    Waheb A. Jabbar

    2014-01-01

    Full Text Available This paper proposes a multipath battery aware routing protocol, namely, MBA-OLSR, based on OLSRv2 and its multipath extension. The proposed approach considers the remaining battery energy of the nodes for calculating the initial cost of the multiple links between source-destination pairs. The MBA-OLSR aims to construct energy efficient routes and extend the network lifetime to avoid network failure due to battery exhaustion. The protocol performance is evaluated in different simulation scenarios of wireless mobile ad hoc networks (MANETs environment. The simulation results demonstrate that our approach can achieve longer network lifetime and lower energy cost per packet. In addition, the results show improvement in terms of packet delivery ratio and end-to-end delay.

  17. A Scope for MANET Routing and Security Threats

    Directory of Open Access Journals (Sweden)

    Lathies Bhasker T

    2013-12-01

    Full Text Available The mobile Ad-hoc networks (MANET are wireless networks which utilize mobile nodes for communicating among them and in the external transmission range. The vulnerable nature of the network causes various security threats which upset its growth. In this survey, initially the existing security attacks in MANET are analyzed. The attacks categories fall under two stages that include internal and external attacks. The former attack is due to the malicious nodes within the network and later attack is caused by the nodes which do not belong to the network. Then the secure, efficient dynamic routing techniques which are main issues concerned with ad hoc networks are surveyed. Overall, our survey mainly concentrates the existing security attacks and possible routing solution in MANET.

  18. Improvement In MAODV Protocol Using Location Based Routing Protocol

    Directory of Open Access Journals (Sweden)

    Kaur Sharnjeet

    2016-01-01

    Full Text Available Energy saving is difficult in wireless sensor network (WSN due to limited resources. Each node in WSN is constrained by their limited battery power for their energy. The energy is reduced as the time goes off due to the packet transmission and reception. Energy management techniques are necessary to minimize the total power consumption of all the nodes in the network in order to maximize its life span. Our proposed protocol Location based routing (LBR aimed to find a path which utilizes the minimum energy to transmit the packets between the source and the destination. The required energy for the transmission and reception of data is evaluated in MATLAB. LBR is implemented on Multicast Ad hoc On Demand Distance Vector Routing Protocol (MAODV to manage the energy consumption in the transmission and reception of data. Simulation results of LBR show the energy consumption has been reduced.

  19. Roots and routes

    DEFF Research Database (Denmark)

    Christensen, Ann-Dorte; Jensen, Sune Qvotrup

    2011-01-01

    This article is about transnational migrants, how they construct belonging to ‘new’ places where they have arrived, and how the feelings of belonging to their places of origin change when they go back. The theoretical part of the article outlines the relationship between migration and belonging...... arguing that there is a dynamic interplay between roots and routes in people's lives. The empirical point of departure is narratives about roots and routes by ethnic minorities settled in Aalborg East, an underprivileged neighbourhood in northern Denmark. One of the main findings is a gap between....... A somewhat paradoxical finding is that it appears to be more difficult for transnational migrants to maintain their roots in the country of origin when they go back than it was to establish new roots in the host country...

  20. An adaptive jitter mechanism for reactive route discovery in sensor networks.

    Science.gov (United States)

    Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas

    2014-08-08

    This paper analyses the impact of jitter when applied to route discovery in reactive (on-demand) routing protocols. In multi-hop non-synchronized wireless networks, jitter--a small, random variation in the timing of message emission--is commonly employed, as a means to avoid collisions of simultaneous transmissions by adjacent routers over the same channel. In a reactive routing protocol for sensor and ad hoc networks, jitter is recommended during the route discovery process, specifically, during the network-wide flooding of route request messages, in order to avoid collisions. Commonly, a simple uniform jitter is recommended. Alas, this is not without drawbacks: when applying uniform jitter to the route discovery process, an effect called delay inversion is observed. This paper, first, studies and quantifies this delay inversion effect. Second, this paper proposes an adaptive jitter mechanism, designed to alleviate the delay inversion effect and thereby to reduce the route discovery overhead and (ultimately) allow the routing protocol to find more optimal paths, as compared to uniform jitter. This paper presents both analytical and simulation studies, showing that the proposed adaptive jitter can effectively decrease the cost of route discovery and increase the path quality.

  1. On the Packet Loss Correlation in Wireless Mesh Networks

    DEFF Research Database (Denmark)

    Pahlevani, Peyman; Cabrera Guerrero, Juan Alberto; Roetter, Daniel Enrique Lucani

    2014-01-01

    State-of-the-art analysis and protocols in wireless mesh networks typically assume an independent packet loss channel for each receiver of a transmission. Although this is usually transparent for single-path protocol design, this assumption may severely degrade the performance of opportunistic and....../or multi-path routing approaches as well as network coding (NC) subgraph selection problems (routing in NC). This paper proposes simple channel models to incorporate the effect of correlation between receivers in a parametric fashion and supports them with a measurement campaign that leverages various...... commercial devices and network conditions. Finally, we illustrate the effect of correlation in the design and performance of the PlayNCool network coding protocol introduced by the authors in prior work. Our results show that the modified PlayNCool protocol decreases the overhead by a factor of 2.5x....

  2. Advanced Wireless Integrated Navy Network

    National Research Council Canada - National Science Library

    Stutzman, Warren; Habayeb, Rick

    2005-01-01

    Quarterly progress report No. I on AWINN hardware and software configurations of smart, wideband, multi-function antennas, secure configurable platform, close-in command and control for Sea Basing visualization of wireless...

  3. Wireless Damage Location Sensing System

    Science.gov (United States)

    Woodard, Stanley E. (Inventor); Taylor, Bryant Douglas (Inventor)

    2012-01-01

    A wireless damage location sensing system uses a geometric-patterned wireless sensor that resonates in the presence of a time-varying magnetic field to generate a harmonic response that will experience a change when the sensor experiences a change in its geometric pattern. The sensing system also includes a magnetic field response recorder for wirelessly transmitting the time-varying magnetic field and for wirelessly detecting the harmonic response. The sensing system compares the actual harmonic response to a plurality of predetermined harmonic responses. Each predetermined harmonic response is associated with a severing of the sensor at a corresponding known location thereof so that a match between the actual harmonic response and one of the predetermined harmonic responses defines the known location of the severing that is associated therewith.

  4. SPARCO: Stochastic Performance Analysis with Reliability and Cooperation for Underwater Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Sheeraz Ahmed

    2016-01-01

    Full Text Available Reliability is a key factor for application-oriented Underwater Sensor Networks (UWSNs which are utilized for gaining certain objectives and a demand always exists for efficient data routing mechanisms. Cooperative routing is a promising technique which utilizes the broadcast feature of wireless medium and forwards data with cooperation using sensor nodes as relays. Here, we present a cooperation-based routing protocol for underwater networks to enhance their performance called Stochastic Performance Analysis with Reliability and Cooperation (SPARCO. Cooperative communication is explored in order to design an energy-efficient routing scheme for UWSNs. Each node of the network is assumed to be consisting of a single omnidirectional antenna and multiple nodes cooperatively forward their transmissions taking advantage of spatial diversity to reduce energy consumption. Both multihop and single-hop schemes are exploited which contribute to lowering of path-losses present in the channels connecting nodes and forwarding of data. Simulations demonstrate that SPARCO protocol functions better regarding end-to-end delay, network lifetime, and energy consumption comparative to noncooperative routing protocol—improved Adaptive Mobility of Courier nodes in Threshold-optimized Depth-based routing (iAMCTD. The performance is also compared with three cooperation-based routing protocols for UWSN: Cognitive Cooperation (Cog-Coop, Cooperative Depth-Based Routing (CoDBR, and Cooperative Partner Node Selection Criteria for Cooperative Routing (Coop Re and dth.

  5. Wireless cortical implantable systems

    CERN Document Server

    Majidzadeh Bafar, Vahid

    2013-01-01

    Wireless Cortical Implantable Systems examines the design for data acquisition and transmission in cortical implants. The first part of the book covers existing system-level cortical implants, as well as future devices. The authors discuss the major constraints in terms of microelectronic integration. The second part of the book focuses on system-level as well as circuit and system level solutions to the development of ultra low-power and low-noise microelectronics for cortical implants. Existing solutions are presented and novel methods and solutions proposed. The third part of the book focuses on the usage of digital impulse radio ultra wide-band transmission as an efficient method to transmit cortically neural recorded data at high data-rate to the outside world. Original architectural and circuit and system solutions are discussed.

  6. Wireless Josephson amplifier

    International Nuclear Information System (INIS)

    Narla, A.; Sliwa, K. M.; Hatridge, M.; Shankar, S.; Frunzio, L.; Schoelkopf, R. J.; Devoret, M. H.

    2014-01-01

    Josephson junction parametric amplifiers are playing a crucial role in the readout chain in superconducting quantum information experiments. However, their integration with current 3D cavity implementations poses the problem of transitioning between waveguide, coax cables, and planar circuits. Moreover, Josephson amplifiers require auxiliary microwave components, like directional couplers and/or hybrids, that are sources of spurious losses and impedance mismatches that limit measurement efficiency and amplifier tunability. We have developed a wireless architecture for these parametric amplifiers that eliminates superfluous microwave components and interconnects. This greatly simplifies their assembly and integration into experiments. We present an experimental realization of such a device operating in the 9–11 GHz band with about 100 MHz of amplitude gain-bandwidth product, on par with devices mounted in conventional sample holders. The simpler impedance environment presented to the amplifier also results in increased amplifier tunability.

  7. 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....

  8. Wireless Communications in Reverberant Environments

    Science.gov (United States)

    2015-01-01

    solutions exist which can be tailored to meet the needs nearly any wireless application. Some notable current solutions include USRPs [27] and GNURadio ...tailored to meet the needs nearly any wireless application. Some notable current solutions include USRPs [27] and GNURadio [28]. For this effort, the WARPv3...en.wikipedia.org/wiki/List of software-defined radios [27] “Ettus research.” [Online]. Available: http://www.ettus.com [28] “ Gnuradio .” [Online]. Available: http

  9. WIRELESS MINE WIDE TELECOMMUNICATIONS TECHNOLOGY

    Energy Technology Data Exchange (ETDEWEB)

    Zvi H. Meiksin

    2002-04-01

    Two industrial prototype units for through-the-earth wireless communication were constructed and tested. Preparation for a temporary installation in NIOSH's Lake Lynn mine for the through-the-earth and the in-mine system were completed. Progress was made in the programming of the in-mine system to provide data communication. Work has begun to implement a wireless interface between equipment controllers and our in-mine system.

  10. WIRELESS MINE WIDE TELECOMMUNICATIONS TECHNOLOGY

    International Nuclear Information System (INIS)

    Zvi H. Meiksin

    2002-01-01

    Two industrial prototype units for through-the-earth wireless communication were constructed and tested. Preparation for a temporary installation in NIOSH's Lake Lynn mine for the through-the-earth and the in-mine system were completed. Progress was made in the programming of the in-mine system to provide data communication. Work has begun to implement a wireless interface between equipment controllers and our in-mine system

  11. Electronic route information panels (DRIPs).

    NARCIS (Netherlands)

    2008-01-01

    Also in the Netherlands, the term Dynamic Route Information Panel (DRIP) is used for an electronic route information panel. A DRIP usually indicates whether there are queues on the various routes to a particular destination and how long they are. On certain locations DRIPS also give the estimated

  12. Stochastic vehicle routing with recourse

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath; Saket, Rishi

    2012-01-01

    We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage problem, where demand is satisfied using two routes: fixed and recourse. The fixed route is computed using only a demand distribution. Then after observing the demand inst...

  13. Robustness of airline route networks

    Science.gov (United States)

    Lordan, Oriol; Sallan, Jose M.; Escorihuela, Nuria; Gonzalez-Prieto, David

    2016-03-01

    Airlines shape their route network by defining their routes through supply and demand considerations, paying little attention to network performance indicators, such as network robustness. However, the collapse of an airline network can produce high financial costs for the airline and all its geographical area of influence. The aim of this study is to analyze the topology and robustness of the network route of airlines following Low Cost Carriers (LCCs) and Full Service Carriers (FSCs) business models. Results show that FSC hubs are more central than LCC bases in their route network. As a result, LCC route networks are more robust than FSC networks.

  14. ENERGY EFFICIENT CLUSTER HEAD SELECTION IN MOBILE WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    MUHAMMAD ARSHAD

    2014-12-01

    Full Text Available In the era of New Generation Networks (NWGN many emerging and future enable technologies accomplish the requirements of ubiquitous communication networks. Wireless Sensor Networks (WSNs is a vital category of these stateof-the-art technologies, the enormous concerns of these networks are energy efficient and well-organized data aggregation. Cluster based routing in WSNs is an immense solution to enhance the energy efficiency of the nodes and resourceful data gathering. Many studies on network lifetime and data aggregation have been proposed by the Low Energy Adaptive Clustering Hierarchy (LEACH scheme that allows the role of the cluster head rotated among the sensor nodes and attempts to distribute the energy usage through all the nodes. The lifetime of WSNs will be affected by the cluster head (CH selection; this is because a CH consumes more power than a regular (non-CH node. In this research study, an energy efficient cluster head selection in Mobile Wireless Sensor Networks is proposed, analysed and validated on the basis of residual energy and randomized selection of the node, who is not assigned as a cluster head in previous round. Moreover, the proposed approach shows the significant improvements when compared with LEACH and A Novel Application Specific Network Protocol for Wireless Sensor Networks (Hybrid Multi-hop LEACH protocols in terms of energy consumption of sensor nodes, enhanced network lifetime and efficient data gathering due to less energy consumption during data transmission.

  15. Wireless Mesh Networks to Support Video Surveillance: Architecture, Protocol, and Implementation Issues

    Directory of Open Access Journals (Sweden)

    Francesco Licandro

    2007-03-01

    Full Text Available Current video-surveillance systems typically consist of many video sources distributed over a wide area, transmitting live video streams to a central location for processing and monitoring. The target of this paper is to present an experience of implementation of a large-scale video-surveillance system based on a wireless mesh network infrastructure, discussing architecture, protocol, and implementation issues. More specifically, the paper proposes an architecture for a video-surveillance system, and mainly centers its focus on the routing protocol to be used in the wireless mesh network, evaluating its impact on performance at the receiver side. A wireless mesh network was chosen to support a video-surveillance application in order to reduce the overall system costs and increase scalability and performance. The paper analyzes the performance of the network in order to choose design parameters that will achieve the best trade-off between video encoding quality and the network traffic generated.

  16. Wireless Mesh Networks to Support Video Surveillance: Architecture, Protocol, and Implementation Issues

    Directory of Open Access Journals (Sweden)

    Licandro Francesco

    2007-01-01

    Full Text Available Current video-surveillance systems typically consist of many video sources distributed over a wide area, transmitting live video streams to a central location for processing and monitoring. The target of this paper is to present an experience of implementation of a large-scale video-surveillance system based on a wireless mesh network infrastructure, discussing architecture, protocol, and implementation issues. More specifically, the paper proposes an architecture for a video-surveillance system, and mainly centers its focus on the routing protocol to be used in the wireless mesh network, evaluating its impact on performance at the receiver side. A wireless mesh network was chosen to support a video-surveillance application in order to reduce the overall system costs and increase scalability and performance. The paper analyzes the performance of the network in order to choose design parameters that will achieve the best trade-off between video encoding quality and the network traffic generated.

  17. Wireless Sensor Network Congestion Control Based on Standard Particle Swarm Optimization and Single Neuron PID.

    Science.gov (United States)

    Yang, Xiaoping; Chen, Xueying; Xia, Riting; Qian, Zhihong

    2018-04-19

    Aiming at the problem of network congestion caused by the large number of data transmissions in wireless routing nodes of wireless sensor network (WSN), this paper puts forward an algorithm based on standard particle swarm⁻neural PID congestion control (PNPID). Firstly, PID control theory was applied to the queue management of wireless sensor nodes. Then, the self-learning and self-organizing ability of neurons was used to achieve online adjustment of weights to adjust the proportion, integral and differential parameters of the PID controller. Finally, the standard particle swarm optimization to neural PID (NPID) algorithm of initial values of proportion, integral and differential parameters and neuron learning rates were used for online optimization. This paper describes experiments and simulations which show that the PNPID algorithm effectively stabilized queue length near the expected value. At the same time, network performance, such as throughput and packet loss rate, was greatly improved, which alleviated network congestion and improved network QoS.

  18. A Wireless Monitoring System for Cracks on the Surface of Reactor Containment Buildings

    Directory of Open Access Journals (Sweden)

    Jianguo Zhou

    2016-06-01

    Full Text Available Structural health monitoring with wireless sensor networks has been increasingly popular in recent years because of the convenience. In this paper, a real-time monitoring system for cracks on the surface of reactor containment buildings is presented. Customized wireless sensor networks platforms are designed and implemented with sensors especially for crack monitoring, which include crackmeters and temperature detectors. Software protocols like route discovery, time synchronization and data transfer are developed to satisfy the requirements of the monitoring system and stay simple at the same time. Simulation tests have been made to evaluate the performance of the system before full scale deployment. The real-life deployment of the crack monitoring system is carried out on the surface of reactor containment building in Daya Bay Nuclear Power Station during the in-service pressure test with 30 wireless sensor nodes.

  19. Cluster chain based energy efficient routing protocol for moblie WSN

    Directory of Open Access Journals (Sweden)

    WU Ziyu

    2016-04-01

    Full Text Available With the ubiquitous smart devices acting as mobile sensor nodes in the wireless sensor networks(WSNs to sense and transmit physical information,routing protocols should be designed to accommodate the mobility issues,in addition to conventional considerations on energy efficiency.However,due to frequent topology change,traditional routing schemes cannot perform well.Moreover,existence of mobile nodes poses new challenges on energy dissipation and packet loss.In this paper,a novel routing scheme called cluster chain based routing protocol(CCBRP is proposed,which employs a combination of cluster and chain structure to accomplish data collection and transmission and thereafter selects qualified cluster heads as chain leaders to transmit data to the sink.Furthermore,node mobility is handled based on periodical membership update of mobile nodes.Simulation results demonstrate that CCBRP has a good performance in terms of network lifetime and packet delivery,also strikes a better balance between successful packet reception and energy consumption.

  20. Early congestion detection and adaptive routing in MANET

    Directory of Open Access Journals (Sweden)

    T. Senthil Kumaran

    2011-11-01

    Full Text Available Ad hoc mobile networks are composed of mobile nodes communicating through wireless medium, without any fixed backbone infrastructure. In these networks, congestion occurs in any intermediate node when data packets travel from source to destination and they incur high packet loss and long delay, which cause the performance degradations of a network. This paper proposes an early congestion detection and adaptive routing in MANET called as EDAPR. Initially EDAPR constructs a NHN (non-congested neighbors neighbors list and finds a route to a destination through an NHN node. All the primary path nodes periodically calculate its queue_status at node level. While using early congestion detection technique, node detects congestion that is likely to happen and sends warning message to NHN nodes. The ancestor NHN node is aware of this situation and finds an alternate path to a destination immediately by applying adaptive path mechanism. Thus, EDAPR improves performance in terms of reducing delay, routing overhead and increases packet delivery ratio without incurring any significant additional cost. The performance of EDAPR was compared with EDAODV and EDCSCAODV using the Ns-2 simulator. The result reveals significant improvement over EDAODV and EDCSCAODV routing schemes.