Spelling suggestions: "subject:"aireless appsensor etworks"" "subject:"aireless appsensor enetworks""
101 |
Study on Routing Protocols for the Security of Wireless Sensor NetworksKulkarni, Aditya 10 1900 (has links)
ITC/USA 2013 Conference Proceedings / The Forty-Ninth Annual International Telemetering Conference and Technical Exhibition / October 21-24, 2013 / Bally's Hotel & Convention Center, Las Vegas, NV / This paper describes some of the security challenges faced by Wireless Sensor Networks (WSN). A classification and analysis of prominent attacks on the routing protocols of WSN is provided, along with a review of recent developments in the field to help mitigate the impact of these attacks.
|
102 |
Energy efficient data gathering in wireless sensor networksMurshed, Md. Golam January 2013 (has links)
Along with the rapid growth of Wireless Sensor Networks, a wide range of challenges have come to existence to make the network more robust and versatile. Gaining energy efficiency and maximizing network lifetime are the most important of all that can affect the performance of the network directly. In this thesis, a number of research aspects related to energy efficient data gathering have been investigated and some promising proposals are presented. In large, hierarchical multi-hop Wireless Sensor Networks, power consumption characteristics of the static sensor nodes and data traffic distribution across the network are largely determined by the node position and the adopted routing protocol. In this thesis, these phenomena of the network are addressed analytically and we proposed some methods to divide the monitoring field into partitions that act as the basis for even load distribution in the network. We proposed an algorithm to calculate the area of the partitions that exploits the energy efficient features of optimal transmission range. The partition works as the bedrock of the other proposals in this thesis. Considering the influential factors of the proximity and the recent state of the network, we also developed a routing protocol that minimises over all energy consumption of the network and is able to dynamically select a route to the sink. Further, we proposed a rotational order for data gathering scheme that works along with the routing protocol to ensure load balancing and to alleviate data congestion around the sink. Clustered organization of the nodes in sensor networks can further save energy consumption and facilitates scope for better network management. In this thesis, we address the fact that equal sized clusters can cause unbalanced data traffic around the sink. So, we propose a method to calculate suitable cluster radii in different regions of the monitoring field in order to form clusters of different sizes. To ensure unequal clusters in the field, a cluster construction procedure is also proposed targeting minimal data generation, minimal energy consumption and providing capacity for reliability preservation. Furthermore, the notion of redundant nodes and the outlines of a possible solution to identify and deactivate redundant nodes are explained in this thesis. Since the clusterheads play an important role as coordinators in the clusters, it is vital that there is a clusterhead in every cluster all the time. In this thesis, a message optimal and distributed leader election algorithm is proposed to select a new clusterhead in case of unexpected and unnoticed failure of a clusterhead node. Detailed analysis and simulation of the proposed methods clarify the effectiveness of the research. In comparison with other methods of similar kind, our methods confirm better balanced energy dissipation, energy efficient route selection, message optimal clusterhead selection and prolonged lifetime of the network.
|
103 |
Mobile data collectors in wireless sensor networksAL-SALIH, WALEED 27 April 2009 (has links)
Recent advances in wireless and sensing technologies have enabled the deployment of large scale Wireless Sensor Networks (WSNs) which have a wide range of scientific and commercial applications. However, due to the limited energy supply of sensor nodes, extending the network lifetime has become crucial for WSNs to deliver their promised benefits. Several proposals have aimed at this objective by designing energy efficient protocols at the physical, medium access, and network layers. While the proposed protocols achieve significant energy savings for individual sensor nodes, they fail to solve topology-related problems. An example of such problems is the bottlenecks around the sink, which is a direct result of multi-hop relaying: sensor nodes around the sink relay data generated all over the network which makes them deplete their energy much faster than other nodes.
A natural solution to this problem is to have multiple mobile data collectors so that the load is distributed evenly among all nodes. We investigate this promising direction for balancing the load and, hence, prolonging the lifetime of the network. We design optimization schemes for routing and placement of mobile data collectors in WSNs. We show, by theoretical analysis and simulations, that our approach has the potential to prolong the lifetime of the network significantly. / Thesis (Ph.D, Computing) -- Queen's University, 2009-04-26 21:58:55.152
|
104 |
Designing Hierarchical WSNs for Heterogeneous Outdoor Environments.Mortazavi ,Seyed Hossein Unknown Date
No description available.
|
105 |
Base Station Positioning and Relocation in Wireless Sensor NetworksDehleh Hossein Zadeh, Parisa Unknown Date
No description available.
|
106 |
Experimental Challenges in Wireless Sensor Networks — Environment, Mobility, and InterferenceRensfelt, Olof January 2012 (has links)
Wireless sensor networks are used to collect sensor data in different applications such as environmental monitoring, smart building control, and health care applications. Wireless sensor nodes used are typically small, low-cost, and battery powered. The nodes are often hard to access after deployment, for example when they are in remote locations. Another property of wireless sensor networks is that their operation is dependent on the environment they operate in, both due to the specific sensor readings but also due to the effects on communication by factors such as fading and radio interference. This makes it important to evaluate a wireless sensor network in its intendent target environment before final deployment. To enable experiments with wireless sensor networks in their target environment, we have designed and implemented a testbed called Sensei-UU. It is designed to allow WSN experiments to be repeated in different locations, thus exposing effects caused by the environment. To allow this, the testbed is designed to be easily moved between experimental sites. One type of WSN applications Sensei-UU is aimed to evaluate is protocols where nodes are mobile. Mobile testbed nodes are low-cost robots which follow a tape track on the floor. The localization accuracy of the robot approach is evaluated and is accurate enough to expose a protocol to fading phenoma in a repeatable manner. Sensei-UU has helped us develop a lightweight interference classification approach, SoNIC, which runs on standard motes. The approach only use information from a standard cc2420 chipset available when packets are received. We believe that the classification accuracy is good enough to motivate specific transmission techniques avoiding interference. / WISENET
|
107 |
Enabling communication between Wireless Sensor Networks and The Internet-of-Things : A CoAP communication stackAloisi, Alessandro January 2014 (has links)
The thesis focuses on enabling the communication between Wireless Sensor Networks and Internet-of-Things applications. In order to achieve this goal, the first step has been to investigate the concept of the Internet-of-Things and then to understand how this scenario could be used to interconnect multiple Wireless Sensor Networks in order to develop context-aware applications which could handle sensor data coming from this type of network. The second step was to design and implement a communication stack which enabled Wireless Sensor Networks to communicate with an Internet-of-Things platform. The CoAP protocol has been used as application protocol for the communication with the Wireless Sensor Networks. The solution has been developed in Java programming language and extended the sensor and actuator layer of the Sensible Things platform. The third step of this thesis has been to investigate in which real world applications the developed solution could have been used. Next a Proof of Concept application has been implemented in order to simulate a simple fire detection system, where multiple Wireless Sensor Networks collaborate to send their temperature data to a control center. The last step was to evaluate the whole system, specifically the responsiveness and the overhead introduced by the developed communication stack.
|
108 |
Rate-aware Cost-efficient Multiratecasting Routing in Wireless Sensor NetworksLiu, Xidong 04 March 2013 (has links)
In the multiratecasting problem in wireless sensor networks, the source sensor is usually required to report to multiple destinations at dif- ferent rates for each of them. We present a MST-based rate-aware cost-efficient multiratecast routing protocol (MSTRC). The proposed MSTRC examines only one set partition of destinations at each for- warding step. A message split occurs when the locally-built minimum spanning tree (MST) over the current node and the set of destina- tions has multiple edges originated at the current node. Destinations spanned by each of these edges are grouped together, and for each of these subsets the best neighbor is selected as the next hop. We also suggested a novel face recovery mechanism to deal with void ar- eas, when no neighbor provides positive progress toward destinations. It constructs a MST of current node and destinations without the progress via neighbors, and for each set partition of destinations cor- responding to an edge e in MST, the face routing keeps going until a node that is closer to one of these destinations is found, allowing for greedy continuation, while the process repeats for the remaining desti- nations similarly. Our experimental results demonstrate that MSTRC is highly rate-efficient in all scenarios, and unlike existing solutions, it is adaptive to destination rate deviations.
|
109 |
Base Station Positioning and Relocation in Wireless Sensor NetworksDehleh Hossein Zadeh, Parisa 11 1900 (has links)
Base station (BS) positioning is considered an effective method to improve the performance of a Wireless Sensor Network (WSN). The goal of this dissertation is to minimize total energy consumption and to prolong lifetime of a WSN. First, the idea of the BS positioning in WSNs through our exhaustive search algorithm is evaluated; where it is shown that the BS position has an undeniable effect on the energy efficiency and lifespan of a WSN. Then, a metric-aware optimal BS positioning and relocation mechanism for WSNs is proposed. This technique locates the BS with respect to the available energy resources and the amount of traffic travelling through the sensor nodes at the time. Moreover, a BS relocation technique is presented in response to the dynamic environment that the sensor nodes operate in. Specifically, two optimization strategies based on the value of the path loss exponent are analyzed as weighted linear or nonlinear least squares minimization problems. Lastly, a distributed algorithm is proposed that can effectively handle the required computation by exploiting the nodes cooperation. The simulation results demonstrate that the proposed BS positioning and relocation method can significantly improve the lifespan and energy efficiency in WSNs. / Communications
|
110 |
A Real-Time Communication Framework for Wireless Sensor NetworksAAL SALEM, MOHAMMED January 2009 (has links)
Doctor of Philosophy(PhD) / Recent advances in miniaturization and low power design have led to a flurry of activity in wireless sensor networks. Sensor networks have different constraints than traditional wired networks. A wireless sensor network is a special network with large numbers of nodes equipped with embedded processors, sensors, and radios. These nodes collaborate to accomplish a common task such as environment monitoring or asset tracking. In many applications, sensor nodes will be deployed in an ad-hoc fashion without careful planning. They must organize themselves to form a multihop, wireless communication network. In sensor network environments, much research has been conducted in areas such as power consumption, self-organisation techniques, routing between the sensors, and the communication between the sensor and the sink. On the other hand, real-time communication with the Quality of Service (QoS) concept in wireless sensor networks is still an open research field. Most protocols either ignore real time or simply attempt to process as fast as possible and hope that this speed is sufficient to meet the deadline. However, the introduction of real-time communication has created additional challenges in this area. The sensor node spends most of its life routing packets from one node to another until the packet reaches the sink; therefore, the node functions as a small router most of the time. Since sensor networks deal with time-critical applications, it is often necessary for communication to meet real time constraints. However, research that deals with providing QoS guarantees for real-time traffic in sensor networks is still in its infancy.This thesis presents a real-time communication framework to provide quality of service in sensor networks environments. The proposed framework consists of four components: First, present an analytical model for implementing Priority Queuing (PQ) in a sensor node to calculate the queuing delay. The exact packet delay for corresponding classes is calculated. Further, the analytical results are validated through an extensive simulation study. Second, report on a novel analytical model based on a limited service polling discipline. The model is based on an M/D/1 queuing system (a special class of M/G/1 queuing systems), which takes into account two different classes of traffic in a sensor node. The proposed model implements two queues in a sensor node that are served in a round robin fashion. The exact queuing delay in a sensor node for corresponding classes is calculated. Then, the analytical results are validated through an extensive simulation study. Third, exhibit a novel packet delivery mechanism, namely the Multiple Level Stateless Protocol (MLSP), as a real-time protocol for sensor networks to guarantee the traffic in wireless sensor networks. MLSP improves the packet loss rate and the handling of holes in sensor network much better than its counterpart, MMSPEED. It also introduces the k-limited polling model for the first time. In addition, the whole sending packets dropped significantly compared to MMSPEED, which it leads to decrease the consumption power. Fourth, explain a new framework for moving data from the sink to the user, at a low cost and low power, using the Universal Mobile Telecommunication System (UMTS), which is standard for the Third Generation Mobile System (3G). The integration of sensor networks with the 3G mobile network infrastructure will reduce the cost of building new infrastructures and enable the large-scale deployment of sensor networks
|
Page generated in 0.0683 seconds