1,060 research outputs found
A survey of flooding, gossip routing, and related schemes for wireless multi- hop networks
Flooding is an essential and critical service in computer networks that is
used by many routing protocols to send packets from a source to all nodes in
the network. As the packets are forwarded once by each receiving node, many
copies of the same packet traverse the network which leads to high redundancy
and unnecessary usage of the sparse capacity of the transmission medium.
Gossip routing is a well-known approach to improve the flooding in wireless
multi-hop networks. Each node has a forwarding probability p that is either
statically per-configured or determined by information that is available at
runtime, e.g, the node degree. When a packet is received, the node selects a
random number r. If the number r is below p, the packet is forwarded and
otherwise, in the most simple gossip routing protocol, dropped. With this
approach the redundancy can be reduced while at the same time the reachability
is preserved if the value of the parameter p (and others) is chosen with
consideration of the network topology. This technical report gives an overview
of the relevant publications in the research domain of gossip routing and
gives an insight in the improvements that can be achieved. We discuss the
simulation setups and results of gossip routing protocols as well as further
improved flooding schemes. The three most important metrics in this
application domain are elaborated: reachability, redundancy, and management
overhead. The published studies used simulation environments for their
research and thus the assumptions, models, and parameters of the simulations
are discussed and the feasibility of an application for real world wireless
networks are highlighted. Wireless mesh networks based on IEEE 802.11 are the
focus of this survey but publications about other network types and
technologies are also included. As percolation theory, epidemiological models,
and delay tolerant networks are often referred as foundation, inspiration, or
application of gossip routing in wireless networks, a brief introduction to
each research domain is included and the applicability of the particular
models for the gossip routing is discussed
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges
A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks
"Hierarchical routing in sensor networks using κ-dominating sets "
Michael Q. Rieck is an associate professor at Drake University in Des Moines, Iowa, USA. He holds a Ph. D. in mathematics from the University of South Florida. His primary research interests are in the areas of camera tracking and ad hoc wireless networks. He has also published results in the areas of triangle geometry, discrete mathematics, linear algebra, finite fields and association schemes.For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, called k-SPR sets. Such a set can serve as a virtual backbone to facilitate shortest path routing, as introduced in [4] and [14]. When employed in a hierarchical fashion, together with a hybrid (partly proactive, partly reactive) strategy, the κ-SPR set methods become highly scalable, resulting in guaranteed minimal path routing, with comparatively little overhead. © Springer-Verlag Berlin Heidelberg 2005
Transport mechanism for wireless micro sensor network
Wireless sensor network (WSN) is a wireless ad hoc network that consists of very large number of tiny sensor nodes communicating with each other with limited power and memory constrain. WSN demands real-time routing which requires messages to be delivered within their end-to-end deadlines (packet lifetime). This report proposes a novel real-time with load distribution (RTLD) routing protocol that provides real time data transfer and efficient distributed energy usage in WSN. The RTLD routing protocol ensures high packet throughput with minimized packet overhead and prolongs the lifetime of WSN. The routing depends on optimal forwarding (OF) decision that takes into account of the link quality, packet delay time and the remaining power of next hop sensor nodes. RTLD routing protocol possesses built-in security measure. The random selection of next hop node using location aided routing and multi-path forwarding contributes to built-in security measure. RTLD routing protocol in WSN has been successfully studied and verified through simulation and real test bed implementation. The performance of RTLD routing in WSN has been compared with the baseline real-time routing protocol. The simulation results show that RTLD experiences less than 150 ms packet delay to forward a packet through 10 hops. It increases the delivery ratio up to 7 % and decreases power consumption down to 15% in unicast forwarding when compared to the baseline routing protocol. However, multi-path forwarding in RTLD increases the delivery ratio up to 20%. In addition, RTLD routing spreads out and balances the forwarding load among sensor nodes towards the destination and thus prolongs the lifetime of WSN by 16% compared to the baseline protocol. The real test bed experiences only slight differences of about 7.5% lower delivery ratio compared to the simulation. The test bed confirms that RTLD routing protocol can be used in many WSN applications including disasters fighting, forest fire detection and volcanic eruption detection
Target localization and autonomous navigation using wireless sensor networks -a pseudogradient algorithm approach
pre-printAutonomous mobile robots (AMRs) operating in unknown environments face twin challenges: 1) localization and 2) efficient directed navigation. This paper describes a two-tiered approach to solving these challenges: 1) by developing novel wireless-sensor-network (WSN)-based localization methods and 2) by using WSN-AMR interaction for navigation. The goal is to have an AMR travel from any point within a WSN-covered region to an identified target location without the aid of global sensing and position information. In this research, the target is reached as follows: 1) by producing a magnitude distribution within the WSN region that has a target-directed pseudogradient (PG) and 2) by having the WSN efficiently navigate the AMRs using the PG. This approach utilizes only the topology of the network and the received signal strength (RSS) among the sensor nodes to create the PG. This research shows that, even in the absence of global positioning information, AMRs can successfully navigate toward a target location using only the RSS in their local neighborhood to compute an optimal path. The utility of the proposed scheme is proved through extensive simulation and hardware experiments
Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis
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.https://doi.org/10.3390/s15092220
- …