6,181 research outputs found
AMCTD: Adaptive Mobility of Courier nodes in Threshold-optimized DBR Protocol for Underwater Wireless Sensor Networks
In dense underwater sensor networks (UWSN), the major confronts are high
error probability, incessant variation in topology of sensor nodes, and much
energy consumption for data transmission. However, there are some remarkable
applications of UWSN such as management of seabed and oil reservoirs,
exploration of deep sea situation and prevention of aqueous disasters. In order
to accomplish these applications, ignorance of the limitations of acoustic
communications such as high delay and low bandwidth is not feasible. In this
paper, we propose Adaptive mobility of Courier nodes in Threshold-optimized
Depth-based routing (AMCTD), exploring the proficient amendments in depth
threshold and implementing the optimal weight function to achieve longer
network lifetime. We segregate our scheme in 3 major phases of weight updating,
depth threshold variation and adaptive mobility of courier nodes. During data
forwarding, we provide the framework for alterations in threshold to cope with
the sparse condition of network. We ultimately perform detailed simulations to
scrutinize the performance of our proposed scheme and its comparison with other
two notable routing protocols in term of network lifetime and other essential
parameters. The simulations results verify that our scheme performs better than
the other techniques and near to optimal in the field of UWSN.Comment: 8th International Conference on Broadband and Wireless Computing,
Communication and Applications (BWCCA'13), Compiegne, Franc
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
Predicting topology propagation messages in mobile ad hoc networks: The value of history
This research was funded by the Spanish Government under contracts TIN2016-77836-C2-1-R,TIN2016-77836-C2-2-R, and DPI2016-77415-R, and by the Generalitat de Catalunya as Consolidated ResearchGroups 2017-SGR-688 and 2017-SGR-990.The mobile ad hoc communication in highly dynamic scenarios, like urban evacuations or search-and-rescue processes, plays a key role in coordinating the activities performed by the participants. Particularly, counting on message routing enhances the communication capability among these actors. Given the high dynamism of these networks and their low bandwidth, having mechanisms to predict the network topology offers several potential advantages; e.g., to reduce the number of topology propagation messages delivered through the network, the consumption of resources in the nodes and the amount of redundant retransmissions. Most strategies reported in the literature to perform these predictions are limited to support high mobility, consume a large amount of resources or require training. In order to contribute towards addressing that challenge, this paper presents a history-based predictor (HBP), which is a prediction strategy based on the assumption that some topological changes in these networks have happened before in the past, therefore, the predictor can take advantage of these patterns following a simple and low-cost approach. The article extends a previous proposal of the authors and evaluates its impact in highly mobile scenarios through the implementation of a real predictor for the optimized link state routing (OLSR) protocol. The use of this predictor, named OLSR-HBP, shows a reduction of 40–55% of topology propagation messages compared to the regular OLSR protocol. Moreover, the use of this predictor has a low cost in terms of CPU and memory consumption, and it can also be used with other routing protocols.Peer ReviewedPostprint (published version
A Multi-hop Topology Control Based on Inter-node Range Measurement for Wireless Sensor Networks Node Localization
In centralized range-based localization techniques, sufficiency of inter-node range information received by the base station strongly affects node position estimation results. Successful data aggregation is influenced by link stability of each connection of routes, especially in a multi-hop topology model. In general, measuring the inter-node range is only performed for position determination purposes. This research introduces the use of inter-node range measurement information for link selection in a multi-hop route composition in order to increase the rate of data aggregation. Due to irregularity problems of wireless media, two areas of node communication have been considered. The regular communication area is the area in which other nodes are able to perform symmetrical communication to the node without failure. The irregular area is the area in which other nodes are seldom able to communicate. Due to its instability, some existing methods tried to avoid the irregular area completely. The proposed method, named Virtual Boundaries (VBs) prioritizes these areas. The regular communication area’s nodes have high priority to be selected as link vertices; however, when there is no link candidate inside this area, nodes within the irregular area will be selected with respect to their range to the parent node. This technique resulted in a more robust multi-hop topology that can reduce isolated node numbers and increase the percentage of data collected by the base station accordingly
- …