1,785 research outputs found
Towards Opportunistic Data Dissemination in Mobile Phone Sensor Networks
Recently, there has been a growing interest within the research community in developing opportunistic routing protocols. Many schemes have been proposed; however, they differ greatly in assumptions and in type of network for which they are evaluated. As a result, researchers have an ambiguous understanding of how these schemes compare against each other in their specific applications. To investigate the performance of existing opportunistic routing algorithms in realistic scenarios, we propose a heterogeneous architecture including fixed infrastructure, mobile infrastructure, and mobile nodes. The proposed architecture focuses on how to utilize the available, low cost short-range radios of mobile phones for data gathering and dissemination. We also propose a new realistic mobility model and metrics. Existing opportunistic routing protocols are simulated and evaluated with the proposed heterogeneous architecture, mobility models, and transmission interfaces. Results show that some protocols suffer long time-to-live (TTL), while others suffer short TTL. We show that heterogeneous sensor network architectures need heterogeneous routing algorithms, such as a combination of Epidemic and Spray and Wait
Resilient networking in wireless sensor networks
This report deals with security in wireless sensor networks (WSNs),
especially in network layer. Multiple secure routing protocols have been
proposed in the literature. However, they often use the cryptography to secure
routing functionalities. The cryptography alone is not enough to defend against
multiple attacks due to the node compromise. Therefore, we need more
algorithmic solutions. In this report, we focus on the behavior of routing
protocols to determine which properties make them more resilient to attacks.
Our aim is to find some answers to the following questions. Are there any
existing protocols, not designed initially for security, but which already
contain some inherently resilient properties against attacks under which some
portion of the network nodes is compromised? If yes, which specific behaviors
are making these protocols more resilient? We propose in this report an
overview of security strategies for WSNs in general, including existing attacks
and defensive measures. In this report we focus at the network layer in
particular, and an analysis of the behavior of four particular routing
protocols is provided to determine their inherent resiliency to insider
attacks. The protocols considered are: Dynamic Source Routing (DSR),
Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing
(RWR)
M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol for WSNs
In this research work, we advise gateway based energy-efficient routing
protocol (M-GEAR) for Wireless Sensor Networks (WSNs). We divide the sensor
nodes into four logical regions on the basis of their location in the sensing
field. We install Base Station (BS) out of the sensing area and a gateway node
at the centre of the sensing area. If the distance of a sensor node from BS or
gateway is less than predefined distance threshold, the node uses direct
communication. We divide the rest of nodes into two equal regions whose
distance is beyond the threshold distance. We select cluster heads (CHs)in each
region which are independent of the other region. These CHs are selected on the
basis of a probability. We compare performance of our protocol with LEACH (Low
Energy Adaptive Clustering Hierarchy). Performance analysis and compared
statistic results show that our proposed protocol perform well in terms of
energy consumption and network lifetime.Comment: IEEE 8th International Conference on Broadband and Wireless
Computing, Communication and Applications (BWCCA'13), Compiegne, Franc
Energy-efficient region shift scheme to support mobile sink group in wireless sensor networks
© 2017 by the authors. Licensee MDPI, Basel, Switzerland. Mobile sink groups play crucial roles to perform their own missions in many wireless sensor network (WSN) applications. In order to support mobility of such sink groups, it is important to design a mechanism for effective discovery of the group in motion. However, earlier studies obtain group region information by periodic query. For that reason, the mechanism leads to significant signaling overhead due to frequent flooding for the query regardless of the group movement. Furthermore, the mechanism worsens the problem by the flooding in the whole expected area. To deal with this problem, we propose a novel mobile sink group support scheme with low communication cost, called Region-Shift-based Mobile Geocasting Protocol (RSMGP). In this study, we utilize the group mobility feature for which members of a group have joint motion patterns. Thus, we could trace group movement by shifting the region as much as partial members move out of the previous region. Furthermore, the region acquisition is only performed at the moment by just deviated members without collaboration of all members. Experimental results validate the improved signaling overhead of our study compared to the previous studies
An objective based classification of aggregation techniques for wireless sensor networks
Wireless Sensor Networks have gained immense popularity in recent years due to their ever increasing capabilities and wide range of critical applications. A huge body of research efforts has been dedicated to find ways to utilize limited resources of these sensor nodes in an efficient manner. One of the common ways to minimize energy consumption has been aggregation of input data. We note that every aggregation technique has an improvement objective to achieve with respect to the output it produces. Each technique is designed to achieve some target e.g. reduce data size, minimize transmission energy, enhance accuracy etc. This paper presents a comprehensive survey of aggregation techniques that can be used in distributed manner to improve lifetime and energy conservation of wireless sensor networks. Main contribution of this work is proposal of a novel classification of such techniques based on the type of improvement they offer when applied to WSNs. Due to the existence of a myriad of definitions of aggregation, we first review the meaning of term aggregation that can be applied to WSN. The concept is then associated with the proposed classes. Each class of techniques is divided into a number of subclasses and a brief literature review of related work in WSN for each of these is also presented
Using Hybrid Angle/Distance Information for Distributed Topology Control in Vehicular Sensor Networks
In a vehicular sensor network (VSN), the key design issue is how to organize vehicles effectively, such that the local network topology can be stabilized quickly. In this work, each vehicle with on-board sensors can be considered as a local controller associated with a group of communication members. In order to balance the load among the nodes and govern the local topology change, a group formation scheme using localized criteria is implemented. The proposed distributed topology control method focuses on reducing the rate of group member change and avoiding the unnecessary information exchange. Two major phases are sequentially applied to choose the group members of each vehicle using hybrid angle/distance information. The operation of Phase I is based on the concept of the cone-based method, which can select the desired vehicles quickly. Afterwards, the proposed time-slot method is further applied to stabilize the network topology. Given the network structure in Phase I, a routing scheme is presented in Phase II. The network behaviors are explored through simulation and analysis in a variety of scenarios. The results show that the proposed mechanism is a scalable and effective control framework for VSNs
- âŠ