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.

Energy- Efficient Routing Protocols For Wireless Sensor Network A Review

Directory of Open Access Journals (Sweden)

Pardeep Kaur

2017-12-01

Full Text Available There has been plenty of interest in building and deploying sensor networks. Wireless sensor network is a collection of a large number of small nodes which acts as routers also. These nodes carry very limited power source which is non-rechargeable and non-replaceable which makes energy consumption an significant issue. Energy conservation is a very important issue for prolonging the lifetime of the network. As the sensor nodes act like routers as well the determination of routing technique plays a key role in controlling the consumption of energy. This paper describes the framework of wireless sensor network and the analysis and study of various research work related to Energy Efficient Routing in Wireless Sensor Networks.

Route Instruction Mechanism for Mobile Users Leveraging Distributed Wireless Resources

Science.gov (United States)

Kakehi, Takeshi; Shinkuma, Ryoichi; Murase, Tutomu; Motoyoshi, Gen; Yamori, Kyoko; Takahashi, Tatsuro

The market growths of smart-phones and thin clients have been significantly increasing communication traffic in mobile networks. To handle the increased traffic, network operators should consider how to leverage distributed wireless resources such as distributed spots of wireless local access networks. In this paper, we consider the system where multiple moving users share distributed wireless access points on their traveling routes between their start and goal points and formulate as an optimization problem. Then, we come up with three algorithms as a solution for the problem. The key idea here is ‘longcut route instruction’, in which users are instructed to choose a traveling route where less congested access points are available; even if the moving distance increases, the throughput for users in the system would improve. In this paper, we define the gain function. Moreover, we analyze the basic characteristics of the system using as a simple model as possible.

High throughput route selection in multi-rate wireless mesh networks

Institute of Scientific and Technical Information of China (English)

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

2008-01-01

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

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

DESIGN OF ENERGY EFFICIENT ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORK (WSN) USING PASCAL GRAPH

OpenAIRE

Deepali Panwar; Subhrendu Guha Neogi

2013-01-01

Development of energy efficient Wireless Sensor Network (WSN) routing protocol is nowadays main area of interest amongst researchers. This research is an effort in designing energy efficient Wireless Sensor Network (WSN) routing protocol under certain parameters consideration. Research report discusses various existing WSN routing protocols and propose a new WSN energy efficient routing protocol. Results show a significant improvement in life cycle of the nodes and enhancement ...

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.

RELIABLE DYNAMIC SOURCE ROUTING PROTOCOL (RDSRP FOR ENERGY HARVESTING WIRELESS SENSOR NETWORKS

Directory of Open Access Journals (Sweden)

B. Narasimhan

2015-03-01

Full Text Available Wireless sensor networks (WSNs carry noteworthy pros over traditional communication. Though, unkind and composite environments fake great challenges in the reliability of WSN communications. It is more vital to develop a reliable unipath dynamic source routing protocol (RDSRPl for WSN to provide better quality of service (QoS in energy harvesting wireless sensor networks (EH-WSN. This paper proposes a dynamic source routing approach for attaining the most reliable route in EH-WSNs. Performance evaluation is carried out using NS-2 and throughput and packet delivery ratio are chosen as the metrics.

Efficient Routing in Wireless Sensor Networks with Multiple Sessions

OpenAIRE

Dianjie Lu; Guijuan Zhang; Ren Han; Xiangwei Zheng; Hong Liu

2014-01-01

Wireless Sensor Networks (WSNs) are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficu...

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)

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.

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.

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

Directory of Open Access Journals (Sweden)

Jeevaa Katiravan

2015-01-01

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

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.

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.

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.

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

Energy Efficient Position-Based Three Dimensional Routing for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jeongdae Kim

2008-04-01

Full Text Available In this paper, we focus on an energy efficient position-based three dimensional (3D routing algorithm using distance information, which affects transmission power consumption between nodes as a metric. In wireless sensor networks, energy efficiency is one of the primary objectives of research. In addition, recent interest in sensor networks is extended to the need to understand how to design networks in a 3D space. Generally, most wireless sensor networks are based on two dimensional (2D designs. However, in reality, such networks operate in a 3D space. Since 2D designs are simpler and easier to implement than 3D designs for routing algorithms in wireless sensor networks, the 2D assumption is somewhat justified and usually does not lead to major inaccuracies. However, in some applications such as an airborne to terrestrial sensor networks or sensor networks, which are deployed in mountains, taking 3D designs into consideration is reasonable. In this paper, we propose the Minimum Sum of Square distance (MSoS algorithm as an energy efficient position-based three dimensional routing algorithm. In addition, we evaluate and compare the performance of the proposed routing algorithm with other algorithms through simulation. Finally, the results of the simulation show that the proposed routing algorithm is more energy efficient than other algorithms in a 3D space.

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

Information processing and routing in wireless sensor networks

CERN Document Server

Yu, Yang; Krishnamachari, Bhaskar

2006-01-01

This book presents state-of-the-art cross-layer optimization techniques for energy-efficient information processing and routing in wireless sensor networks. Besides providing a survey on this important research area, three specific topics are discussed in detail - information processing in a collocated cluster, information transport over a tree substrate, and information routing for computationally intensive applications. The book covers several important system knobs for cross-layer optimization, including voltage scaling, rate adaptation, and tunable compression. By exploring tradeoffs of en

A SURVEY on WIRELESS MESH NETWORKS, ROUTING METRICS and PROTOCOLS

Directory of Open Access Journals (Sweden)

Safak DURUKAN ODABASI

2013-01-01

Full Text Available Today, Internet has become an indispensable part of our daily lives. It has a growing user community in many fields from banking transactions to online entertainment. It will be very efficient for users, as the next generation internet access becomes wireless like frequently used services such as cellular phones. But for providing this, a new network is needed to be designed or an existing network must be improved as well as making changes on infrastructure. At this point, mesh network infrastructure arises and offers more sophisticated internet access with less need. The most important advantage of mesh networks is the capability of working without infrastructure. Mesh networks are an additional access technology more than being a renewed one in the next generation wireless networks called 4G. In this study, wireless mesh networks and example applications are mentioned. Base architecture and design factors are emphasized, current routing protocols that are used on wireless mesh networks and routing metrics on which these protocols are based, are explained. Finally, the performance effects of these protocols and metrics on different network topologies are referred.

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.

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

Science.gov (United States)

Rachamalla, Sandhya; Kancherla, Anitha Sheela

2016-01-01

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

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.

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

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

Directory of Open Access Journals (Sweden)

Wang Tao

2014-04-01

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

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.

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.

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.

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.

Cluster Based Hierarchical Routing Protocol for Wireless Sensor Network

OpenAIRE

Rashed, Md. Golam; Kabir, M. Hasnat; Rahim, Muhammad Sajjadur; Ullah, Shaikh Enayet

2012-01-01

The efficient use of energy source in a sensor node is most desirable criteria for prolong the life time of wireless sensor network. In this paper, we propose a two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP). We introduce a new concept called head-set, consists of one active cluster head and some other associate cluster heads within a cluster. The head-set members are responsible for control and management of the network. Results show that t...

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

Directory of Open Access Journals (Sweden)

Kai Lin

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.

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.

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.

Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sohail Jabbar

2015-01-01

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

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.

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.

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

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.

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.

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.

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.

A source-initiated on-demand routing algorithm based on the Thorup-Zwick theory for mobile wireless sensor networks.

Science.gov (United States)

Mao, Yuxin; Zhu, Ping

2013-01-01

The unreliability and dynamics of mobile wireless sensor networks make it hard to perform end-to-end communications. This paper presents a novel source-initiated on-demand routing mechanism for efficient data transmission in mobile wireless sensor networks. It explores the Thorup-Zwick theory to achieve source-initiated on-demand routing with time efficiency. It is able to find out shortest routing path between source and target in a network and transfer data in linear time. The algorithm is easy to be implemented and performed in resource-constrained mobile wireless sensor networks. We also evaluate the approach by analyzing its cost in detail. It can be seen that the approach is efficient to support data transmission in mobile wireless sensor networks.

Planning of Vehicle Routing with Backup Provisioning Using Wireless Sensor Technologies

Directory of Open Access Journals (Sweden)

Noélia Correia

2017-08-01

Full Text Available Wireless sensor technologies can be used by intelligent transportation systems to provide innovative services that lead to improvements in road safety and congestion, increasing end-user satisfaction. In this article, we address vehicle routing with backup provisioning, where the possibility of reacting to overloading/overcrowding of vehicles at certain stops is considered. This is based on the availability of vehicle load information, which can be captured using wireless sensor technologies. After discussing the infrastructure and monitoring tool, the problem is mathematically formalized, and a heuristic algorithm using local search procedures is proposed. Results show that planning routes with backup provisioning can allow fast response to overcrowding while reducing costs. Therefore, sustainable urban mobility, with efficient use of resources, can be provided while increasing the quality of service perceived by users.

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

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

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.

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.

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

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.

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.

SD-EAR: Energy Aware Routing in Software Defined Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Anuradha Banerjee

2018-06-01

Full Text Available In today’s internet-of-things (IoT environment, wireless sensor networks (WSNs have many advantages, with broad applications in different areas including environmental monitoring, maintaining security, etc. However, high energy depletion may lead to node failures in WSNs. In most WSNs, nodes deplete energy mainly because of the flooding and broadcasting of route-request (RREQ packets, which is essential for route discovery in WSNs. The present article models wireless sensor networks as software-defined wireless sensor networks (SD-WSNs where the network is divided into multiple clusters or zones, and each zone is controlled by a software-defined network (SDN controller. The SDN controller is aware of the topology of each zone, and finds out the optimum energy efficient path from any source to any destination inside the zone. For destinations outside of the zone, the SDN controller of the source zone instructs the source to send a message to all of the peripheral nodes in that zone, so that they can forward the message to the peripheral nodes in other zones, and the process goes on until a destination is found. As far as energy-efficient path selection is concerned, the SDN controller of a zone is aware of the connectivity and residual energy of each node. Therefore, it is capable of discovering an optimum energy efficient path from any source to any destination inside as well as outside of the zone of the source. Accordingly, flow tables in different routers are updated dynamically. The task of route discovery is shifted from individual nodes to controllers, and as a result, the flooding of route-requests is completely eliminated. Software-defined energy aware routing (SD-EARalso proposes an innovative sleeping strategy where exhausted nodes are allowed to go to sleep through a sleep request—sleep grant mechanism. All of these result in huge energy savings in SD-WSN, as shown in the simulation results.

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

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.

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

CSIR Research Space (South Africa)

Salami, O

2009-09-01

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

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.

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.

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

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.

A Low-Jitter Wireless Transmission Based on Buffer Management in Coding-Aware Routing

Directory of Open Access Journals (Sweden)

Cunbo Lu

2015-08-01

Full Text Available It is significant to reduce packet jitter for real-time applications in a wireless network. Existing coding-aware routing algorithms use the opportunistic network coding (ONC scheme in a packet coding algorithm. The ONC scheme never delays packets to wait for the arrival of a future coding opportunity. The loss of some potential coding opportunities may degrade the contribution of network coding to jitter performance. In addition, most of the existing coding-aware routing algorithms assume that all flows participating in the network have equal rate. This is unrealistic, since multi-rate environments often appear. To overcome the above problem and expand coding-aware routing to multi-rate scenarios, from the view of data transmission, we present a low-jitter wireless transmission algorithm based on buffer management (BLJCAR, which decides packets in coding node according to the queue-length based threshold policy instead of the regular ONC policy as used in existing coding-aware routing algorithms. BLJCAR is a unified framework to merge the single rate case and multiple rate case. Simulations results show that the BLJCAR algorithm embedded in coding-aware routing outperforms the traditional ONC policy in terms of jitter, packet delivery delay, packet loss ratio and network throughput in network congestion in any traffic rates.

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. PMID:26426701

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.

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.

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.

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.

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

Directory of Open Access Journals (Sweden)

Thirumoorthy Palanisamy

Full Text Available 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.

A Hybrid Adaptive Routing Algorithm for Event-Driven Wireless Sensor Networks

Science.gov (United States)

Figueiredo, Carlos M. S.; Nakamura, Eduardo F.; Loureiro, Antonio A. F.

2009-01-01

Routing is a basic function in wireless sensor networks (WSNs). For these networks, routing algorithms depend on the characteristics of the applications and, consequently, there is no self-contained algorithm suitable for every case. In some scenarios, the network behavior (traffic load) may vary a lot, such as an event-driven application, favoring different algorithms at different instants. This work presents a hybrid and adaptive algorithm for routing in WSNs, called Multi-MAF, that adapts its behavior autonomously in response to the variation of network conditions. In particular, the proposed algorithm applies both reactive and proactive strategies for routing infrastructure creation, and uses an event-detection estimation model to change between the strategies and save energy. To show the advantages of the proposed approach, it is evaluated through simulations. Comparisons with independent reactive and proactive algorithms show improvements on energy consumption. PMID:22423207

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

Directory of Open Access Journals (Sweden)

Mingchuan Zhang

2014-01-01

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

Efficient Routing in Wireless Sensor Networks with Multiple Sessions

Directory of Open Access Journals (Sweden)

Dianjie Lu

2014-05-01

Full Text Available Wireless Sensor Networks (WSNs are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficult in the scenario of multiple sessions since different source-destination pairs may pass the same link which makes the flow distribution of each link uncertain. Our goal is to minimize the energy cost and provide the robust transmission by choosing the optimal paths. We first study the problem from a theoretical standpoint by mapping it to the multi-commodity network design problem. Since it is hard to build a global addressing scheme due to the great number of sensor nodes, we propose a Distributed Energy Efficient Routing protocol (D2ER. In D2ER, we employ the transportation method which can optimize the flow distribution with minimal energy consumption. Simulation results demonstrate that our optimal algorithm can save energy drastically.

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.

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

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

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.

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.

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

Science.gov (United States)

Tseng, Chinyang Henry

2016-05-31

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

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.

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.

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.

Why aircraft will fly more fuel-efficiently on FRIDAY : The FRIDAY route charges method

NARCIS (Netherlands)

Verbeek, R.J.D.; Visser, H.G.; Lovell, D.; Fricke, H.

2016-01-01

The Single European Sky is being introduced to improve the efficiency of flight and traffic operations by reforming the air traffic management system. Despite all of these technical advances, airlines choose detours to avoid high route charges. This mechanism is intensified when fuel prices are low.

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.

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

DEFF Research Database (Denmark)

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

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

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.

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

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.

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.

A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks

Science.gov (United States)

Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore

Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.

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.

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

Directory of Open Access Journals (Sweden)

J. Trdlicka

2010-12-01

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

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.

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

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. PMID:23676625

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

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

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

KAUST Repository

Tobagi, Fouad A.; Hira, Mukesh M.

2010-01-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

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.

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.

Routing Protocols for Underwater Wireless Sensor Networks: Taxonomy, Research Challenges, Routing Strategies and Future Directions.

Science.gov (United States)

Khan, Anwar; Ali, Ihsan; Ghani, Abdullah; Khan, Nawsher; Alsaqer, Mohammed; Rahman, Atiq Ur; Mahmood, Hasan

2018-05-18

Recent research in underwater wireless sensor networks (UWSNs) has gained the attention of researchers in academia and industry for a number of applications. They include disaster and earthquake prediction, water quality and environment monitoring, leakage and mine detection, military surveillance and underwater navigation. However, the aquatic medium is associated with a number of limitations and challenges: long multipath delay, high interference and noise, harsh environment, low bandwidth and limited battery life of the sensor nodes. These challenges demand research techniques and strategies to be overcome in an efficient and effective fashion. The design of routing protocols for UWSNs is one of the promising solutions to cope with these challenges. This paper presents a survey of the routing protocols for UWSNs. For the ease of description, the addressed routing protocols are classified into two groups: localization-based and localization-free protocols. These groups are further subdivided according to the problems they address or the major parameters they consider during routing. Unlike the existing surveys, this survey considers only the latest and state-of-the-art routing protocols. In addition, every protocol is described in terms of its routing strategy and the problem it addresses and solves. The merit(s) of each protocol is (are) highlighted along with the cost. A description of the protocols in this fashion has a number of advantages for researchers, as compared to the existing surveys. Firstly, the description of the routing strategy of each protocol makes its routing operation easily understandable. Secondly, the demerit(s) of a protocol provides (provide) insight into overcoming its flaw(s) in future investigation. This, in turn, leads to the foundation of new protocols that are more intelligent, robust and efficient with respect to the desired parameters. Thirdly, a protocol can be selected for the appropriate application based on its described

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.

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.

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.

On the cost/delay tradeoff of wireless delay tolerant geographic routing

OpenAIRE

Tasiopoulos, Argyrios; Tsiaras, Christos; Toumpis, Stavros

2012-01-01

In Delay Tolerant Networks (DTNs), there is a fundamental tradeoff between the aggregate transport cost of a packet and the delay in its delivery. We study this tradeoff in the context of geographical routing in wireless DTNs.We ?rst specify the optimal cost/delay tradeoff, i.e., the tradeoff under optimal network operation, using a dynamic network construction termed the Cost/Delay Evolving Graph (C/DEG) and the Optimal Cost/Delay Curve (OC/DC), a function that gives the minimum possible agg...

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2017-03-01

Full Text Available In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast, second technique is the improved Hydrocast (improved-Hydrocast, and third one is the cooperative improved Hydrocast (Co-improved Hydrocast. In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR of the received signal is not within the predefined threshold then the maximal ratio combining (MRC is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.

Science.gov (United States)

Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

2017-03-19

In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

Dynamic origin-to-destination routing of wirelessly connected, autonomous vehicles on a congested network

Science.gov (United States)

Davis, L. C.

2017-07-01

Up-to-date information wirelessly communicated among vehicles can be used to select the optimal route between a given origin and destination. To elucidate how to make use of such information, simulations are performed for autonomous vehicles traveling on a square lattice of roads. All the possible routes between the origin and the destination (without backtracking) are of the same length. Congestion is the only determinant of delay. At each intersection, right-of-way is given to the closest vehicle. There are no traffic lights. Trip times of a subject vehicle are recorded for various initial conditions using different routing algorithms. Surprisingly, the simplest algorithm, which is based on the total number of vehicles on a route, is as good as one based on computing travel times from the average velocity of vehicles on each road segment.

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.

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

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.

Inter-flow and intra-flow interference mitigation routing in wireless mesh networks

OpenAIRE

Houaidia, Chiraz; Idoudi, Hanen; Van den Bossche, Adrien; Saidane, Leila; Val, Thierry

2017-01-01

In this paper, we address the problem of QoS support in an heterogeneous multi-rate wireless mesh network. We propose a new routing metric that provides information about link quality, based on PHY and MAC characteristics, including the link availability, the loss rate and the available bandwidth. This metric allows to apprehend inter-flow interferences and avoid bottleneck formation by balancing traffic load on the links. Based on the conflict graph model and calculation of maximal cliques, ...

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

Science.gov (United States)

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

2018-01-01

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

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

Science.gov (United States)

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

2018-01-01

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

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.

A SURVEY ON MULTICAST ROUTING PROTOCOLS FOR PERFORMANCE EVALUATION IN WIRELESS SENSOR NETWORK

Directory of Open Access Journals (Sweden)

A. Suruliandi

2015-03-01

Full Text Available Multicast is a process used to transfer same message to multiple receivers at the same time. This paper presents the simulation and analysis of the performance of six different multicast routing protocols for Wireless Sensor Network (WSN. They are On Demand Multicast Routing Protocol (ODMRP, Protocol for Unified Multicasting through Announcement (PUMA, Multicast Adhoc On demand Distance Vector Protocol (MAODV, Overlay Boruvka-based Adhoc Multicast Protocol (OBAMP, Application Layer Multicast Algorithm (ALMA and enhanced version of ALMA (ALMA-H for WSN. Among them, ODMRP, MAODV and PUMA are reactive protocols while OBAMP, ALMA and ALMA-H are proactive protocols. This paper compares the performance of these protocols with common parameters such as Throughput, Reliability, End-to-End delay and Packet Delivery Ratio (PDR with increasing the numbers of nodes and increasing the speed of the nodes. The main objective of this work is to select the efficient multicast routing protocol for WSN among six multicast routing protocol based on relative strength and weakness of each protocol. The summary of above six multicast routing protocols is presented with a table of different performance characteristics. Experimental result shows that ODMRP attains higher throughput, reliability and higher packet delivery ratio than other multicast routing protocol, while incurring far less end-to-end delay.

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.

Fuzzy Weight Cluster-Based Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Teng Gao

2015-01-01

Full Text Available Cluster-based protocol is a kind of important routing in wireless sensor networks. However, due to the uneven distribution of cluster heads in classical clustering algorithm, some nodes may run out of energy too early, which is not suitable for large-scale wireless sensor networks. In this paper, a distributed clustering algorithm based on fuzzy weighted attributes is put forward to ensure both energy efficiency and extensibility. On the premise of a comprehensive consideration of all attributes, the corresponding weight of each parameter is assigned by using the direct method of fuzzy engineering theory. Then, each node works out property value. These property values will be mapped to the time axis and be triggered by a timer to broadcast cluster headers. At the same time, the radio coverage method is adopted, in order to avoid collisions and to ensure the symmetrical distribution of cluster heads. The aggregated data are forwarded to the sink node in the form of multihop. The simulation results demonstrate that clustering algorithm based on fuzzy weighted attributes has a longer life expectancy and better extensibility than LEACH-like algorithms.

Achieving sink node anonymity in tactical wireless sensor networks using a reactive routing protocol

Science.gov (United States)

2017-06-01

node anonymity, base station anonymity, Wireless Sensor Networks (WSN), Mobile Ad hoc Network (MANET), Lightweight Ad hoc On-Demand – Next Generation ... Generation (LOADng) reactive-routing protocol to achieve anonymity. This modified protocol prevents an attacker from identifying the sink node without...within the constraints of WSN communication protocols, specifically IEEE 802.15.4. We use and modify the Lightweight Ad hoc On-Demand – Next Generation

Compromises Between Quality of Service Metrics and Energy Consumption of Hierarchical and Flat Routing Protocols for Wireless Sensors Network

Directory of Open Access Journals (Sweden)

Abdelbari BEN YAGOUTA

2016-11-01

Full Text Available Wireless Sensor Network (WSN is wireless network composed of spatially distributed and tiny autonomous nodes, which cooperatively monitor physical or environmental conditions. Among the concerns of these networks is prolonging the lifetime by saving nodes energy. There are several protocols specially designed for WSNs based on energy conservation. However, many WSNs applications require QoS (Quality of Service criteria, such as latency, reliability and throughput. In this paper, we will compare three routing protocols for wireless sensors network LEACH (Low Energy Adaptive Clustering Hierarchy, AODV (Ad hoc on demand Distance Vector and LABILE (Link Quality-Based Lexical Routing using Castalia simulator in terms of energy consumption, throughput, reliability and latency time of packets received by sink under different conditions to determinate the best configurations that offers the most suitable compromises between energy conservation and all QoS metrics for each routing protocols. The results show that, the best configurations that offer the suitable compromises between energy conservation and all QoS metrics is a large number of deployed nodes with low packet rate for LEACH (300 nodes and 1 packet/s, a medium number of deployed nodes with low packet rate For AODV (100 nodes and 1 packet/s and a very low nodes density with low packet rate for LABILE (50 nodes and 1 packet/s.

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.

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.

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.

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.

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.

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.

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.

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

Security-Oriented and Load-Balancing Wireless Data Routing Game in the Integration of Advanced Metering Infrastructure Network in Smart Grid

Energy Technology Data Exchange (ETDEWEB)

He, Fulin; Cao, Yang; Zhang, Jun Jason; Wei, Jiaolong; Zhang, Yingchen; Muljadi, Eduard; Gao, Wenzhong

2016-11-21

Ensuring flexible and reliable data routing is indispensable for the integration of Advanced Metering Infrastructure (AMI) networks, we propose a secure-oriented and load-balancing wireless data routing scheme. A novel utility function is designed based on security routing scheme. Then, we model the interactive security-oriented routing strategy among meter data concentrators or smart grid meters as a mixed-strategy network formation game. Finally, such problem results in a stable probabilistic routing scheme with proposed distributed learning algorithm. One contributions is that we studied that different types of applications affect the routing selection strategy and the strategy tendency. Another contributions is that the chosen strategy of our mixed routing can adaptively to converge to a new mixed strategy Nash equilibrium (MSNE) during the learning process in the smart grid.

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

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.

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.

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.

An Energy Centric Cluster-Based Routing Protocol for Wireless Sensor Networks.

Science.gov (United States)

Hosen, A S M Sanwar; Cho, Gi Hwan

2018-05-11

Clustering is an effective way to prolong the lifetime of a wireless sensor network (WSN). The common approach is to elect cluster heads to take routing and controlling duty, and to periodically rotate each cluster head's role to distribute energy consumption among nodes. However, a significant amount of energy dissipates due to control messages overhead, which results in a shorter network lifetime. This paper proposes an energy-centric cluster-based routing mechanism in WSNs. To begin with, cluster heads are elected based on the higher ranks of the nodes. The rank is defined by residual energy and average distance from the member nodes. With the role of data aggregation and data forwarding, a cluster head acts as a caretaker for cluster-head election in the next round, where the ranks' information are piggybacked along with the local data sending during intra-cluster communication. This reduces the number of control messages for the cluster-head election as well as the cluster formation in detail. Simulation results show that our proposed protocol saves the energy consumption among nodes and achieves a significant improvement in the network lifetime.

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.

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.

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%

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.

The Comparative Study Some of Reactive and Proactive Routing Protocols in The Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Anas Ali Hussien

2018-02-01

Full Text Available The wireless sensor network (WSN consists mostly of a large number of nodes in a large area where not all nodes are directly connected. The applications of comprise a wide variety of scenarios.The mobile nodes are free to move because this network has selfــstructured topology. Routing protocols are responsible for detecting and maintaining paths in the network, and it classified into reactive (OnـــDemand, proactive (Table driven, and hybrid. In this paper represents a performance study of some WSN routing protocols: the Dynamic Source Routing (DSR, Ad hoc On-Demand Distance Vector (AODV, and Destination-Sequenced Distance-Vector (DSDV. The comparison made according to important metrics like packet delivery ratio (PDR, total packets dropped, Average end-to-end delay (Avg EED, and normalized routing load under the Transmission Control Protocol (TCP and User Datagram Protocol (UDP traffic connection and with varying number of nodes, pause time; and  varying speed. In this work used (NSــ2.35 that installed on (Ubuntu 14.04 operating system to implementing the scenario. Conclude that the DSR has better performance in TCP connection; while the DSDV has better performance in UDP protocol.

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

Science.gov (United States)

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

2015-10-20

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

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.

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

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. PMID:23202008

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.

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

International Nuclear Information System (INIS)

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

2010-01-01

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

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.

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

A General Self-Organized Tree-Based Energy-Balance Routing Protocol for Wireless Sensor Network

Science.gov (United States)

Han, Zhao; Wu, Jie; Zhang, Jie; Liu, Liefeng; Tian, Kaiyun

2014-04-01

Wireless sensor network (WSN) is a system composed of a large number of low-cost micro-sensors. This network is used to collect and send various kinds of messages to a base station (BS). WSN consists of low-cost nodes with limited battery power, and the battery replacement is not easy for WSN with thousands of physically embedded nodes, which means energy efficient routing protocol should be employed to offer a long-life work time. To achieve the aim, we need not only to minimize total energy consumption but also to balance WSN load. Researchers have proposed many protocols such as LEACH, HEED, PEGASIS, TBC and PEDAP. In this paper, we propose a General Self-Organized Tree-Based Energy-Balance routing protocol (GSTEB) which builds a routing tree using a process where, for each round, BS assigns a root node and broadcasts this selection to all sensor nodes. Subsequently, each node selects its parent by considering only itself and its neighbors' information, thus making GSTEB a dynamic protocol. Simulation results show that GSTEB has a better performance than other protocols in balancing energy consumption, thus prolonging the lifetime of WSN.

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

Science.gov (United States)

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

2012-01-01

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

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.

Interface Assignment-Based AODV Routing Protocol to Improve Reliability in Multi-Interface Multichannel Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Won-Suk Kim

2015-01-01

Full Text Available The utilization of wireless mesh networks (WMNs has greatly increased, and the multi-interface multichannel (MIMC technic has been widely used for the backbone network. Unfortunately, the ad hoc on-demand distance vector (AODV routing protocol defined in the IEEE 802.11s standard was designed for WMNs using the single-interface single-channel technic. So, we define a problem that happens when the legacy AODV is used in MIMC WMNs and propose an interface assignment-based AODV (IA-AODV in order to resolve that problem. IA-AODV, which is based on multitarget path request, consists of the PREQ prediction scheme, the PREQ loss recovery scheme, and the PREQ sender assignment scheme. A detailed operation according to various network conditions and services is introduced, and the routing efficiency and network reliability of a network using IA-AODV are analyzed over the presented system model. Finally, after a real-world test-bed for MIMC WMNs using the IA-AODV routing protocol is implemented, the various indicators of the network are evaluated through experiments. When the proposed routing protocol is compared with the existing AODV routing protocol, it performs the path update using only 14.33% of the management frames, completely removes the routing malfunction, and reduces the UDP packet loss ratio by 0.0012%.

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.

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

Connectivity model for Inter-working multi-hop wireless networks

CSIR Research Space (South Africa)

Salami, O

2009-08-01

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

Black Friday = Broget Branding?

DEFF Research Database (Denmark)

Hansen, Heidi

2015-01-01

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

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.

CENTERA: a centralized trust-based efficient routing protocol with authentication for wireless sensor networks.

Science.gov (United States)

Tajeddine, Ayman; Kayssi, Ayman; Chehab, Ali; Elhajj, Imad; Itani, Wassim

2015-02-02

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.

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.

Mathematical Modeling and Analysis Methodology for Opportunistic Routing in Wireless Multihop Networks

Directory of Open Access Journals (Sweden)

Wang Dongyang

2015-01-01

Full Text Available Modeling the forwarding feature and analyzing the performance theoretically for opportunistic routing in wireless multihop network are of great challenge. To address this issue, a generalized geometric distribution (GGD is firstly proposed. Based on the GGD, the forwarding probability between any two forwarding candidates could be calculated and it can be proved that the successful delivery rate after several transmissions of forwarding candidates is irrelevant to the priority rule. Then, a discrete-time queuing model is proposed to analyze mean end-to-end delay (MED of a regular opportunistic routing with the knowledge of the forwarding probability. By deriving the steady-state joint generating function of the queue length distribution, MED for directly connected networks and some special cases of nondirectly connected networks could be ultimately determined. Besides, an approximation approach is proposed to assess MED for the general cases in the nondirectly connected networks. By comparing with a large number of simulation results, the rationality of the analysis is validated. Both the analysis and simulation results show that MED varies with the number of forwarding candidates, especially when it comes to connected networks; MED increases more rapidly than that in nondirectly connected networks with the increase of the number of forwarding candidates.

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.

Securing DSR with mobile agents in wireless ad hoc networks

Directory of Open Access Journals (Sweden)

Ahmed Abosamra

2011-03-01

Full Text Available Ad hoc wireless network consists of a set of wireless nodes communicating with each other without a pre-defined infrastructure. They communicate by forwarding packets which can reach wireless nodes that do not exist in the range of the direct radio transmission. Designing ad hoc network routing protocols is a challenging task because of its decentralized infrastructure which makes securing ad hoc networks more and more challenging. Dynamic Source Routing (DSR protocol is a popular routing protocol designed for use in wireless ad hoc networks. Mobile agent is a promising technology used in diverse fields of network applications. In this paper, we try to implement DSR using mobile agents for securing this type of wireless network. Hybrid encryption technique (symmetric key encryption/public key encryption is used to improve performance; where symmetric keys are used to encrypt routing data to authenticate and authorize node sending data, while, public keys are used for the exchange of symmetric keys between nodes. We found that DSR may be secured using mobile agents with competitive performance.

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…

Analysis of Pervasive Mobile Ad Hoc Routing Protocols

Science.gov (United States)

Qadri, Nadia N.; Liotta, Antonio

Mobile ad hoc networks (MANETs) are a fundamental element of pervasive networks and therefore, of pervasive systems that truly support pervasive computing, where user can communicate anywhere, anytime and on-the-fly. In fact, future advances in pervasive computing rely on advancements in mobile communication, which includes both infrastructure-based wireless networks and non-infrastructure-based MANETs. MANETs introduce a new communication paradigm, which does not require a fixed infrastructure - they rely on wireless terminals for routing and transport services. Due to highly dynamic topology, absence of established infrastructure for centralized administration, bandwidth constrained wireless links, and limited resources in MANETs, it is challenging to design an efficient and reliable routing protocol. This chapter reviews the key studies carried out so far on the performance of mobile ad hoc routing protocols. We discuss performance issues and metrics required for the evaluation of ad hoc routing protocols. This leads to a survey of existing work, which captures the performance of ad hoc routing algorithms and their behaviour from different perspectives and highlights avenues for future research.

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)

An energy efficient distance-aware routing algorithm with multiple mobile sinks for wireless sensor networks.

Science.gov (United States)

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-08-18

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.

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

Science.gov (United States)

Tajeddine, Ayman; Kayssi, Ayman; Chehab, Ali; Elhajj, Imad; Itani, Wassim

2015-01-01

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. PMID:25648712

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.

Enhancements of LEACH Algorithm for Wireless Networks: A Review

Directory of Open Access Journals (Sweden)

M. Madheswaran

2013-12-01

Full Text Available Low Energy Adaptive Clustering Hierarchy (LEACH protocol is the first hierarchical cluster based routing protocol successfully used in the Wireless Sensor Networks (WSN. In this paper, various enhancements used in the original LEACH protocol are examined. The basic operations, advantages and limitations of the modified LEACH algorithms are compared to identify the research issues to be solved and to give the suggestions for the future proposed routing algorithms of wireless networks based on LEACH routing algorithm.

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.

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.

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-04-26

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.

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

An Opportunistic Routing Mechanism Combined with Long-Term and Short-Term Metrics for WMN

Directory of Open Access Journals (Sweden)

Weifeng Sun

2014-01-01

Full Text Available WMN (wireless mesh network is a useful wireless multihop network with tremendous research value. The routing strategy decides the performance of network and the quality of transmission. A good routing algorithm will use the whole bandwidth of network and assure the quality of service of traffic. Since the routing metric ETX (expected transmission count does not assure good quality of wireless links, to improve the routing performance, an opportunistic routing mechanism combined with long-term and short-term metrics for WMN based on OLSR (optimized link state routing and ETX is proposed in this paper. This mechanism always chooses the highest throughput links to improve the performance of routing over WMN and then reduces the energy consumption of mesh routers. The simulations and analyses show that the opportunistic routing mechanism is better than the mechanism with the metric of ETX.

An opportunistic routing mechanism combined with long-term and short-term metrics for WMN.

Science.gov (United States)

Sun, Weifeng; Wang, Haotian; Piao, Xianglan; Qiu, Tie

2014-01-01

WMN (wireless mesh network) is a useful wireless multihop network with tremendous research value. The routing strategy decides the performance of network and the quality of transmission. A good routing algorithm will use the whole bandwidth of network and assure the quality of service of traffic. Since the routing metric ETX (expected transmission count) does not assure good quality of wireless links, to improve the routing performance, an opportunistic routing mechanism combined with long-term and short-term metrics for WMN based on OLSR (optimized link state routing) and ETX is proposed in this paper. This mechanism always chooses the highest throughput links to improve the performance of routing over WMN and then reduces the energy consumption of mesh routers. The simulations and analyses show that the opportunistic routing mechanism is better than the mechanism with the metric of ETX.

A QoS-Guaranteed Coverage Precedence Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jiun-Chuan Lin

2011-03-01

Full Text Available For mission-critical applications of wireless sensor networks (WSNs involving extensive battlefield surveillance, medical healthcare, etc., it is crucial to have low-power, new protocols, methodologies and structures for transferring data and information in a network with full sensing coverage capability for an extended working period. The upmost mission is to ensure that the network is fully functional providing reliable transmission of the sensed data without the risk of data loss. WSNs have been applied to various types of mission-critical applications. Coverage preservation is one of the most essential functions to guarantee quality of service (QoS in WSNs. However, a tradeoff exists between sensing coverage and network lifetime due to the limited energy supplies of sensor nodes. In this study, we propose a routing protocol to accommodate both energy-balance and coverage-preservation for sensor nodes in WSNs. The energy consumption for radio transmissions and the residual energy over the network are taken into account when the proposed protocol determines an energy-efficient route for a packet. The simulation results demonstrate that the proposed protocol is able to increase the duration of the on-duty network and provide up to 98.3% and 85.7% of extra service time with 100% sensing coverage ratio comparing with LEACH and the LEACH-Coverage-U protocols, respectively.

Wireless Sensor Networks Database: Data Management and Implementation

Directory of Open Access Journals (Sweden)

Ping Liu

2014-04-01

Full Text Available As the core application of wireless sensor network technology, Data management and processing have become the research hotspot in the new database. This article studied mainly data management in wireless sensor networks, in connection with the characteristics of the data in wireless sensor networks, discussed wireless sensor network data query, integrating technology in-depth, proposed a mobile database structure based on wireless sensor network and carried out overall design and implementation for the data management system. In order to achieve the communication rules of above routing trees, network manager uses a simple maintenance algorithm of routing trees. Design ordinary node end, server end in mobile database at gathering nodes and mobile client end that can implement the system, focus on designing query manager, storage modules and synchronous module at server end in mobile database at gathering nodes.

Cost analysis of hybrid adaptive routing protocol for heterogeneous ...

Indian Academy of Sciences (India)

NONITA SHARMA

Event detection; wireless sensor networks; hybrid routing; cost benefit analysis; proactive routing; reactive routing. 1. ... additional energy, high processing power, etc. are deployed to extend the .... transmit to its parent node. (2) Reactive ...

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network.

Science.gov (United States)

Ahmed, Farwa; Wadud, Zahid; Javaid, Nadeem; Alrajeh, Nabil; Alabed, Mohamad Souheil; Qasim, Umar

2018-04-02

The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs). The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

Mobile Sinks Assisted Geographic and Opportunistic Routing Based Interference Avoidance for Underwater Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Farwa Ahmed

2018-04-01

Full Text Available The distinctive features of acoustic communication channel-like high propagation delay, multi-path fading, quick attenuation of acoustic signal, etc. limit the utilization of underwater wireless sensor networks (UWSNs. The immutable selection of forwarder node leads to dramatic death of node resulting in imbalanced energy depletion and void hole creation. To reduce the probability of void occurrence and imbalance energy dissipation, in this paper, we propose mobility assisted geo-opportunistic routing paradigm based on interference avoidance for UWSNs. The network volume is divided into logical small cubes to reduce the interference and to make more informed routing decisions for efficient energy consumption. Additionally, an optimal number of forwarder nodes is elected from each cube based on its proximity with respect to the destination to avoid void occurrence. Moreover, the data packets are recovered from void regions with the help of mobile sinks which also reduce the data traffic on intermediate nodes. Extensive simulations are performed to verify that our proposed work maximizes the network lifetime and packet delivery ratio.

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.

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.

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.

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.

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

Full Text Available Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routing method, called Circular Sailing Routing (CSR, which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by a newly defined "circular distance" on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network, the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path. We also extend CSR to a localized version, Localized CSR, by modifying greedy routing without any additional communication overhead. In addition, we investigate how to design CSR routing for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.

Comparison of routing metrics for wireless mesh networks

CSIR Research Space (South Africa)

Nxumalo, SL

2011-09-01

Full Text Available in each and every relay node so as to find the next hop for the packet. A routing metric is simply a measure used for selecting the best path, used by a routing protocol. Figure 2 shows the relationship between a routing protocol and the routing... on its QoS-awareness level. The routing metrics that considered QoS the most were selected from each group. This section discusses the four routing metrics that were compared in this paper, which are: hop count (HOP), expected transmission count (ETX...

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.

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

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

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.

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.

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

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

Science.gov (United States)

Mao, Yuxin; Wei, Guiyi

2010-01-01

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. PMID:22163424

A feedback-based secure path approach for wireless sensor network data collection.

Science.gov (United States)

Mao, Yuxin; Wei, Guiyi

2010-01-01

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.

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.

DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs).

Science.gov (United States)

Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer

2018-05-12

Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.

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.

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

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.

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

Applying self-organizing map and modified radial based neural network for clustering and routing optimal path in wireless network

Science.gov (United States)

Hoomod, Haider K.; Kareem Jebur, Tuka

2018-05-01

Mobile ad hoc networks (MANETs) play a critical role in today’s wireless ad hoc network research and consist of active nodes that can be in motion freely. Because it consider very important problem in this network, we suggested proposed method based on modified radial basis function networks RBFN and Self-Organizing Map SOM. These networks can be improved by the use of clusters because of huge congestion in the whole network. In such a system, the performance of MANET is improved by splitting the whole network into various clusters using SOM. The performance of clustering is improved by the cluster head selection and number of clusters. Modified Radial Based Neural Network is very simple, adaptable and efficient method to increase the life time of nodes, packet delivery ratio and the throughput of the network will increase and connection become more useful because the optimal path has the best parameters from other paths including the best bitrate and best life link with minimum delays. Proposed routing algorithm depends on the group of factors and parameters to select the path between two points in the wireless network. The SOM clustering average time (1-10 msec for stall nodes) and (8-75 msec for mobile nodes). While the routing time range (92-510 msec).The proposed system is faster than the Dijkstra by 150-300%, and faster from the RBFNN (without modify) by 145-180%.

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.

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.

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

Analysis of energy efficient routing protocols for implementation of a ubiquitous health system

Science.gov (United States)

Kwon, Jongwon; Park, Yongman; Koo, Sangjun; Ayurzana, Odgeral; Kim, Hiesik

2007-12-01

The innovative Ubiquitous-Health was born through convergence of medical service, with development of up to date information technologies and ubiquitous IT. The U-Health can be applied to a variety of special situations for managing functions of each medical center efficiently. This paper focuses on estimation of various routing protocols for implementation of U-health monitoring system. In order to facilitate wireless communication over the network, a routing protocol on the network layer is used to establish precise and efficient route between sensor nodes so that information acquired from sensors may be delivered in a timely manner. A route establishment should be considered to minimize overhead, data loss and power consumption because wireless networks for U-health are organized by a large number of sensor nodes which are small in size and have limited processing power, memory and battery life. In this paper a overview of wireless sensor network technologies commonly known is described as well as evaluation of three multi hop routing protocols which are flooding, gossiping and modified low energy adaptive clustering hierarchy(LEACH) for use with these networks using TOSSIM simulator. As a result of evaluation the integrated wireless sensor board was developed in particular. The board is embedded device based on AVR128 porting TinyOS. Also it employs bio sensor measures blood pressure, pulse frequency and ZigBee module for wireless communication. This paper accelerates the digital convergence age through continual research and development of technologies related the U-Health.

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

Directory of Open Access Journals (Sweden)

Madhumathy Perumal

2015-01-01

Full Text Available 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.

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.

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

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

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

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.

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.

Performance and energy efficiency in wireless self-organized networks

Energy Technology Data Exchange (ETDEWEB)

Gao, C.

2009-07-01

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

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. PMID:22346622

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.

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

Topology and routing optimization for congestion minimization in optical wireless networks

NARCIS (Netherlands)

Ouveysi, I.; Shu, F.; Chen, W.; Shen, G.; Zukerman, M.

2010-01-01

Optical wireless networks have appealing features such as very high broadband data rates and cost effectiveness. They represent a potential alternative to the last mile (first mile) wireless access problem. However, they are also highly vulnerable to external disturbances such as adverse weather and

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

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.

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.

Efficient data communication protocols for wireless networks

Science.gov (United States)

Zeydan, Engin

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

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.

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

Directory of Open Access Journals (Sweden)

Weiwei Yuan

2013-10-01

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

Multicasting in Wireless Communications (Ad-Hoc Networks): Comparison against a Tree-Based Approach

Science.gov (United States)

Rizos, G. E.; Vasiliadis, D. C.

2007-12-01

We examine on-demand multicasting in ad hoc networks. The Core Assisted Mesh Protocol (CAMP) is a well-known protocol for multicast routing in ad-hoc networks, generalizing the notion of core-based trees employed for internet multicasting into multicast meshes that have much richer connectivity than trees. On the other hand, wireless tree-based multicast routing protocols use much simpler structures for determining route paths, using only parent-child relationships. In this work, we compare the performance of the CAMP protocol against the performance of wireless tree-based multicast routing protocols, in terms of two important factors, namely packet delay and ratio of dropped packets.

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.

Increased longevity of wireless Ad hoc network through fuzzy system

Directory of Open Access Journals (Sweden)

Fawzia Abdali Larki

2014-06-01

Full Text Available The Ad hoc network is one of the multistep-based self-organizing networks, which are dynamically changing and are taken more into account as the ways of connecting the terminals through the development of wireless communication terminals. We are faced with numerous challenges in designing a wireless network such as the dynamic topology, common and limited bandwidth, and the limited energy. The nodes are moving according to the continuous changes in the topology and the source-to-destination paths are completely broken. Therefore, the repeated route discovery enhances the delay and overload of routing. Thus, it is essential to consider the link stability while designing the path in order to choose the routing protocol. Providing the multiple paths may lead to the better performance than a path. The transmission energy control in the wireless Ad hoc networks is the option for the level of transmission energy in order to transmit each node packet in this system. Therefore, transmission energy control affects the wireless medium interface. Because of choosing the appropriate protocol, the routing operation can be improved and the energy consumption can be controlled properly as well as enhancing the durability and longevity of network. The main objective of this study is to enhance the network longevity. The proposed algorithm in this research considers the combination of 2 parameters including the rate of node energy and number of steps in Fuzzy System applied on AOMDV Protocol, which is a Multipath Routing Protocol. The results of simulation also indicate the improved performance of proposed algorithm (AOMDV-F compared to AODV and AOMDV Protocols in NS2 simulator.

Thermal comfort requirements in hot dry regions with special reference to Riyadh Part 2: for Friday prayer

Energy Technology Data Exchange (ETDEWEB)

Saeed, S.A.R. [King Saud University, Riyadh (Saudi Arabia). Dept. of Architecture and Building Science

1996-01-01

This study is an attempt to define thermal comfort requirements for Friday prayer during the hot season of Riyadh, Saudi Arabia. According to Islam, a Muslim should perform his prayers five times a day. The obligatory five prayers are Subuh prayer immediately before dawn, Thohor prayer in the afternoon, Assor prayer in late afternoon, Maghreb prayer immediately after sunset, and Ishaa prayer early evening. Generally, Muslims are encouraged to perform all five prayers in a mosque. Friday prayer that replaces Thohor prayer once a week, should take place in one of the main mosques of the neighbourhood. The mosque where Friday prayer could be performed is known as Friday mosque. Usually Friday prayer is attended by hundreds of worshippers and takes place in the afternoon. Since the summer of Riyadh is characterised by a very high temperature and a very low relative humidity, the indoor climate of the Friday mosque (Al-Masjed Al-Gamae) need a special study. This is the second part of a series of field investigations dealing with thermal comfort requirements in the hot-dry region of Saudi Arabia. (author)

Scripted Mobile Network Routing in a Contested Environment

National Research Council Canada - National Science Library

Otto, Anthony R

2008-01-01

Mobile wireless network protocols currently run on optimistic routing algorithms, adjusting node connectivity only when the chosen connectivity metrics, such as signal strength, pass beyond minimum thresholds...

Technical Report: Sleep-Route - Routing through Sleeping Sensors

OpenAIRE

Sarkar, Chayan; Rao, Vijay S.; Prasad, R. Venkatesha

2014-01-01

In this article, we propose an energy-efficient data gathering scheme for wireless sensor network called Sleep-Route, which splits the sensor nodes into two sets - active and dormant (low-power sleep). Only the active set of sensor nodes participate in data collection. The sensing values of the dormant sensor nodes are predicted with the help of an active sensor node. Virtual Sensing Framework (VSF) provides the mechanism to predict the sensing values by exploiting the data correlation among ...

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

OpenAIRE

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

2016-01-01

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

Challenge: How Effective is Routing for Wireless Networking

Science.gov (United States)

2017-03-03

random waypoint model, where users choose a speed uniformly between 0 and 3 m/s with zero hold-time. In order to avoid the effects of conges- Approved for...Taoka et al., “Scenarios for 5g mobile and wireless communications: the vision of the metis project,” Communications Magazine, IEEE, vol. 52, no. 5

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.

A Comparative Study of Wireless Sensor Networks and Their Routing Protocols

OpenAIRE

Subhajit Pal; Debnath Bhattacharyya; Tai-hoon Kim

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

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

A new 2D mesh routing approach for networks on chip Une nouvelle ...

African Journals Online (AJOL)

a modified XY routing and a communication load-based clustering technique. We show that our .... (TDMA), Round-Robin and fixed priority. B. routing. Figure.3: Router ..... Algorithms for Wireless Sensor Networks,” Computer. Communications ...

DIRECTIONAL OPPORTUNISTIC MECHANISM IN CLUSTER MESSAGE CRITICALITY LEVEL BASED ZIGBEE ROUTING

OpenAIRE

B.Rajeshkanna *1, Dr.M.Anitha 2

2018-01-01

The cluster message criticality level based zigbee routing(CMCLZOR) has been proposed for routing the cluster messages in wireless smart energy home area networks. It employs zigbee opportunistic shortcut tree routing(ZOSTR) and AODV individually for routing normal messages and highly critical messages respectively. ZOSTR allows the receiving nodes to compete for forwarding a packet with the priority of left-over hops rather than stating single next hop node like unicast protocols. Since it h...

CBHRP: A Cluster Based Routing Protocol for Wireless Sensor Network

OpenAIRE

Rashed, M. G.; Kabir, M. Hasnat; Rahim, M. Sajjadur; Ullah, Sk. Enayet

2012-01-01

A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to collect information from target field. On rotation basis, a head-set member receives data from the neighbor nodes and transmits the aggregated results to the distance base station. This protocol ...

Simulations of Large-scale WiFi-based Wireless Networks: Interdisciplinary Challenges and Applications

OpenAIRE

Nekovee, Maziar

2008-01-01

Wireless Fidelity (WiFi) is the fastest growing wireless technology to date. In addition to providing wire-free connectivity to the Internet WiFi technology also enables mobile devices to connect directly to each other and form highly dynamic wireless adhoc networks. Such distributed networks can be used to perform cooperative communication tasks such ad data routing and information dissemination in the absence of a fixed infrastructure. Furthermore, adhoc grids composed of wirelessly network...

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

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

Friday Letters: Connecting Students, Teachers, and Families through Writing

Science.gov (United States)

Newman, Terry H.; Bizzarri, Sarah A.

2012-01-01

An important part of student success in school is the involvement of families. However, the communication between students and families regarding school is often sparse at best and caregivers can feel left out as to what is happening. Friday letters improve communication between students and families and also provide a myriad of instructional…

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.

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

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

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.

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

Comparison of MANET routing protocols using a scaled indoor wireless grid

CSIR Research Space (South Africa)

Johnson, DL

2008-04-01

Full Text Available accumulation feature of Dynamic Source Routing (DSR) by adding the accumulated route, back to the source, to the Route Request packet. It retains the destination sequence number feature of AODV but HELLO packets are an optional feature and are normally left... than the inbound traffic as the routing algorithm makes a decision to rebroadcast the packet or not and Figure 20 confirms this. DYMO shows the least amount of routing traffic due to its lack of HELLO packets. This is also due to no further...

Acute coronary syndrome on Friday the 13th: a case for re-organising services?

Science.gov (United States)

Protty, Majd B; Jaafar, Mustafa; Hannoodee, Sahar; Freeman, Phillip

2016-12-12

Friday the 13th is described as an "unlucky" day that brings misfortune. There are few studies on the question, and none on its effect in cardiovascular patients. The recently misreported "weekend effect" has led to changes in the junior doctor contract in England, providing greater staffing levels on weekends. Should we make similar provisions for Friday the 13th? A retrospective analysis of a large database for patients admitted to hospitals in South Wales with an acute coronary syndrome (ACS) during 1999-2014. Mortality rates for 217 admission day number/name combinations and for Friday the 13th were compared in a Cox proportional hazards regression model. 56 062 ACS patients were identified. There were no significant differences in 13-year mortality between most admission dates (211 of 216) and Friday the 13th. However, a statistically significant reduction in mortality was identified for five dates: Thursday the 15th (HR, 0.77; 95% CI, 0.59-0.999), Wednesday the 18th (HR, 0.76; 95% CI, 0.58-0.99), Monday the 28th (HR, 0.76; 95% CI, 0.57-0.99), Monday the 30th (HR, 0.75; 95% CI, 0.57-0.99) and Tuesday the 31st (HR, 0.71; 95% CI, 0.51-0.99). On most days, there was no difference in the 13-year mortality rate for patients admitted with their first ACS from that for "unlucky" Friday the 13th. However, patients admitted on five day/number combinations were 20-30% more likely to survive at 13 years. These findings could be explained by subgroup analysis inflation of the type I error, although supernatural causes merit further investigation. Our findings should be taken into account in future junior doctor contract negotiations, and may provide a case for reduced staffing levels on these lucky days.

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.

A fully distributed geo-routing scheme for wireless sensor networks

KAUST Repository

Bader, Ahmed; Abed-Meraim, Karim; Alouini, Mohamed-Slim

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

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.

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

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.

Routing architecture and security for airborne networks

Science.gov (United States)

Deng, Hongmei; Xie, Peng; Li, Jason; Xu, Roger; Levy, Renato

2009-05-01

Airborne networks are envisioned to provide interconnectivity for terrestial and space networks by interconnecting highly mobile airborne platforms. A number of military applications are expected to be used by the operator, and all these applications require proper routing security support to establish correct route between communicating platforms in a timely manner. As airborne networks somewhat different from traditional wired and wireless networks (e.g., Internet, LAN, WLAN, MANET, etc), security aspects valid in these networks are not fully applicable to airborne networks. Designing an efficient security scheme to protect airborne networks is confronted with new requirements. In this paper, we first identify a candidate routing architecture, which works as an underlying structure for our proposed security scheme. And then we investigate the vulnerabilities and attack models against routing protocols in airborne networks. Based on these studies, we propose an integrated security solution to address routing security issues in airborne networks.

Realization of Intelligent Household Appliance Wireless Monitoring Network Based on LEACH Protocol

Directory of Open Access Journals (Sweden)

Weilong ZHOU

2014-06-01

Full Text Available The intelligent household appliance wireless monitoring network can real-time monitor the apparent power and power factor of various household appliances in different indoor regions, and can realize the real-time monitoring on the household appliance working status and performance. The household appliance wireless monitoring network based on LEACH protocol is designed in the paper. Firstly, the basic idea of LEACH routing algorithm is proposed. Aiming at the node-distribution feature of intelligent home, the selection of cluster head in the routing algorithm and the data transmission method at the stable communication phase is modified. Moreover, the hardware circuit of power acquisition and power factor measurement is designed. The realization of wireless monitoring network based on CC2530 is described, each module and the whole system were conducted the on-line debugging. Finally, the system is proved to meet the practical requirement through the networking test.

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.

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

Performance Analysis of Routing Protocols in Ad-hoc and Sensor Networking Environments

Directory of Open Access Journals (Sweden)

L. Gavrilovska

2009-06-01

Full Text Available Ad-hoc and sensor networks are becoming an increasingly popular wireless networking concepts lately. This paper analyzes and compares prominent routing schemes in these networking environments. The knowledge obtained can serve users to better understand short range wireless network solutions thus leading to options for implementation in various scenarios. In addition, it should aid researchers develop protocol improvements reliable for the technologies of interest.

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.

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

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…

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

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.

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.

Security Issues in Healthcare Applications Using Wireless Medical Sensor Networks: A Survey

OpenAIRE

Hoon-Jae Lee; Pardeep Kumar

2011-01-01

Healthcare applications are considered as promising fields for wireless sensor networks, where patients can be monitored using wireless medical sensor networks (WMSNs). Current WMSN healthcare research trends focus on patient reliable communication, patient mobility, and energy-efficient routing, as a few examples. However, deploying new technologies in healthcare applications without considering security makes patient privacy vulnerable. Moreover, the physiological data of an individual are ...

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.

Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast

NARCIS (Netherlands)

Goseling, J.; Matsumoto, R.; Uyematsu, T.; Weber, J.H.

2010-01-01

We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding

Lower bounds on the maximum energy benefit of network coding for wireless multiple unicast

NARCIS (Netherlands)

Goseling, Jasper; Matsumoto, Ryutaroh; Uyematsu, Tomohiko; Weber, Jos H.

2010-01-01

We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding

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.

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

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.

Improving the Reliability of Optimised Link State Routing in a Smart Grid Neighbour Area Network based Wireless Mesh Network Using Multiple Metrics

Directory of Open Access Journals (Sweden)

Yakubu Tsado

2017-02-01

Full Text Available Reliable communication is the backbone of advanced metering infrastructure (AMI. Within the AMI, the neighbourhood area network (NAN transports a multitude of traffic, each with unique requirements. In order to deliver an acceptable level of reliability and latency, the underlying network, such as the wireless mesh network(WMN, must provide or guarantee the quality-of-service (QoS level required by the respective application traffic. Existing WMN routing protocols, such as optimised link state routing (OLSR, typically utilise a single metric and do not consider the requirements of individual traffic; hence, packets are delivered on a best-effort basis. This paper presents a QoS-aware WMN routing technique that employs multiple metrics in OLSR optimal path selection for AMI applications. The problems arising from this approach are non deterministic polynomial time (NP-complete in nature, which were solved through the combined use of the analytical hierarchy process (AHP algorithm and pruning techniques. For smart meters transmitting Internet Protocol (IP packets of varying sizes at different intervals, the proposed technique considers the constraints of NAN and the applications’ traffic characteristics. The technique was developed by combining multiple OLSR path selection metrics with the AHP algorithminns-2. Compared with the conventional link metric in OLSR, the results show improvements of about 23% and 45% in latency and Packet Delivery Ratio (PDR, respectively, in a 25-node grid NAN.

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

Robust Forecasting for Energy Efficiency of Wireless Multimedia Sensor Networks.

Science.gov (United States)

Wang, Xue; Ma, Jun-Jie; Ding, Liang; Bi, Dao-Wei

2007-11-15

An important criterion of wireless sensor network is the energy efficiency inspecified applications. In this wireless multimedia sensor network, the observations arederived from acoustic sensors. Focused on the energy problem of target tracking, this paperproposes a robust forecasting method to enhance the energy efficiency of wirelessmultimedia sensor networks. Target motion information is acquired by acoustic sensornodes while a distributed network with honeycomb configuration is constructed. Thereby,target localization is performed by multiple sensor nodes collaboratively through acousticsignal processing. A novel method, combining autoregressive moving average (ARMA)model and radial basis function networks (RBFNs), is exploited to perform robust targetposition forecasting during target tracking. Then sensor nodes around the target areawakened according to the forecasted target position. With committee decision of sensornodes, target localization is performed in a distributed manner and the uncertainty ofdetection is reduced. Moreover, a sensor-to-observer routing approach of the honeycombmesh network is investigated to solve the data reporting considering the residual energy ofsensor nodes. Target localization and forecasting are implemented in experiments.Meanwhile, sensor node awakening and dynamic routing are evaluated. Experimentalresults verify that energy efficiency of wireless multimedia sensor network is enhanced bythe proposed target tracking method.

Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed; Ho, Pin-Han; Naik, K.; Shihada, Basem

2013-01-01

This paper introduces a novel multicopy routing protocol, called Self-Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized by the ability of identifying potential opportunities for forwarding messages to their destinations via a novel utility function-based mechanism, in which a suite of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are jointly considered. Thus, SAURP can reroute messages around nodes experiencing high-buffer occupancy, wireless interference, and/or congestion, while taking a considerably small number of transmissions. The developed utility function in SAURP is proved to be able to achieve optimal performance, which is further analyzed via a stochastic modeling approach. Extensive simulations are conducted to verify the developed analytical model and compare the proposed SAURP with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions required for each message delivery. The simulation results show that SAURP outperforms all the counterpart multicopy encounter-based routing protocols considered in the study.

Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed

2013-07-01

This paper introduces a novel multicopy routing protocol, called Self-Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized by the ability of identifying potential opportunities for forwarding messages to their destinations via a novel utility function-based mechanism, in which a suite of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are jointly considered. Thus, SAURP can reroute messages around nodes experiencing high-buffer occupancy, wireless interference, and/or congestion, while taking a considerably small number of transmissions. The developed utility function in SAURP is proved to be able to achieve optimal performance, which is further analyzed via a stochastic modeling approach. Extensive simulations are conducted to verify the developed analytical model and compare the proposed SAURP with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions required for each message delivery. The simulation results show that SAURP outperforms all the counterpart multicopy encounter-based routing protocols considered in the study.

A Smart Collaborative Routing Protocol for Reliable Data Diffusion in IoT Scenarios.

Science.gov (United States)

Ai, Zheng-Yang; Zhou, Yu-Tong; Song, Fei

2018-06-13

It is knotty for current routing protocols to meet the needs of reliable data diffusion during the Internet of Things (IoT) deployments. Due to the random placement, limited resources and unattended features of existing sensor nodes, the wireless transmissions are easily exposed to unauthorized users, which becomes a vulnerable area for various malicious attacks, such as wormhole and Sybil attacks. However, the scheme based on geographic location is a suitable candidate to defend against them. This paper is inspired to propose a smart collaborative routing protocol, Geographic energy aware routing and Inspecting Node (GIN), for guaranteeing the reliability of data exchanging. The proposed protocol integrates the directed diffusion routing, Greedy Perimeter Stateless Routing (GPSR), and the inspecting node mechanism. We first discuss current wireless routing protocols from three diverse perspectives (improving transmission rate, shortening transmission range and reducing transmission consumption). Then, the details of GIN, including the model establishment and implementation processes, are presented by means of the theoretical analysis. Through leveraging the game theory, the inspecting node is elected to monitor the network behaviors. Thirdly, we evaluate the network performances, in terms of transmission delay, packet loss ratio, and throughput, between GIN and three traditional schemes (i.e., Flooding, GPSR, and GEAR). The simulation results illustrate that the proposed protocol is able to outperform the others.

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.

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.

Weighted-DESYNC and Its Application to End-to-End Throughput Fairness in Wireless Multihop Network

Directory of Open Access Journals (Sweden)

Ui-Seong Yu

2017-01-01

Full Text Available The end-to-end throughput of a routing path in wireless multihop network is restricted by a bottleneck node that has the smallest bandwidth among the nodes on the routing path. In this study, we propose a method for resolving the bottleneck-node problem in multihop networks, which is based on multihop DESYNC (MH-DESYNC algorithm that is a bioinspired resource allocation method developed for use in multihop environments and enables fair resource allocation among nearby (up to two hops neighbors. Based on MH-DESYNC, we newly propose weighted-DESYNC (W-DESYNC as a tool artificially to control the amount of resource allocated to the specific user and thus to achieve throughput fairness over a routing path. Proposed W-DESYNC employs the weight factor of a link to determine the amount of bandwidth allocated to a node. By letting the weight factor be the link quality of a routing path and making it the same across a routing path via Cucker-Smale flocking model, we can obtain throughput fairness over a routing path. The simulation results show that the proposed algorithm achieves throughput fairness over a routing path and can increase total end-to-end throughput in wireless multihop networks.

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.

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.

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

DEFF Research Database (Denmark)

Meybodi, Soroush Afkhami

2012-01-01

This dissertation reports the result of efforts to identify and solve the problems that arise when a control system is to be designed for various industrial case studies of the Plug and Play Process Control (P3C) project that require autonomous addition/removal of sensors, actuators and subsystems...... in only one of the P3C case studies where all of the nodes of the wireless networked control system are placed underground and should be able to transmit data among themselves. It is not a trivial problem because the well known radio frequency electromagnetic waves face serious difficulties penetrating...... 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...

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.

Prediction-based Dynamic Energy Management in Wireless Sensor Networks

Science.gov (United States)

Wang, Xue; Ma, Jun-Jie; Wang, Sheng; Bi, Dao-Wei

2007-01-01

Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.

Prediction-based Dynamic Energy Management in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Dao-Wei Bi

2007-03-01

Full Text Available Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.

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.

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

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.

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

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

Indian Academy of Sciences (India)

SOUMITRA DAS

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

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.

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.

SURVEY OF ENERGY COMPETENCE ROUTING PROTOCOL IN UTILIZING AODV IN MANETS (20150471)

OpenAIRE

TUSHAR SINGH RAJPUT; RAJ KUMAR PAUL

2018-01-01

In MANETs (Mobile unintentional Networks) communication at the mobile nodes will be achieved by mistreatment multihop wireless links. The aim of every protocol, in Associate in Nursing ad-hoc network, is to seek out valid routes between 2 communication nodes.

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

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.

Promoting Wired Links in Wireless Mesh Networks: An Efficient Engineering Solution

Science.gov (United States)

Barekatain, Behrang; Raahemifar, Kaamran; Ariza Quintana, Alfonso; Triviño Cabrera, Alicia

2015-01-01

Wireless Mesh Networks (WMNs) cannot completely guarantee good performance of traffic sources such as video streaming. To improve the network performance, this study proposes an efficient engineering solution named Wireless-to-Ethernet-Mesh-Portal-Passageway (WEMPP) that allows effective use of wired communication in WMNs. WEMPP permits transmitting data through wired and stable paths even when the destination is in the same network as the source (Intra-traffic). Tested with four popular routing protocols (Optimized Link State Routing or OLSR as a proactive protocol, Dynamic MANET On-demand or DYMO as a reactive protocol, DYMO with spanning tree ability and HWMP), WEMPP considerably decreases the end-to-end delay, jitter, contentions and interferences on nodes, even when the network size or density varies. WEMPP is also cost-effective and increases the network throughput. Moreover, in contrast to solutions proposed by previous studies, WEMPP is easily implemented by modifying the firmware of the actual Ethernet hardware without altering the routing protocols and/or the functionality of the IP/MAC/Upper layers. In fact, there is no need for modifying the functionalities of other mesh components in order to work with WEMPPs. The results of this study show that WEMPP significantly increases the performance of all routing protocols, thus leading to better video quality on nodes. PMID:25793516

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.

Design and Analysis of QoS Routing Framework integrated with OLSR protocol for Multimedia Traffic in Mobile Adhoc Networks

Directory of Open Access Journals (Sweden)

S. Soni

2017-06-01

Full Text Available MANETs (Mobile Ad-hoc Networks is the self organizing wireless structure of mobile hosts. Wireless media is used for communication in MANETs. Considering the developing requirements for multimedia and real-time traffic applications in real world, QoS (Quality-of-Service support is essential in MANETs. But most of the characteristics of MANETs make QoS support a difficult problem. It is challenging to support QoS routing in MANET due to dynamic behavior and mobility of the hosts. The OLSR (Optimized Link State Routing protocol can be efficiently used in MANETs to provide QoS routing because of its dynamic MPR (Multi Point Relay selection criteria and proactive nature. In this paper, a design of QoS routing framework integrated with OLSR protocol is proposed and also analyzed using network simulator. Proposed QoS framework combines a bandwidth estimation algorithm with explicit resource reservation, QoS routing and connection admission control (CAC. OLSR protocol is extended for QoS framework to solve performance issues related to node mobility using cross layer approach. Results after simulation conclude about efficiency of the proposed QoS routing framework.

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)

Intelligent Stale-Frame Discards for Real-Time Video Streaming over Wireless Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Sheu Tsang-Ling

2009-01-01

Full Text Available Abstract This paper presents intelligent early packet discards (I-EPD for real-time video streaming over a multihop wireless ad hoc network. In a multihop wireless ad hoc network, the quality of transferring real-time video streams could be seriously degraded, since every intermediate node (IN functionally like relay device does not possess large buffer and sufficient bandwidth. Even worse, a selected relay node could leave or power off unexpectedly, which breaks the route to destination. Thus, a stale video frame is useless even if it can reach destination after network traffic becomes smooth or failed route is reconfigured. In the proposed I-EPD, an IN can intelligently determine whether a buffered video packet should be early discarded. For the purpose of validation, we implement the I-EPD on Linux-based embedded systems. Via the comparisons of performance metrics (packet/frame discards ratios, PSNR, etc., we demonstrate that video quality over a wireless ad hoc network can be substantially improved and unnecessary bandwidth wastage is greatly reduced.

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.

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.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

Science.gov (United States)

Bai, Weigang; Wang, Haiyan; He, Ke; Zhao, Ruiqin

2018-04-23

The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS) and position random candidates selection (PRCS). PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

Directory of Open Access Journals (Sweden)

Weigang Bai

2018-04-01

Full Text Available The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS and position random candidates selection (PRCS. PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

Vibrant Energy Aware Spray and Wait Routing in Delay Tolerant Network

Directory of Open Access Journals (Sweden)

Viren G. Patel

2013-01-01

Full Text Available Delay tolerant networks (DTN are wireless networks where disconnections arise often due to the mobility of nodes, failures of energy, the low density of nodes, or when the network extends over long distances. In these situations, traditional routing protocols that have been developed for mobile ad hoc networks prove to be unsuccessful to the scope of transmitting messages between nodes. The Spray and Wait routing may achieve low routing and energy efficiency due to the blindness in the spray phase. To deal with this situation, we propose an opportunistic routing with enclosed message copies, called the Vibrant Energy aware Spray and Wait (VESW, which utilizes the information about vibrancy of node and remaining energy to allocate the number of copies between the corresponding pair nodes in the spray phase.

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.

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

Implementing the Internet of Things vision in industrial wireless sensor networks

CSIR Research Space (South Africa)

Kruger, CP

2014-07-01

Full Text Available The authors of this paper explore the use of IPv6 over Low power Wireless Personal Area Networks (6LoWPAN), IPv6 Routing Protocol for Low power and Lossy Networks (RPL) and Constrained Application Protocol (CoAP) as a possible solution for realising...

Improving the Dominating-Set Routing over Delay-Tolerant Mobile Ad-Hoc Networks via Estimating Node Intermeeting Times

Directory of Open Access Journals (Sweden)

Preiss Bruno

2011-01-01

Full Text Available With limited coverage of wireless networks and frequent roaming of mobile users, providing a seamless communication service poses a technical challenge. In our previous research, we presented a supernode system architecture that employs the delay-tolerant network (DTN concept to provide seamless communications for roaming users over interconnected heterogeneous wireless networks. Mobile ad hoc networks (MANETs are considered a key component of the supernode system for services over an area not covered by other wireless networks. Within the super node system, a dominating-set routing technique is proposed to improve message delivery over MANETs and to achieve better resource utilization. The performance of the dominating-set routing technique depends on estimation accuracy of the probability of a future contact between nodes. This paper studies how node mobility can be modeled and used to better estimate the probability of a contact. We derive a distribution for the node-to-node intermeeting time and present numerical results to demonstrate that the distribution can be used to improve the dominating-set routing technique performance. Moreover, we investigate how the distribution can be employed to relax the constraints of selecting the dominating-set members in order to improve the system resource utilization.

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

MANETS and Internet of Things: The Development of a Data Routing Algorithm

Directory of Open Access Journals (Sweden)

I. A. Alameri

2018-02-01

Full Text Available Internet of things (IoT, is an innovative technology which allows the connection of physical things with the digital world through the use of heterogeneous networks and communication technologies. IoT in smart environments interacts with wireless sensor network (WSN and mobile ad‐hoc network (MANET, becoming even more attractive and economically successful. Interaction between wireless sensor and mobile ad‐hoc networks with the internet of things allows the creation of a new MANET‐IoT systems and IT‐based networks. Such systems give the user greater mobility and reduce costs. At the same time new challenging issues are opened in networking aspects. In this work, author proposed a routing solution for the IoT system using a combination of MANET protocols and WSN routing principles. The presented results of solution's investigation provide an effective approach to efficient energy consumption in the global MANET‐IoT system. That is a step forward to a reliable provision of services over global future internet infrastructure.

CONGESTION CONTROL IMPROVED QoS ROUTING SCHEME FOR WIRELESS SENSOR NETWORK

OpenAIRE

A. Elakkiya*, B. Santhana Krishnan, Dr. M. Ramaswamy

2016-01-01

Wireless sensor network is distributed self-governing sensors used to monitor the physical conditions of the environment. They are constructed by nodes where each of them is connected to sensors. These sensor nodes acquire real time information and transmit the information. When large number of sensor nodes are active in transmitting the information there is a possibility of congestion in the data packets. Congestion occurs due to buffer overflow, channel contention, packet collision, reporti...

Optimized Charging Scheduling with Single Mobile Charger for Wireless Rechargeable Sensor Networks

Directory of Open Access Journals (Sweden)

Qihua Wang

2017-11-01

Full Text Available Due to the rapid development of wireless charging technology, the recharging issue in wireless rechargeable sensor network (WRSN has been a popular research problem in the past few years. The weakness of previous work is that charging route planning is not reasonable. In this work, a dynamic optimal scheduling scheme aiming to maximize the vacation time ratio of a single mobile changer for WRSN is proposed. In the proposed scheme, the wireless sensor network is divided into several sub-networks according to the initial topology of deployed sensor networks. After comprehensive analysis of energy states, working state and constraints for different sensor nodes in WRSN, we transform the optimized charging path problem of the whole network into the local optimization problem of the sub networks. The optimized charging path with respect to dynamic network topology in each sub-network is obtained by solving an optimization problem, and the lifetime of the deployed wireless sensor network can be prolonged. Simulation results show that the proposed scheme has good and reliable performance for a small wireless rechargeable sensor network.

Energy-efficient Organization of Wireless Sensor Networks with Adaptive Forecasting

Directory of Open Access Journals (Sweden)

Dao-Wei Bi

2008-04-01

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

A Joint Link and Channel Assignment Routing Scheme for Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

H.S.Zhao

2013-12-01

Full Text Available Cognitive radio (CR is a promising technology that enables opportunistic utilization of the temporarily vacant spectrum to mitigate the spectrum scarcity in wireless communications. Since secondary users (SUs should vacate the channel in use immediately after detecting the reappearances of primary users (PUs in cognitive radio networks (CRNs, the route reliability is a distinctive challenge for routing in CRNs. Furthermore, the throughput requirement of an SU session should be satisfied and it is always preferable to select a route with less negative influence on other current or latish sessions. To account for the route reliability challenge, we study the joint link and channel assignment routing problem for CRNs. It is formulated in a form of integer nonlinear programming (INLP, which is NP-hard, with the objective of minimizing the interference of a new route to other routes while providing route reliability and throughput guarantee. An on-demand route discovery algorithm is proposed to find reliable candidate paths, while a joint link and channel assignment routing algorithm with sequentially-connected-link coordination is proposed to choose the near-optimal route for improving the route reliability and minimizing negative influence. Simulation results demonstrate that the proposed algorithm achieves considerable improvement over existing schemes in both route reliability and throughput.

Underwater Optical Wireless Communications, Networking, and Localization: A Survey

KAUST Repository

Saeed, Nasir; Celik, Abdulkadir; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

2018-01-01

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.

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.

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.

Research on Electronic-nose Application Based on Wireless Sensor Networks

International Nuclear Information System (INIS)

Zhao, A; Wang, L; Yao, C H

2006-01-01

The paper proposed a structure of Wireless Sensor Networks based Electronic-nose system to monitors air quality in the building. In the study, the authors researched a data processing algorithm: fuzzy neural network based on RBF(Radial Basis Function) network model, to quantitatively analyze the gas ingredient and put forward a routing protocol for the system

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.

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.

A Link Quality and Geographical-aware Routing Protocol for Video Transmission in Mobile IoT

OpenAIRE

Rosário, Denis; Zhao, Zhongliang; Cerqueira, Eduardo; Braun, Torsten; Santos, Aldri

2013-01-01

Wireless mobile sensor networks are enlarging the Internet of Things (IoT) portfolio with a huge number of multimedia services for smart cities. Safety and environmental monitoring multimedia applications will be part of the Smart IoT systems, which aim to reduce emergency response time, while also predicting hazardous events. In these mobile and dynamic (possible disaster) scenarios, opportunistic routing allows routing decisions in a completely distributed manner, by using a hop- by-hop rou...

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.

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.

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

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

African Journals Online (AJOL)

PROF. O. E. OSUAGWU

2013-09-01

Sep 1, 2013 ... improved Ant System and their application in WSN routing process. The simulation results show ... and Mobile ad-hoc networks (MANETs) are inappropriate for ... Dorigo in 1992 in his PhD thesis, the first algorithm was aiming ...

DRDT: distributed and reliable data transmission with cooperative nodes for lossy wireless sensor networks.

Science.gov (United States)

Seo, Jaewan; Kim, Moonseong; Hur, In; Choi, Wook; Choo, Hyunseung

2010-01-01

Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT) scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.

DRDT: Distributed and Reliable Data Transmission with Cooperative Nodes for LossyWireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jaewan Seo

2010-03-01

Full Text Available Recent studies have shown that in realistic wireless sensor network environments links are extremely unreliable. To recover from corrupted packets, most routing schemes with an assumption of ideal radio environments use a retransmission mechanism, which may cause unnecessary retransmissions. Therefore, guaranteeing energy-efficient reliable data transmission is a fundamental routing issue in wireless sensor networks. However, it is not encouraged to propose a new reliable routing scheme in the sense that every existing routing scheme cannot be replaced with the new one. This paper proposes a Distributed and Reliable Data Transmission (DRDT scheme with a goal to efficiently guarantee reliable data transmission. In particular, this is based on a pluggable modular approach so that it can be extended to existing routing schemes. DRDT offers reliable data transmission using neighbor nodes, i.e., helper nodes. A helper node is selected among the neighbor nodes of the receiver node which overhear the data packet in a distributed manner. DRDT effectively reduces the number of retransmissions by delegating the retransmission task from the sender node to the helper node that has higher link quality to the receiver node when the data packet reception fails due to the low link quality between the sender and the receiver nodes. Comprehensive simulation results show that DRDT improves end-to-end transmission cost by up to about 45% and reduces its delay by about 40% compared to existing schemes.

Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach

Directory of Open Access Journals (Sweden)

Sungwook Kim

2014-01-01

Full Text Available Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.

Resilient Disaster Network Based on Software Defined Cognitive Wireless Network Technology

Directory of Open Access Journals (Sweden)

Goshi Sato

2015-01-01

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

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.

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.

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.

On the Feasibility of Wireless Multimedia Sensor Networks over IEEE 802.15.5 Mesh Topologies.

Science.gov (United States)

Garcia-Sanchez, Antonio-Javier; Losilla, Fernando; Rodenas-Herraiz, David; Cruz-Martinez, Felipe; Garcia-Sanchez, Felipe

2016-05-05

Wireless Multimedia Sensor Networks (WMSNs) are a special type of Wireless Sensor Network (WSN) where large amounts of multimedia data are transmitted over networks composed of low power devices. Hierarchical routing protocols typically used in WSNs for multi-path communication tend to overload nodes located within radio communication range of the data collection unit or data sink. The battery life of these nodes is therefore reduced considerably, requiring frequent battery replacement work to extend the operational life of the WSN system. In a wireless sensor network with mesh topology, any node may act as a forwarder node, thereby enabling multiple routing paths toward any other node or collection unit. In addition, mesh topologies have proven advantages, such as data transmission reliability, network robustness against node failures, and potential reduction in energy consumption. This work studies the feasibility of implementing WMSNs in mesh topologies and their limitations by means of exhaustive computer simulation experiments. To this end, a module developed for the Synchronous Energy Saving (SES) mode of the IEEE 802.15.5 mesh standard has been integrated with multimedia tools to thoroughly test video sequences encoded using H.264 in mesh networks.

On the Feasibility of Wireless Multimedia Sensor Networks over IEEE 802.15.5 Mesh Topologies

Directory of Open Access Journals (Sweden)

Antonio-Javier Garcia-Sanchez

2016-05-01

Full Text Available Wireless Multimedia Sensor Networks (WMSNs are a special type of Wireless Sensor Network (WSN where large amounts of multimedia data are transmitted over networks composed of low power devices. Hierarchical routing protocols typically used in WSNs for multi-path communication tend to overload nodes located within radio communication range of the data collection unit or data sink. The battery life of these nodes is therefore reduced considerably, requiring frequent battery replacement work to extend the operational life of the WSN system. In a wireless sensor network with mesh topology, any node may act as a forwarder node, thereby enabling multiple routing paths toward any other node or collection unit. In addition, mesh topologies have proven advantages, such as data transmission reliability, network robustness against node failures, and potential reduction in energy consumption. This work studies the feasibility of implementing WMSNs in mesh topologies and their limitations by means of exhaustive computer simulation experiments. To this end, a module developed for the Synchronous Energy Saving (SES mode of the IEEE 802.15.5 mesh standard has been integrated with multimedia tools to thoroughly test video sequences encoded using H.264 in mesh networks.

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

DRUG: An Energy-Efficient Data-Centric Routing Protocol for Wireless Sensor Networks

OpenAIRE

Sahoo, B. P. S.; Puthal, Deepak

2014-01-01

In general, sensor nodes are deployed in left unattended area. In such situation feeding energy to the batteries or replacing the batteries is difficult or even sometimes impossible too. Therefore, prolonging the network lifetime is an important optimization goal in this aspect. In this paper, we propose a new Energy-efficient Datacentric RoUtinG protocol called DRUG. In this paper, we propose an adaptive Data centric approach to find an optimal routing path from source to sink when the senso...

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.

Contention Aware Routing for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed; Ho, Pin Han; Naik, Sagar; Shihada, Basem

2011-01-01

This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

Contention Aware Routing for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed

2011-08-21

This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

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 characteriz...... and accumulates the routes of a user along with their usage patterns and that makes the routes available to services. Experiences from using the component on logs of GPS positions acquired from vehicles traveling within a real road network are reported....... by a small screen and no keyboard, and by the service being only a secondary focus of the user. Under such circumstances, it is 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...

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

Directory of Open Access Journals (Sweden)

Lin Zhang

2017-03-01

Full Text Available 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. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR. This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service.

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

Science.gov (United States)

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

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. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service. PMID:28282894

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.

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

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.

Secure energy efficient routing protocol for wireless sensor network

OpenAIRE

Das Ayan Kumar; Chaki Rituparna; Dey Kashi Nath

2016-01-01

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

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 to the source, to the Route Request packet. It retains the destination sequence number feature of AODV but HELLO packets are an optional feature and are normally left out by default. It also does away with the gratuitous RREP feature of AODV. Routing... spiral algorithm makes a decision to rebroadcast the packet or not and Fig. 5. confirms this. DYMO shows the least amount of routing traffic due to its lack of HELLO packets. This is also due to no further routing packets being transmitted once...

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

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

Directory of Open Access Journals (Sweden)

Xujing Li

2018-04-01

Full Text Available 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

RFID-WSN integrated architecture for energy and delay- aware routing a simulation approach

CERN Document Server

Ahmed, Jameel; Tayyab, Muhammad; Nawaz, Menaa

2015-01-01

The book identifies the performance challenges concerning Wireless Sensor Networks (WSN) and Radio Frequency Identification (RFID) and analyzes their impact on the performance of routing protocols. It presents a thorough literature survey to identify the issues affecting routing protocol performance, as well as a mathematical model for calculating the end-to-end delays of the routing protocol ACQUIRE; a comparison of two routing protocols (ACQUIRE and DIRECTED DIFFUSION) is also provided for evaluation purposes. On the basis of the results and literature review, recommendations are made for better selection of protocols regarding the nature of the respective application and related challenges. In addition, this book covers a proposed simulator that integrates both RFID and WSN technologies. Therefore, the manuscript is divided in two major parts: an integrated architecture of smart nodes, and a power-optimized protocol for query and information interchange.

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.

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.

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.

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

In Vivo Self-Powered Wireless Cardiac Monitoring via Implantable Triboelectric Nanogenerator.

Science.gov (United States)

Zheng, Qiang; Zhang, Hao; Shi, Bojing; Xue, Xiang; Liu, Zhuo; Jin, Yiming; Ma, Ye; Zou, Yang; Wang, Xinxin; An, Zhao; Tang, Wei; Zhang, Wei; Yang, Fan; Liu, Yang; Lang, Xilong; Xu, Zhiyun; Li, Zhou; Wang, Zhong Lin

2016-07-26

Harvesting biomechanical energy in vivo is an important route in obtaining sustainable electric energy for powering implantable medical devices. Here, we demonstrate an innovative implantable triboelectric nanogenerator (iTENG) for in vivo biomechanical energy harvesting. Driven by the heartbeat of adult swine, the output voltage and the corresponding current were improved by factors of 3.5 and 25, respectively, compared with the reported in vivo output performance of biomechanical energy conversion devices. In addition, the in vivo evaluation of the iTENG was demonstrated for over 72 h of implantation, during which the iTENG generated electricity continuously in the active animal. Due to its excellent in vivo performance, a self-powered wireless transmission system was fabricated for real-time wireless cardiac monitoring. Given its outstanding in vivo output and stability, iTENG can be applied not only to power implantable medical devices but also possibly to fabricate a self-powered, wireless healthcare monitoring system.

Equalized Energy Consumption in Wireless Body Area Networks for a Prolonged Network Lifetime

Directory of Open Access Journals (Sweden)

Maryam El Azhari

2017-01-01

Full Text Available The phenomenal advances in electronics contributed to a widespread use of distributed sensors in wireless communications. A set of biosensors can be deployed or implanted in the human body to form a Wireless Body Area Network (WBAN, where various WBAN PHY layers are utilized. The WBAN allows the measurement of physiological data, which is forwarded by the gateway to the base station for analysis purposes. The main issue in conceiving a WBAN communication mechanism is to manage the residual energy of sensors. The mobile agent system has been widely applied for surveillance applications in Wireless Sensor Networks (WSNs. It consists in dispatching one or more mobile agents simultaneously to collect data, while following a predetermined optimum itinerary. The continuous use of the optimal itinerary leads to a rapid depletion of sensor nodes batteries, which minimizes the network lifetime. This paper presents a new algorithm to equalize the energy consumption among sensor motes. The algorithm exploits all the available paths towards the destination and classifies them with respect to the end-to-end delay and the overall energy consumption. The proposed algorithm performs better compared to the optimal routing path. It increases the network lifetime to the maximum by postponing routing of data via the most-recently used path, and it also maintains data delivery within the delay interval threshold.

The Impact of Wireless Technology on Loading Trucks at an Auto Parts Distribution Center

Science.gov (United States)

Goomas, David T.

2012-01-01

An intervention was introduced for truck loaders that used wireless vehicle mount computers that included auditory, visual feedback, and immediate data delivery. The implementation reliably reduced pallets from being loaded out of sequence for all outbound trucks in multistop routes. The role of the organizational behavior management (OBM)…

A Wireless Monitoring System for Cracks on the Surface of Reactor Containment Buildings.

Science.gov (United States)

Zhou, Jianguo; Xu, Yaming; Zhang, Tao

2016-06-14

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.

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.

Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast

Directory of Open Access Journals (Sweden)

Matsumoto Ryutaroh

2010-01-01

Full Text Available We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding solutions, where the maximum is over all configurations. It is shown that if coding and routing solutions are using the same transmission range, the benefit in d-dimensional networks is at least . Moreover, it is shown that if the transmission range can be optimized for routing and coding individually, the benefit in 2-dimensional networks is at least 3. Our results imply that codes following a decode-and-recombine strategy are not always optimal regarding energy efficiency.

CCS-DTN: clustering and network coding-based efficient routing in social DTNs.

Science.gov (United States)

Zhang, Zhenjing; Ma, Maode; Jin, Zhigang

2014-12-25

With the development of mobile Internet, wireless communication via mobile devices has become a hot research topic, which is typically in the form of Delay Tolerant Networks (DTNs). One critical issue in the development of DTNs is routing. Although there is a lot research work addressing routing issues in DTNs, they cannot produce an advanced solution to the comprehensive challenges since only one or two aspects (nodes' movements, clustering, centricity and so on) are considered when the routing problem is handled. In view of these defects in the existing works, we propose a novel solution to address the routing issue in social DTNs. By this solution, mobile nodes are divided into different clusters. The scheme, Spray and Wait, is used for the intra-cluster communication while a new forwarding mechanism is designed for the inter-cluster version. In our solution, the characteristics of nodes and the relation between nodes are fully considered. The simulation results show that our proposed scheme can significantly improve the performance of the routing scheme in social DTNs.

Conference: Brain-ways of Working Together, Friday 15 June at 11 am!

CERN Multimedia

Staff Association

2018-01-01

FRIDAY 15 JUNE AT 11 AM CERN Meyrin, Main Auditorium (500-1-001) Have you heard of Tapping into Collective Intelligence or Reinventing Organizations? They are new ways and philosophies of working together. This conference, led by Jorge Cendales, will discuss the neuro-scientific underpinnings of recent key findings in brain science and their implications on how we think today about effective work cultures for businesses, science and governments. (Conference in English) Find out more and sign up: https://indico.cern.ch/e/brainways

ABORt: Acknowledgement-Based Opportunistic Routing Protocol for High Data Rate Multichannel WSNs

Directory of Open Access Journals (Sweden)

Hamadoun Tall

2017-10-01

Full Text Available The ease of deployment and the auto-configuration capabilities of Wireless Sensor Networks (WSNs make them very attractive in different domains like environmental, home automation or heath care applications. The use of multichannel communications in WSNs helps to improve the overall performance of the network. However, in heavy traffic scenarios, routing protocols should be adapted to allow load balancing and to avoid losing data packets due to congestion and queue overflow. In this paper, we present an Acknowledgement-Based Opportunistic Routing (ABORt protocol designed for high data rate multichannel WSNs. It is a low overhead protocol that does not rely on synchronization for control traffic exchange during the operational phase of the network. ABORt is an opportunistic protocol that relies on link layer acknowledgements to disseminate routing metrics, which helps to reduce overhead. The performance of ABORt is evaluated using the Cooja simulator and the obtained results show that ABORt has a high packet delivery ratio with reduced packet end-to-end delay compared to two single channel routing protocols and two multichannel routing protocols that use number of hops and expected transmission count as routing metrics.

Distributed Topological Convex Hull Estimation of Event Region in Wireless Sensor Networks without Location Information

NARCIS (Netherlands)

Guo, Peng; Cao, Jiannong; Zhang, Kui

2015-01-01

In critical event (e.g., fire or gas) monitoring applications of wireless sensor networks (WSNs), convex hull of the event region is an efficient tool in handling the usual tasks like event report, routes reconstruction and human motion planning. Existing works on estimating convex hull of event

An Adaptive QoS Routing Solution for MANET Based Multimedia Communications in Emergency Cases

Science.gov (United States)

Ramrekha, Tipu Arvind; Politis, Christos

The Mobile Ad hoc Networks (MANET) is a wireless network deprived of any fixed central authoritative routing entity. It relies entirely on collaborating nodes forwarding packets from source to destination. This paper describes the design, implementation and performance evaluation of CHAMELEON, an adaptive Quality of Service (QoS) routing solution, with improved delay and jitter performances, enabling multimedia communication for MANETs in extreme emergency situations such as forest fire and terrorist attacks as defined in the PEACE project. CHAMELEON is designed to adapt its routing behaviour according to the size of a MANET. The reactive Ad Hoc on-Demand Distance Vector Routing (AODV) and proactive Optimized Link State Routing (OLSR) protocols are deemed appropriate for CHAMELEON through their performance evaluation in terms of delay and jitter for different MANET sizes in a building fire emergency scenario. CHAMELEON is then implemented in NS-2 and evaluated similarly. The paper concludes with a summary of findings so far and intended future work.

Contention aware mobility prediction routing for intermittently connected mobile networks

KAUST Repository

Elwhishi, Ahmed; Ho, Pin-Han; Shihada, Basem

2013-01-01

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.

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.

A reliable transmission protocol for ZigBee-based wireless patient monitoring.

Science.gov (United States)

Chen, Shyr-Kuen; Kao, Tsair; Chan, Chia-Tai; Huang, Chih-Ning; Chiang, Chih-Yen; Lai, Chin-Yu; Tung, Tse-Hua; Wang, Pi-Chung

2012-01-01

Patient monitoring systems are gaining their importance as the fast-growing global elderly population increases demands for caretaking. These systems use wireless technologies to transmit vital signs for medical evaluation. In a multihop ZigBee network, the existing systems usually use broadcast or multicast schemes to increase the reliability of signals transmission; however, both the schemes lead to significantly higher network traffic and end-to-end transmission delay. In this paper, we present a reliable transmission protocol based on anycast routing for wireless patient monitoring. Our scheme automatically selects the closest data receiver in an anycast group as a destination to reduce the transmission latency as well as the control overhead. The new protocol also shortens the latency of path recovery by initiating route recovery from the intermediate routers of the original path. On the basis of a reliable transmission scheme, we implement a ZigBee device for fall monitoring, which integrates fall detection, indoor positioning, and ECG monitoring. When the triaxial accelerometer of the device detects a fall, the current position of the patient is transmitted to an emergency center through a ZigBee network. In order to clarify the situation of the fallen patient, 4-s ECG signals are also transmitted. Our transmission scheme ensures the successful transmission of these critical messages. The experimental results show that our scheme is fast and reliable. We also demonstrate that our devices can seamlessly integrate with the next generation technology of wireless wide area network, worldwide interoperability for microwave access, to achieve real-time patient monitoring.

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)

Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

Science.gov (United States)

Song, W.-Z.; Yuan, F.; LaHusen, R.; Shirazi, B.

2007-01-01

This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted], N(u0)-1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.

Quality-of-Service Routing Using Path and Power Aware Techniques in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

R. Asokan

2008-01-01

Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile hosts dynamically forming a temporary network without the aid of any existing established infrastructure. Quality of service (QoS is a set of service requirements that needs to be met by the network while transporting a packet stream from a source to its destination. QoS support MANETs is a challenging task due to the dynamic topology and limited resources. The main objective of this paper is to enhance the QoS routing for MANET using temporally ordered routing algorithm (TORA with self-healing and optimized routing techniques (SHORT. SHORT improves routing optimality by monitoring routing paths continuously and redirecting the path whenever a shortcut path is available. In this paper, the performance comparison of TORA and TORA with SHORT has been analyzed using network simulator for various parameters. TORA with SHORT enhances performance of TORA in terms of throughput, packet loss, end-to-end delay, and energy.

Ensuring Data Storage Security in Tree cast Routing Architecture for Sensor Networks

Science.gov (United States)

Kumar, K. E. Naresh; Sagar, U. Vidya; Waheed, Mohd. Abdul

2010-10-01

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 contrast to traditional solutions, where the IT services are under proper physical, logical and personnel controls, this routing architecture moves the application software and databases to the large data centers, where the management of the data and services may not be fully trustworthy. This unique attribute, however, poses many new security challenges which have not been well understood. In this paper, we focus on data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users' data in this architecture, we propose an effective and flexible distributed scheme with two salient features, opposing to its predecessors. By utilizing the homomorphic token with distributed verification of erasure-coded data, our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server(s). Unlike most prior works, the new scheme further supports secure and efficient dynamic operations on data blocks, including: data update, delete and append. Extensive security and performance analysis shows that the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server

Distributed Fault-Tolerant Quality Of Service Routing in Hybrid Directional Wireless Networks

National Research Council Canada - National Science Library

Llewellyn, II, Larry C

2007-01-01

This thesis presents a distributed fault-tolerant routing protocol (EFDCB) for QoS supporting hybrid mobile ad hoc networks with the aim of mitigating QoS disruption time when network failures occur...

Energy-aware scheduling of surveillance in wireless multimedia sensor networks.

Science.gov (United States)

Wang, Xue; Wang, Sheng; Ma, Junjie; Sun, Xinyao

2010-01-01

Wireless sensor networks involve a large number of sensor nodes with limited energy supply, which impacts the behavior of their application. In wireless multimedia sensor networks, sensor nodes are equipped with audio and visual information collection modules. Multimedia contents are ubiquitously retrieved in surveillance applications. To solve the energy problems during target surveillance with wireless multimedia sensor networks, an energy-aware sensor scheduling method is proposed in this paper. Sensor nodes which acquire acoustic signals are deployed randomly in the sensing fields. Target localization is based on the signal energy feature provided by multiple sensor nodes, employing particle swarm optimization (PSO). During the target surveillance procedure, sensor nodes are adaptively grouped in a totally distributed manner. Specially, the target motion information is extracted by a forecasting algorithm, which is based on the hidden Markov model (HMM). The forecasting results are utilized to awaken sensor node in the vicinity of future target position. According to the two properties, signal energy feature and residual energy, the sensor nodes decide whether to participate in target detection separately with a fuzzy control approach. Meanwhile, the local routing scheme of data transmission towards the observer is discussed. Experimental results demonstrate the efficiency of energy-aware scheduling of surveillance in wireless multimedia sensor network, where significant energy saving is achieved by the sensor awakening approach and data transmission paths are calculated with low computational complexity.

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

Sleep scheduling with expected common coverage in wireless sensor networks

OpenAIRE

Bulut, Eyuphan; Korpeoglu, Ibrahim

2011-01-01

Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor networks. This paper proposes a distributed and energy efficient sleep scheduling and routing scheme that can be used to extend the lifetime of a sensor network while maintaining a user defined coverage and connectivity. The scheme can activate and deactivate the three basic units of a sensor node (sensing, proces...

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

Directory of Open Access Journals (Sweden)

Saoucene Mahfoudh

2009-01-01

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

A telemedicine system for wireless home healthcare based on Bluetooth and the Internet.

Science.gov (United States)

Zhao, Xiaoming; Fei, Ding-Yu; Doarn, Charles R; Harnett, Brett; Merrell, Ronald

2004-01-01

The VitalPoll Telemedicine System (VTS) was designed and developed for wireless home healthcare. The aims of this study were: to design the architecture and communication methods for a telemedicine system; to implement a physiologic routing hub to collect data from different medical devices and sensors; and to evaluate the feasibility of this system for applications in wireless home healthcare. The VTS was built using Bluetooth wireless and Internet technologies with client/server architecture. Several medical devices, which acquire vital signs, such as real-time electrocardiogram signals, heart rate, body temperature, and activity (physical motion), were integrated into the VTS. Medical information and data were transmitted over short-range interface (USB, RS232), wireless communication, and the Internet. The medical results were stored in a database and presented using a web browser. The patient's vital signals can be collected, transmitted, and displayed in real time by the VTS. The experiments verified no data loss during Bluetooth and Internet communication. Bluetooth and the Internet provide enough bandwidth channels to tranmit these vital signs. The experimental results show that VTS may be suitable for a practical telemedicine system in home healthcare.

Analysis of Greedy Decision Making for Geographic Routing for Networks of Randomly Moving Objects

Directory of Open Access Journals (Sweden)

Amber Israr

2016-04-01

Full Text Available Autonomous and self-organizing wireless ad-hoc communication networks for moving objects consist of nodes, which use no centralized network infrastructure. Examples of moving object networks are networks of flying objects, networks of vehicles, networks of moving people or robots. Moving object networks have to face many critical challenges in terms of routing because of dynamic topological changes and asymmetric networks links. A suitable and effective routing mechanism helps to extend the deployment of moving nodes. In this paper an attempt has been made to analyze the performance of the Greedy Decision method (position aware distance based algorithm for geographic routing for network nodes moving according to the random waypoint mobility model. The widely used GPSR (Greedy Packet Stateless Routing protocol utilizes geographic distance and position based data of nodes to transmit packets towards destination nodes. In this paper different scenarios have been tested to develop a concrete set of recommendations for optimum deployment of distance based Greedy Decision of Geographic Routing in randomly moving objects network

LITERATURE SURVEY ON EXISTING POWER SAVING ROUTING METHODS AND TECHNIQUES FOR INCREASING NETWORK LIFE TIME IN MANET

Directory of Open Access Journals (Sweden)

K Mariyappan

2017-06-01

Full Text Available Mobile ad hoc network (MANET is a special type of wireless network in which a collection of wireless mobile devices (called also nodes dynamically forming a temporary network without the need of any pre-existing network infrastructure or centralized administration. Currently, Mobile ad hoc networks (MANETs play a significant role in university campus, advertisement, emergency response, disaster recovery, military use in battle fields, disaster management scenarios, in sensor network, and so on. However, wireless network devices, especially in ad hoc networks, are typically battery-powered. Thus, energy efficiency is a critical issue for battery-powered mobile devices in ad hoc networks. This is due to the fact that failure of node or link allows re-routing and establishing a new path from source to destination which creates extra energy consumption of nodes and sparse network connectivity, leading to a more likelihood occurrences of network partition. Routing based on energy related parameters is one of the important solutions to extend the lifetime of the node and reduce energy consumption of the network. In this paper detail literature survey on existing energy efficient routing method are studied and compared for their performance under different condition. The result has shown that both the broadcast schemes and energy aware metrics have great potential in overcoming the broadcast storm problem associated with flooding. However, the performances of these approaches rely on either the appropriate selection of the broadcast decision parameter or an energy efficient path. In the earlier proposed broadcast methods, the forwarding probability is selected based on fixed probability or number of neighbors regardless of nodes battery capacity whereas in energy aware schemes energy inefficient node could be part of an established path. Therefore, in an attempt to remedy the paucity of research and to address the gaps identified in this area, a study

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.

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.

A lightweight neighbor-info-based routing protocol for no-base-station taxi-call system.

Science.gov (United States)

Zhu, Xudong; Wang, Jinhang; Chen, Yunchao

2014-01-01

Since the quick topology change and short connection duration, the VANET has had unstable routing and wireless signal quality. This paper proposes a kind of lightweight routing protocol-LNIB for call system without base station, which is applicable to the urban taxis. LNIB maintains and predicts neighbor information dynamically, thus finding the reliable path between the source and the target. This paper describes the protocol in detail and evaluates the performance of this protocol by simulating under different nodes density and speed. The result of evaluation shows that the performance of LNIB is better than AODV which is a classic protocol in taxi-call scene.

Wireless data transfer with mm-waves for future tracking detectors

International Nuclear Information System (INIS)

Pelikan, D.; Bingefors, N.; Brenner, R.; Gustafsson, L.; Dancila, D.

2014-01-01

Wireless data transfer has revolutionized the consumer market for the last decade generating many products equipped with transmitters and receivers for wireless data transfer. Wireless technology opens attractive possibilities for data transfer in future tracking detectors. The reduction of wires and connectors for data links is certainly beneficial both for the material budget and the reliability of the system. An advantage of wireless data transfer is the freedom of routing signals which today is particularly complicated when bringing the data the first 50 cm out of the tracker. With wireless links intelligence can be built into a tracker by introducing communication between tracking layers within a region of interest which would allow the construction of track primitives in real time. The wireless technology used in consumer products is however not suitable for tracker readouts. The low data transfer capacity of current 5 GHz transceivers and the relatively large feature sizes of the components is a disadvantage.Due to the requirement of high data rates in tracking detectors high bandwidth is required. The frequency band around 60 GHz turns out to be a very promising candidate for data transfer in a detector system. The high baseband frequency allows for data transfer in the order of several Gbit/s. Due to the small wavelength in the mm range only small structures are needed for the transmitting and receiving electronics. The 60 GHz frequency band is a strong candidate for future WLAN applications hence components are already starting to be available on the market.Patch antennas produced on flexible Printed Circuit Board substrate that can be used for wireless communication in future trackers are presented in this article. The antennas can be connected to transceivers for data transmission/reception or be connected by wave-guides to structures capable of bringing the 60 GHz signal behind boundaries. Results on simulation and fabrication of these antennas are

Wireless data transfer with mm-waves for future tracking detectors

Science.gov (United States)

Pelikan, D.; Bingefors, N.; Brenner, R.; Dancila, D.; Gustafsson, L.

2014-11-01

Wireless data transfer has revolutionized the consumer market for the last decade generating many products equipped with transmitters and receivers for wireless data transfer. Wireless technology opens attractive possibilities for data transfer in future tracking detectors. The reduction of wires and connectors for data links is certainly beneficial both for the material budget and the reliability of the system. An advantage of wireless data transfer is the freedom of routing signals which today is particularly complicated when bringing the data the first 50 cm out of the tracker. With wireless links intelligence can be built into a tracker by introducing communication between tracking layers within a region of interest which would allow the construction of track primitives in real time. The wireless technology used in consumer products is however not suitable for tracker readouts. The low data transfer capacity of current 5 GHz transceivers and the relatively large feature sizes of the components is a disadvantage.Due to the requirement of high data rates in tracking detectors high bandwidth is required. The frequency band around 60 GHz turns out to be a very promising candidate for data transfer in a detector system. The high baseband frequency allows for data transfer in the order of several Gbit/s. Due to the small wavelength in the mm range only small structures are needed for the transmitting and receiving electronics. The 60 GHz frequency band is a strong candidate for future WLAN applications hence components are already starting to be available on the market.Patch antennas produced on flexible Printed Circuit Board substrate that can be used for wireless communication in future trackers are presented in this article. The antennas can be connected to transceivers for data transmission/reception or be connected by wave-guides to structures capable of bringing the 60 GHz signal behind boundaries. Results on simulation and fabrication of these antennas are

The Architecture of WiFi-Based WSN for AMR System and E-HWMP Routing Protocol

Directory of Open Access Journals (Sweden)

Li LI

2014-02-01

Full Text Available With the development of SoC technology in recent years, the ultra-low power WiFi System on SoC Chip has emerged. As a result, WiFi-based Wireless Sensor Networks come into use, especially used in Automatic Meter Reading. While because the nodes of Wireless Sensor Networks have limited energy supply, smaller storage capability and slower calculation ability, the current WiFi technology cannot be directly applied to WiFi-based Wireless Sensor Networks. The protocols should be upgraded and the security algorithms should be improved to meet the new requests. Firstly, this article describes the network architecture of WiFi-based WSN for AMR system and discusses the reason for using this analogous Mesh architecture. Secondly, the new Hardware architecture of WiFi-based WSN node is designed to realize the AMR system and verify the research work. The node can collect the data of power meter by WiFi and can be powered by a Lithium Battery. Thirdly, on the basis of study work of WiFi original routing protocol HWMP, a new method on improving the energy saving ability of HWMP to adapt the new features of WiFi-based WSN is proposed. And the simulation work on the new routing protocol E-HWMP has been done with NS2 and the simulation results show that the life cycle of the network has been extended to some degree.

Security issues in healthcare applications using wireless medical sensor networks: a survey.

Science.gov (United States)

Kumar, Pardeep; Lee, Hoon-Jae

2012-01-01

Healthcare applications are considered as promising fields for wireless sensor networks, where patients can be monitored using wireless medical sensor networks (WMSNs). Current WMSN healthcare research trends focus on patient reliable communication, patient mobility, and energy-efficient routing, as a few examples. However, deploying new technologies in healthcare applications without considering security makes patient privacy vulnerable. Moreover, the physiological data of an individual are highly sensitive. Therefore, security is a paramount requirement of healthcare applications, especially in the case of patient privacy, if the patient has an embarrassing disease. This paper discusses the security and privacy issues in healthcare application using WMSNs. We highlight some popular healthcare projects using wireless medical sensor networks, and discuss their security. Our aim is to instigate discussion on these critical issues since the success of healthcare application depends directly on patient security and privacy, for ethic as well as legal reasons. In addition, we discuss the issues with existing security mechanisms, and sketch out the important security requirements for such applications. In addition, the paper reviews existing schemes that have been recently proposed to provide security solutions in wireless healthcare scenarios. Finally, the paper ends up with a summary of open security research issues that need to be explored for future healthcare applications using WMSNs.

Security Issues in Healthcare Applications Using Wireless Medical Sensor Networks: A Survey

Directory of Open Access Journals (Sweden)

Hoon-Jae Lee

2011-12-01

Full Text Available Healthcare applications are considered as promising fields for wireless sensor networks, where patients can be monitored using wireless medical sensor networks (WMSNs. Current WMSN healthcare research trends focus on patient reliable communication, patient mobility, and energy-efficient routing, as a few examples. However, deploying new technologies in healthcare applications without considering security makes patient privacy vulnerable. Moreover, the physiological data of an individual are highly sensitive. Therefore, security is a paramount requirement of healthcare applications, especially in the case of patient privacy, if the patient has an embarrassing disease. This paper discusses the security and privacy issues in healthcare application using WMSNs. We highlight some popular healthcare projects using wireless medical sensor networks, and discuss their security. Our aim is to instigate discussion on these critical issues since the success of healthcare application depends directly on patient security and privacy, for ethic as well as legal reasons. In addition, we discuss the issues with existing security mechanisms, and sketch out the important security requirements for such applications. In addition, the paper reviews existing schemes that have been recently proposed to provide security solutions in wireless healthcare scenarios. Finally, the paper ends up with a summary of open security research issues that need to be explored for future healthcare applications using WMSNs.

Application of Swarm Intelligence Based Routingprotocols for Wireless Adhoc Sensor Network

Directory of Open Access Journals (Sweden)

Mrutyunjaya PANDA

2011-07-01

Full Text Available The enormous growth of wireless sensor network (WSN research has opined challenges about their ease in implementation and performance evaluation. Efficient swarm intelligence based routing protocols that can be used to obtain the application specific service guarantee are the key design issues in designing a WSN model. In this paper, an experimental testbed is designed with 100 sensor nodes deployed in a dense environment to address the scalability and performance issues of WSN. In this paper, we use Flooded Piggyback (FP and SC-MCBR ant colony based routing along with AODV and MCBR Tree in order to design an efficient WSN model. Finally, simulation results are presented with various performance measures to understand the efficacy of the proposed WSN design.

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

Directory of Open Access Journals (Sweden)

Ailian Jiang

2018-03-01

Full Text Available Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs. This paper investigates the existing ant colony optimization (ACO-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

Energy-efficient digital and wireless IC design for wireless smart sensing

Science.gov (United States)

Zhou, Jun; Huang, Xiongchuan; Wang, Chao; Tae-Hyoung Kim, Tony; Lian, Yong

2017-10-01

Wireless smart sensing is now widely used in various applications such as health monitoring and structural monitoring. In conventional wireless sensor nodes, significant power is consumed in wirelessly transmitting the raw data. Smart sensing adds local intelligence to the sensor node and reduces the amount of wireless data transmission via on-node digital signal processing. While the total power consumption is reduced compared to conventional wireless sensing, the power consumption of the digital processing becomes as dominant as wireless data transmission. This paper reviews the state-of-the-art energy-efficient digital and wireless IC design techniques for reducing the power consumption of the wireless smart sensor node to prolong battery life and enable self-powered applications.

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.

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.

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

Directory of Open Access Journals (Sweden)

I-Hsien Lin

2010-08-01

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

An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Rosana Lachowski

2015-01-01

Full Text Available Monitoring and data collection are the two main functions in wireless sensor networks (WSNs. Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an ad hoc network, nodes need to communicate with each other. For this reason, routing protocols for ad hoc networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing.

Analyzing energy consumption of wireless networks. A model-based approach

Energy Technology Data Exchange (ETDEWEB)

Yue, Haidi

2013-03-04

During the last decades, wireless networking has been continuously a hot topic both in academy and in industry. Many different wireless networks have been introduced like wireless local area networks, wireless personal networks, wireless ad hoc networks, and wireless sensor networks. If these networks want to have a long term usability, the power consumed by the wireless devices in each of these networks needs to be managed efficiently. Hence, a lot of effort has been carried out for the analysis and improvement of energy efficiency, either for a specific network layer (protocol), or new cross-layer designs. In this thesis, we apply model-based approach for the analysis of energy consumption of different wireless protocols. The protocols under consideration are: one leader election protocol, one routing protocol, and two medium access control protocols. By model-based approach we mean that all these four protocols are formalized as some formal models, more precisely, as discrete-time Markov chains (DTMCs), Markov decision processes (MDPs), or stochastic timed automata (STA). For the first two models, DTMCs and MDPs, we model them in PRISM, a prominent model checker for probabilistic model checking, and apply model checking technique to analyze them. Model checking belongs to the family of formal methods. It discovers exhaustively all possible (reachable) states of the models, and checks whether these models meet a given specification. Specifications are system properties that we want to study, usually expressed by some logics, for instance, probabilistic computer tree logic (PCTL). However, while model checking relies on rigorous mathematical foundations and automatically explores the entire state space of a model, its applicability is also limited by the so-called state space explosion problem -- even systems of moderate size often yield models with an exponentially larger state space that thwart their analysis. Hence for the STA models in this thesis, since there

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.

Bio-Mimic Optimization Strategies in Wireless Sensor Networks: A Survey

Science.gov (United States)

Adnan, Md. Akhtaruzzaman; Razzaque, Mohammd Abdur; Ahmed, Ishtiaque; Isnin, Ismail Fauzi

2014-01-01

For the past 20 years, many authors have focused their investigations on wireless sensor networks. Various issues related to wireless sensor networks such as energy minimization (optimization), compression schemes, self-organizing network algorithms, routing protocols, quality of service management, security, energy harvesting, etc., have been extensively explored. The three most important issues among these are energy efficiency, quality of service and security management. To get the best possible results in one or more of these issues in wireless sensor networks optimization is necessary. Furthermore, in number of applications (e.g., body area sensor networks, vehicular ad hoc networks) these issues might conflict and require a trade-off amongst them. Due to the high energy consumption and data processing requirements, the use of classical algorithms has historically been disregarded. In this context contemporary researchers started using bio-mimetic strategy-based optimization techniques in the field of wireless sensor networks. These techniques are diverse and involve many different optimization algorithms. As far as we know, most existing works tend to focus only on optimization of one specific issue of the three mentioned above. It is high time that these individual efforts are put into perspective and a more holistic view is taken. In this paper we take a step in that direction by presenting a survey of the literature in the area of wireless sensor network optimization concentrating especially on the three most widely used bio-mimetic algorithms, namely, particle swarm optimization, ant colony optimization and genetic algorithm. In addition, to stimulate new research and development interests in this field, open research issues, challenges and future research directions are highlighted. PMID:24368702

Bio-mimic optimization strategies in wireless sensor networks: a survey.

Science.gov (United States)

Adnan, Md Akhtaruzzaman; Abdur Razzaque, Mohammd; Ahmed, Ishtiaque; Isnin, Ismail Fauzi

2013-12-24

For the past 20 years, many authors have focused their investigations on wireless sensor networks. Various issues related to wireless sensor networks such as energy minimization (optimization), compression schemes, self-organizing network algorithms, routing protocols, quality of service management, security, energy harvesting, etc., have been extensively explored. The three most important issues among these are energy efficiency, quality of service and security management. To get the best possible results in one or more of these issues in wireless sensor networks optimization is necessary. Furthermore, in number of applications (e.g., body area sensor networks, vehicular ad hoc networks) these issues might conflict and require a trade-off amongst them. Due to the high energy consumption and data processing requirements, the use of classical algorithms has historically been disregarded. In this context contemporary researchers started using bio-mimetic strategy-based optimization techniques in the field of wireless sensor networks. These techniques are diverse and involve many different optimization algorithms. As far as we know, most existing works tend to focus only on optimization of one specific issue of the three mentioned above. It is high time that these individual efforts are put into perspective and a more holistic view is taken. In this paper we take a step in that direction by presenting a survey of the literature in the area of wireless sensor network optimization concentrating especially on the three most widely used bio-mimetic algorithms, namely, particle swarm optimization, ant colony optimization and genetic algorithm. In addition, to stimulate new research and development interests in this field, open research issues, challenges and future research directions are highlighted.

Proficient Node Scheduling Protocol for Homogeneous and Heterogeneous Wireless Sensor Networks

OpenAIRE

R. Saravanakumar; N. Mohankumar; J. Raja

2013-01-01

Recent communications in wireless sensor networks (WSNs) have much new energy-efficient protocols specifically designed, where energy awareness is an essential consideration. In WSNs, large numbers of tiny sensor nodes are used as an effective way of data gathering in various environments. Since the sensor nodes operate on battery of limited power, it is a great challenging aim to design an energy-efficient routing protocol, which can minimize the delay while offering high-energy efficiency a...

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.

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.

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.

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

Science.gov (United States)

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. PMID:25162060

An Enhanced Backbone-Assisted Reliable Framework for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Amna Ali

2010-03-01

Full Text Available An extremely reliable source to sink communication is required for most of the contemporary WSN applications especially pertaining to military, healthcare and disaster-recovery. However, due to their intrinsic energy, bandwidth and computational constraints, Wireless Sensor Networks (WSNs encounter several challenges in reliable source to sink communication. In this paper, we present a novel reliable topology that uses reliable hotlines between sensor gateways to boost the reliability of end-to-end transmissions. This reliable and efficient routing alternative reduces the number of average hops from source to the sink. We prove, with the help of analytical evaluation, that communication using hotlines is considerably more reliable than traditional WSN routing. We use reliability theory to analyze the cost and benefit of adding gateway nodes to a backbone-assisted WSN. However, in hotline assisted routing some scenarios where source and the sink are just a couple of hops away might bring more latency, therefore, we present a Signature Based Routing (SBR scheme. SBR enables the gateways to make intelligent routing decisions, based upon the derived signature, hence providing lesser end-to-end delay between source to the sink communication. Finally, we evaluate our proposed hotline based topology with the help of a simulation tool and show that the proposed topology provides manifold increase in end-to-end reliability.

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.

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.

Smart Waste Collection System with Low Consumption LoRaWAN Nodes and Route Optimization

Directory of Open Access Journals (Sweden)

Álvaro Lozano

2018-05-01

Full Text Available New solutions for managing waste have emerged due to the rise of Smart Cities and the Internet of Things. These solutions can also be applied in rural environments, but they require the deployment of a low cost and low consumption sensor network which can be used by different applications. Wireless technologies such as LoRa and low consumption microcontrollers, such as the SAM L21 family make the implementation and deployment of this kind of sensor network possible. This paper introduces a waste monitoring and management platform used in rural environments. A prototype of a low consumption wireless node is developed to obtain measurements of the weight, filling volume and temperature of a waste container. This monitoring allows the progressive filling data of every town container to be gathered and analysed as well as creating alerts in case of incidence. The platform features a module for optimising waste collection routes. This module dynamically generates routes from data obtained through the deployed nodes to save energy, time and consequently, costs. It also features a mobile application for the collection fleet which guides every driver through the best route—previously calculated for each journey. This paper presents a case study performed in the region of Salamanca to evaluate the efficiency and the viability of the system’s implementation. Data used for this case study come from open data sources, the report of the Castilla y León waste management plan and data from public tender procedures in the region of Salamanca. The results of the case study show a developed node with a great lifetime of operation, a large coverage with small deployment of antennas in the region, and a route optimization system which uses weight and volume measured by the node, and provides savings in cost, time and workforce compared to a static collection route approach.

Smart Waste Collection System with Low Consumption LoRaWAN Nodes and Route Optimization.

Science.gov (United States)

Lozano, Álvaro; Caridad, Javier; De Paz, Juan Francisco; Villarrubia González, Gabriel; Bajo, Javier

2018-05-08

New solutions for managing waste have emerged due to the rise of Smart Cities and the Internet of Things. These solutions can also be applied in rural environments, but they require the deployment of a low cost and low consumption sensor network which can be used by different applications. Wireless technologies such as LoRa and low consumption microcontrollers, such as the SAM L21 family make the implementation and deployment of this kind of sensor network possible. This paper introduces a waste monitoring and management platform used in rural environments. A prototype of a low consumption wireless node is developed to obtain measurements of the weight, filling volume and temperature of a waste container. This monitoring allows the progressive filling data of every town container to be gathered and analysed as well as creating alerts in case of incidence. The platform features a module for optimising waste collection routes. This module dynamically generates routes from data obtained through the deployed nodes to save energy, time and consequently, costs. It also features a mobile application for the collection fleet which guides every driver through the best route—previously calculated for each journey. This paper presents a case study performed in the region of Salamanca to evaluate the efficiency and the viability of the system’s implementation. Data used for this case study come from open data sources, the report of the Castilla y León waste management plan and data from public tender procedures in the region of Salamanca. The results of the case study show a developed node with a great lifetime of operation, a large coverage with small deployment of antennas in the region, and a route optimization system which uses weight and volume measured by the node, and provides savings in cost, time and workforce compared to a static collection route approach.

Wireless mesh networks.

Science.gov (United States)

Wang, Xinheng

2008-01-01

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

Cluster-based Dynamic Energy Management for Collaborative Target Tracking in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Dao-Wei Bi

2007-07-01

Full Text Available A primary criterion of wireless sensor network is energy efficiency. Focused onthe energy problem of target tracking in wireless sensor networks, this paper proposes acluster-based dynamic energy management mechanism. Target tracking problem isformulated by the multi-sensor detection model as well as energy consumption model. Adistributed adaptive clustering approach is investigated to form a reasonable routingframework which has uniform cluster head distribution. Dijkstra’s algorithm is utilized toobtain optimal intra-cluster routing. Target position is predicted by particle filter. Thepredicted target position is adopted to estimate the idle interval of sensor nodes. Hence,dynamic awakening approach is exploited to prolong sleep time of sensor nodes so that theoperation energy consumption of wireless sensor network can be reduced. The sensornodes around the target wake up on time and act as sensing candidates. With the candidatesensor nodes and predicted target position, the optimal sensor node selection is considered.Binary particle swarm optimization is proposed to minimize the total energy consumptionduring collaborative sensing and data reporting. Experimental results verify that theproposed clustering approach establishes a low-energy communication structure while theenergy efficiency of wireless sensor networks is enhanced by cluster-based dynamic energymanagement.

Minimizing Detection Probability Routing in Ad Hoc Networks Using Directional Antennas

Directory of Open Access Journals (Sweden)

Towsley Don

2009-01-01

Full Text Available In a hostile environment, it is important for a transmitter to make its wireless transmission invisible to adversaries because an adversary can detect the transmitter if the received power at its antennas is strong enough. This paper defines a detection probability model to compute the level of a transmitter being detected by a detection system at arbitrary location around the transmitter. Our study proves that the probability of detecting a directional antenna is much lower than that of detecting an omnidirectional antenna if both the directional and omnidirectional antennas provide the same Effective Isotropic Radiated Power (EIRP in the direction of the receiver. We propose a Minimizing Detection Probability (MinDP routing algorithm to find a secure routing path in ad hoc networks where nodes employ directional antennas to transmit data to decrease the probability of being detected by adversaries. Our study shows that the MinDP routing algorithm can reduce the total detection probability of deliveries from the source to the destination by over 74%.

Enhancing On-Demand Multicast Routing Protocols using Mobility Prediction in Mobile Ad-hoc Network

Directory of Open Access Journals (Sweden)

Nermin Makhlouf

2014-08-01

Full Text Available A Mobile Ad hoc Network (MANET is a self-organizing wireless communication network in which mobile devices are based on no infrastructure like base stations or access points. Minimal configuration and quick deployment make ad hoc networks suitable for emergency situations like disaster recovery or military conflict. Since node mobility may cause links to be broken frequently, a very important issue for routing in MANETs is how to set reliable paths which can last as long as possible. To solve this problem, non-random behaviors for the mobility patterns that mobile users exhibit are exploited. This paper introduces a scheme to improve On-Demand Multicast Routing Protocol (ODMRP performances by using mobility prediction. 

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

Performance modeling of neighbor discovery in proactive routing protocols

Directory of Open Access Journals (Sweden)

Andres Medina

2011-07-01

Full Text Available It is well known that neighbor discovery is a critical component of proactive routing protocols in wireless ad hoc networks. However there is no formal study on the performance of proposed neighbor discovery mechanisms. This paper provides a detailed model of key performance metrics of neighbor discovery algorithms, such as node degree and the distribution of the distance to symmetric neighbors. The model accounts for the dynamics of neighbor discovery as well as node density, mobility, radio and interference. The paper demonstrates a method for applying these models to the evaluation of global network metrics. In particular, it describes a model of network connectivity. Validation of the models shows that the degree estimate agrees, within 5% error, with simulations for the considered scenarios. The work presented in this paper serves as a basis for the performance evaluation of remaining performance metrics of routing protocols, vital for large scale deployment of ad hoc networks.

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.

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

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. PMID:29671822

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.

An Energy-Efficient and High-Quality Video Transmission Architecture in Wireless Video-Based Sensor Networks

Directory of Open Access Journals (Sweden)

Yasaman Samei

2008-08-01

Full Text Available Technological progress in the fields of Micro Electro-Mechanical Systems (MEMS and wireless communications and also the availability of CMOS cameras, microphones and small-scale array sensors, which may ubiquitously capture multimedia content from the field, have fostered the development of low-cost limited resources Wireless Video-based Sensor Networks (WVSN. With regards to the constraints of videobased sensor nodes and wireless sensor networks, a supporting video stream is not easy to implement with the present sensor network protocols. In this paper, a thorough architecture is presented for video transmission over WVSN called Energy-efficient and high-Quality Video transmission Architecture (EQV-Architecture. This architecture influences three layers of communication protocol stack and considers wireless video sensor nodes constraints like limited process and energy resources while video quality is preserved in the receiver side. Application, transport, and network layers are the layers in which the compression protocol, transport protocol, and routing protocol are proposed respectively, also a dropping scheme is presented in network layer. Simulation results over various environments with dissimilar conditions revealed the effectiveness of the architecture in improving the lifetime of the network as well as preserving the video quality.

An Energy-Efficient and High-Quality Video Transmission Architecture in Wireless Video-Based Sensor Networks.

Science.gov (United States)

Aghdasi, Hadi S; Abbaspour, Maghsoud; Moghadam, Mohsen Ebrahimi; Samei, Yasaman

2008-08-04

Technological progress in the fields of Micro Electro-Mechanical Systems (MEMS) and wireless communications and also the availability of CMOS cameras, microphones and small-scale array sensors, which may ubiquitously capture multimedia content from the field, have fostered the development of low-cost limited resources Wireless Video-based Sensor Networks (WVSN). With regards to the constraints of videobased sensor nodes and wireless sensor networks, a supporting video stream is not easy to implement with the present sensor network protocols. In this paper, a thorough architecture is presented for video transmission over WVSN called Energy-efficient and high-Quality Video transmission Architecture (EQV-Architecture). This architecture influences three layers of communication protocol stack and considers wireless video sensor nodes constraints like limited process and energy resources while video quality is preserved in the receiver side. Application, transport, and network layers are the layers in which the compression protocol, transport protocol, and routing protocol are proposed respectively, also a dropping scheme is presented in network layer. Simulation results over various environments with dissimilar conditions revealed the effectiveness of the architecture in improving the lifetime of the network as well as preserving the video quality.

Modeling On-Body DTN Packet Routing Delay in the Presence of Postural Disconnections

Directory of Open Access Journals (Sweden)

Taghizadeh Mahmoud

2011-01-01

Full Text Available This paper presents a stochastic modeling framework for store-and-forward packet routing in Wireless Body Area Networks (WBAN with postural partitioning. A prototype WBANs has been constructed for experimentally characterizing and capturing on-body topology disconnections in the presence of ultrashort range radio links, unpredictable RF attenuation, and human postural mobility. Delay modeling techniques for evaluating single-copy on-body DTN routing protocols are then developed. End-to-end routing delay for a series of protocols including opportunistic, randomized, and two other mechanisms that capture multiscale topological localities in human postural movements have been evaluated. Performance of the analyzed protocols are then evaluated experimentally and via simulation to compare with the results obtained from the developed model. Finally, a mechanism for evaluating the topological importance of individual on-body sensor nodes is developed. It is shown that such information can be used for selectively reducing the on-body sensor-count without substantially sacrificing the packet delivery delay.

Modeling On-Body DTN Packet Routing Delay in the Presence of Postural Disconnections.

Science.gov (United States)

Quwaider, Muhannad; Taghizadeh, Mahmoud; Biswas, Subir

2011-01-01

This paper presents a stochastic modeling framework for store-and-forward packet routing in Wireless Body Area Networks ( WBAN ) with postural partitioning. A prototype WBANs has been constructed for experimentally characterizing and capturing on-body topology disconnections in the presence of ultrashort range radio links, unpredictable RF attenuation, and human postural mobility. Delay modeling techniques for evaluating single-copy on-body DTN routing protocols are then developed. End-to-end routing delay for a series of protocols including opportunistic, randomized, and two other mechanisms that capture multiscale topological localities in human postural movements have been evaluated. Performance of the analyzed protocols are then evaluated experimentally and via simulation to compare with the results obtained from the developed model. Finally, a mechanism for evaluating the topological importance of individual on-body sensor nodes is developed. It is shown that such information can be used for selectively reducing the on-body sensor-count without substantially sacrificing the packet delivery delay.

An Efficient Wireless Sensor Network for Industrial Monitoring and Control.

Science.gov (United States)

Aponte-Luis, Juan; Gómez-Galán, Juan Antonio; Gómez-Bravo, Fernando; Sánchez-Raya, Manuel; Alcina-Espigado, Javier; Teixido-Rovira, Pedro Miguel

2018-01-10

This paper presents the design of a wireless sensor network particularly designed for remote monitoring and control of industrial parameters. The article describes the network components, protocol and sensor deployment, aimed to accomplish industrial constraint and to assure reliability and low power consumption. A particular case of study is presented. The system consists of a base station, gas sensing nodes, a tree-based routing scheme for the wireless sensor nodes and a real-time monitoring application that operates from a remote computer and a mobile phone. The system assures that the industrial safety quality and the measurement and monitoring system achieves an efficient industrial monitoring operations. The robustness of the developed system and the security in the communications have been guaranteed both in hardware and software level. The system is flexible and can be adapted to different environments. The testing of the system confirms the feasibility of the proposed implementation and validates the functional requirements of the developed devices, the networking solution and the power consumption management.

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.

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.

Chain-based communication in cylindrical underwater wireless sensor networks.

Science.gov (United States)

Javaid, Nadeem; Jafri, Mohsin Raza; Khan, Zahoor Ali; Alrajeh, Nabil; Imran, Muhammad; Vasilakos, Athanasios

2015-02-04

Appropriate network design is very significant for Underwater Wireless Sensor Networks (UWSNs). Application-oriented UWSNs are planned to achieve certain objectives. Therefore, there is always a demand for efficient data routing schemes, which can fulfill certain requirements of application-oriented UWSNs. These networks can be of any shape, i.e., rectangular, cylindrical or square. In this paper, we propose chain-based routing schemes for application-oriented cylindrical networks and also formulate mathematical models to find a global optimum path for data transmission. In the first scheme, we devise four interconnected chains of sensor nodes to perform data communication. In the second scheme, we propose routing scheme in which two chains of sensor nodes are interconnected, whereas in third scheme single-chain based routing is done in cylindrical networks. After finding local optimum paths in separate chains, we find global optimum paths through their interconnection. Moreover, we develop a computational model for the analysis of end-to-end delay. We compare the performance of the above three proposed schemes with that of Power Efficient Gathering System in Sensor Information Systems (PEGASIS) and Congestion adjusted PEGASIS (C-PEGASIS). Simulation results show that our proposed 4-chain based scheme performs better than the other selected schemes in terms of network lifetime, end-to-end delay, path loss, transmission loss, and packet sending rate.

Chain-Based Communication in Cylindrical Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2015-02-01

Full Text Available Appropriate network design is very significant for Underwater Wireless Sensor Networks (UWSNs. Application-oriented UWSNs are planned to achieve certain objectives. Therefore, there is always a demand for efficient data routing schemes, which can fulfill certain requirements of application-oriented UWSNs. These networks can be of any shape, i.e., rectangular, cylindrical or square. In this paper, we propose chain-based routing schemes for application-oriented cylindrical networks and also formulate mathematical models to find a global optimum path for data transmission. In the first scheme, we devise four interconnected chains of sensor nodes to perform data communication. In the second scheme, we propose routing scheme in which two chains of sensor nodes are interconnected, whereas in third scheme single-chain based routing is done in cylindrical networks. After finding local optimum paths in separate chains, we find global optimum paths through their interconnection. Moreover, we develop a computational model for the analysis of end-to-end delay. We compare the performance of the above three proposed schemes with that of Power Efficient Gathering System in Sensor Information Systems (PEGASIS and Congestion adjusted PEGASIS (C-PEGASIS. Simulation results show that our proposed 4-chain based scheme performs better than the other selected schemes in terms of network lifetime, end-to-end delay, path loss, transmission loss, and packet sending rate.

An energy-efficient data gathering protocol in large wireless sensor network

Science.gov (United States)

Wang, Yamin; Zhang, Ruihua; Tao, Shizhong

2006-11-01

Wireless sensor network consisting of a large number of small sensors with low-power transceiver can be an effective tool for gathering data in a variety of environment. The collected data must be transmitted to the base station for further processing. Since a network consists of sensors with limited battery energy, the method for data gathering and routing must be energy efficient in order to prolong the lifetime of the network. In this paper, we presented an energy-efficient data gathering protocol in wireless sensor network. The new protocol used data fusion technology clusters nodes into groups and builds a chain among the cluster heads according to a hybrid of the residual energy and distance to the base station. Results in stochastic geometry are used to derive the optimum parameter of our algorithm that minimizes the total energy spent in the network. Simulation results show performance superiority of the new protocol.

Reliable Adaptive Data Aggregation Route Strategy for a Trade-off between Energy and Lifetime in WSNs

Directory of Open Access Journals (Sweden)

Wenzhong Guo

2014-09-01

Full Text Available Mobile security is one of the most fundamental problems in Wireless Sensor Networks (WSNs. The data transmission path will be compromised for some disabled nodes. To construct a secure and reliable network, designing an adaptive route strategy which optimizes energy consumption and network lifetime of the aggregation cost is of great importance. In this paper, we address the reliable data aggregation route problem for WSNs. Firstly, to ensure nodes work properly, we propose a data aggregation route algorithm which improves the energy efficiency in the WSN. The construction process achieved through discrete particle swarm optimization (DPSO saves node energy costs. Then, to balance the network load and establish a reliable network, an adaptive route algorithm with the minimal energy and the maximum lifetime is proposed. Since it is a non-linear constrained multi-objective optimization problem, in this paper we propose a DPSO with the multi-objective fitness function combined with the phenotype sharing function and penalty function to find available routes. Experimental results show that compared with other tree routing algorithms our algorithm can effectively reduce energy consumption and trade off energy consumption and network lifetime.

What is a missing link among wireless persistent surveillance?

Science.gov (United States)

Hsu, Charles; Szu, Harold

2011-06-01

The next generation surveillance system will equip with versatile sensor devices and information focus capable of conducting regular and irregular surveillance and security environments worldwide. The community of the persistent surveillance must invest the limited energy and money effectively into researching enabling technologies such as nanotechnology, wireless networks, and micro-electromechanical systems (MEMS) to develop persistent surveillance applications for the future. Wireless sensor networks can be used by the military for a number of purposes such as monitoring militant activity in remote areas and force protection. Being equipped with appropriate sensors these networks can enable detection of enemy movement, identification of enemy force and analysis of their movement and progress. Among these sensor network technologies, covert communication is one of the challenging tasks in the persistent surveillance because it is highly demanded to provide secured sensor nodes and linkage for fear of deliberate sabotage. Due to the matured VLSI/DSP technologies, affordable COTS of UWB technology with noise-like direct sequence (DS) time-domain pulses is a potential solution to support low probability of intercept and low probability of detection (LPI/LPD) data communication and transmission. This paper will describe a number of technical challenges in wireless persistent surveillance development include covert communication, network control and routing, collaborating signal and information processing, and etc. The paper concludes by presenting Hermitian Wavelets to enhance SNR in support of secured communication.

Cooperative HARQ with Poisson Interference and Opportunistic Routing

KAUST Repository

Kaveh, Mostafa

2014-01-06

This presentation considers reliable transmission of data from a source to a destination, aided cooperatively by wireless relays selected opportunistically and utilizing hybrid forward error correction/detection, and automatic repeat request (Hybrid ARQ, or HARQ). Specifically, we present a performance analysis of the cooperative HARQ protocol in a wireless adhoc multihop network employing spatial ALOHA. We model the nodes in such a network by a homogeneous 2-D Poisson point process. We study the tradeoff between the per-hop rate, spatial density and range of transmissions inherent in the network by optimizing the transport capacity with respect to the network design parameters, HARQ coding rate and medium access probability. We obtain an approximate analytic expression for the expected progress of opportunistic routing and optimize the capacity approximation by convex optimization. By way of numerical results, we show that the network design parameters obtained by optimizing the analytic approximation of transport capacity closely follows that of Monte Carlo based exact transport capacity optimization. As a result of the analysis, we argue that the optimal HARQ coding rate and medium access probability are independent of the node density in the network.

Improvement on LEACH Agreement of Mine Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Yun-xiang Liu

2017-05-01

Full Text Available Based on the characteristics of wireless sensor network communication in mine, LEACH protocol clustering is optimized, and the factors of energy and distance are considered fully. The selection of cluster head nodes is optimized, and a routing algorithm based on K-means ++ clustering is proposed. The problem of uneven distribution of cluster head nodes, uneven energy consumption and network stability in LEACH algorithm is improved effectively. Simulation results show that the proposed algorithm can improve the energy consumption of the whole network and improve the energy utilization rate, extending the network life cycle effectively.

Energy-Efficient Cluster Based Routing Protocol in Mobile Ad Hoc Networks Using Network Coding

OpenAIRE

Srinivas Kanakala; Venugopal Reddy Ananthula; Prashanthi Vempaty

2014-01-01

In mobile ad hoc networks, all nodes are energy constrained. In such situations, it is important to reduce energy consumption. In this paper, we consider the issues of energy efficient communication in MANETs using network coding. Network coding is an effective method to improve the performance of wireless networks. COPE protocol implements network coding concept to reduce number of transmissions by mixing the packets at intermediate nodes. We incorporate COPE into cluster based routing proto...

A Hybrid Optimized Weighted Minimum Spanning Tree for the Shortest Intrapath Selection in Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Matheswaran Saravanan

2014-01-01

Full Text Available Wireless sensor network (WSN consists of sensor nodes that need energy efficient routing techniques as they have limited battery power, computing, and storage resources. WSN routing protocols should enable reliable multihop communication with energy constraints. Clustering is an effective way to reduce overheads and when this is aided by effective resource allocation, it results in reduced energy consumption. In this work, a novel hybrid evolutionary algorithm called Bee Algorithm-Simulated Annealing Weighted Minimal Spanning Tree (BASA-WMST routing is proposed in which randomly deployed sensor nodes are split into the best possible number of independent clusters with cluster head and optimal route. The former gathers data from sensors belonging to the cluster, forwarding them to the sink. The shortest intrapath selection for the cluster is selected using Weighted Minimum Spanning Tree (WMST. The proposed algorithm computes the distance-based Minimum Spanning Tree (MST of the weighted graph for the multihop network. The weights are dynamically changed based on the energy level of each sensor during route selection and optimized using the proposed bee algorithm simulated annealing algorithm.

A Survey of Wireless Indoor Positioning Technology for Fire Emergency Routing

International Nuclear Information System (INIS)

Niu, Lei

2014-01-01

Fire emergency response needs positioning solutions to assist evacuation and rescue operations. Therefore, we have to carefully review the candidates for this purpose. These indoor positioning technologies show different levels of applicability in fire emergency response. According to the varying demands of emergency response, flexible localization solutions should be provided. Thus, we guide a first step to implement this concept in three pre-defined emergency scenes. At last, we conclude several key features for indoor positioning solutions for emergency routing and three future research topics

Lower Bound of Energy-Latency Tradeoff of Opportunistic Routing in Multihop Networks

Directory of Open Access Journals (Sweden)

Gorce Jean-Marie

2011-01-01

Full Text Available Opportunistic networking aims at exploiting sporadic radio links to improve the connectivity of multihop networks and to foster data transmissions. The broadcast nature of wireless channels is an important feature that can be exploited to improve transmissions by using several potential receivers. Opportunistic relaying is thus the first brick for opportunistic networking. However, the advantage of opportunistic relaying may be degraded due to energy increase related to having multiple active receivers. This paper proposes a thorough analysis of opportunistic relaying efficiency under different realistic radio channel conditions. The study is intended to find the best tradeoff between two objectives: energy and latency minimizations, with a hard reliability constraint. We derive an optimal bound, namely, the Pareto front of the related optimization problem, which offers a good insight into the benefits of opportunistic routings compared with classical multihop routing schemes. Meanwhile, the lower bound provides a framework to optimize the parameters at the physical layer, MAC layer, and routing layer from the viewpoint of cross layer during the design or planning phase of a network.

The Wireless ATM Architecture

Directory of Open Access Journals (Sweden)

R. Palitefka

1998-06-01

Full Text Available An overview of the proposed wireless ATM structure is provided. Wireless communication have been developed to a level where offered services can now be extended beyond voice and data. There are already wireless LANs, cordless systems offering data services and mobile data. Wireless LAN systems are basically planned for local, on-promises and in-house networking providing short distance radio or infrared links between computer system. The main challenge of wireless ATM is to harmonise the development of broadband wireless system with service B -ISDN/ATM and ATM LANs, and offer multimedia multiservice features for the support of time-sensitive voice communication, video, desktop multimedia applications, and LAN data traffic for the wireless user.

Optical wireless communications to OC-768 and beyond

Science.gov (United States)

Medved, David B.; Davidovich, Leonid

2001-10-01

Laser and LED-based wireless communication systems are currently providing license-free interconnection for broadband voice, data and video transport. These systems allow for the immediate, reliable and low-cost extension of copper and fiber-based networks to any end user, providing efficient First Mile bypass access to high data rate backbone networks at speeds ranging from T-1 voice to full throughput ATM at 155 Mbps and up to Gigabit Ethernet. These wireless optical beams constitute a Virtual Fiber in the air, providing the capabilities of fiber in situations where wired connectivity is unavailable, impractical, expensive or slow-to-implement, while achieving a combination of low cost, speed and reliability that cannot be matched by microwave, mm wave, spread spectrum or other competing (actually complementary) wireless technologies. The carrier frequency of the optical beam is about 10,000 times higher than the highest frequencies used by the millimeter wave technology. By means of Wavelength Division Multiplexing more than 1000 independent data channels can be projected into the air on a single beam thus providing a potential bandwidth ten million times that of any RF solution. The twin barriers of physics and regulatory bureaucracy to this essentially infinite wireless bandwidth are thus eliminated by this Virtual Fiber. As user density and individual bandwidth needs escalate, the optical wireless will be the preferred medium of choice in both network and cellular interconnection. A mesh topology which integrates our optical wireless systems with the latest Optical Access switches and routing equipment will be described using case study examples from Japan to South America. As the Bandwidth Blowout continues to push the limits of electronics and especially in the case of DWDM (Dense Wavelength Division Multiples), the conventional optical wireless solutions are no longer feasible. Instead of using f.o. transceivers to convert photons to electrons and thence