Content uploaded by Boleslaw K. Szymanski
Author content
All content in this area was uploaded by Boleslaw K. Szymanski
Content may be subject to copyright.
A preview of the PDF is not available
A Self-Selection Technique for Flooding and Routing in Wireless Ad-Hoc Networks
Abstract and Figures
There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor. Self-selection employs a prioritized transmission back-off delay scheme in which each node’s delay of transmitting a signal is dependent on the probability of the node’s ability to best perform a pertinent task, and in turn, enables the node to autonomously select itself for the task. We demonstrate the benefits of self-selection in two basic wireless ad hoc network communication algorithms: flooding and routing. By relating back-off delay to the signal strength of a received packet, we design an efficient variant of conventional flooding called Signal Strength Aware Flooding. By using distance-to-destination to derive back-off delay, we design a novel and fault-tolerant wireless ad hoc network routing protocol named Self-Selective Routing.
Content may be subject to copyright.
... For the environments, backoff-based OR protocols [9]- [12] can make a forwarding decision based on a backoff time calculated by using hop counts to adapt to the dynamic environments. However, in these methods, each node records the cost information and autonomously participates the packet forwarding by using the information. ...
... In backoff-based OR protocols [9]- [12] can adapt the frequent topological changes to select a forwarder based on the backoff time autonomously. We introduce listen first, broadcast later (LFBL) [10] as one of the backoff-based routing protocols as below. ...
This paper proposes an ant-inspred backoff-based
opportunistic routing protocol which optimizes the forwarding
area based on the concept of ant colony optimization. In the
traditional backoff-based opportunistic routing protocols, they
may increase unnecessary packet forwarding to expand the
forwarding area since a receiver of data packet autonomously
participates the packet forwarding. Hence, to deal with the
forwarding area expansion, the proposed method suppresses the
potential forwarders to adjust the backoff time based on their
pheromone levels. Finally, this paper clarifies the performance of
the proposed method in comparison with the conventional method
using computer simulations. The results show that the proposed
method can reduce the network resource consumptions and
the end-to-end delay while keeping higher packet transmission
success rate.
... For the environments, backoff-based OR protocols [9]- [12] can make a forwarding decision based on a backoff time calculated by using hop counts to adapt to the dynamic environments. However, in these methods, each node records the cost information and autonomously participates the packet forwarding by using the information. ...
... In backoff-based OR protocols [9]- [12] can adapt the frequent topological changes to select a forwarder based on the backoff time autonomously. We introduce listen first, broadcast later (LFBL) [10] as one of the backoff-based routing protocols as below. ...
In mobile ad hoc networks, radio interference and
mobility of nodes may degrade the packet arrival rate due to the
dynamic topological change. Then, traditional reactive routing
protocols may cause huge network resource consumption due
to the route request flooding for discovering the destination.
To solve the above issue, flooding area restriction methods can
reduce the unnecessary control messages to narrow the flooding
area based on the location information. However, each node
must share location information before sending route requests
via control messages. Besides, it is also difficult to share the
correct location information of nodes due to the mobility of nodes.
This paper proposes a flooding area restriction method to reduce
the unnecessary control messages to determine the flooding
area by sharing the location information via a mobile network.
In addition, computer simulations reveal the effectiveness of
the proposed method in comparison with a traditional routing
protocol.
... Chen et al. [7] propose that the self-selection technique for the routing and the wireless ad hoc network enables the communication point-to-point. Then according to this technique, the implementation of the communication, the transmission of the data, and the processing of the nodes in the communication path can be enabled and analyzed. ...
Transferring data in the mobile ad hoc network can be enabled to analyze data transferring and the network that manages the data and route them into the VPN-based routing. Here is the process of maintaining the gateway for the analysis. The main problem here is the routing of the data packets, and the analysis of the nodes in the form of packages is the main issue in this study. To fix this, troubleshooting problems can be enabled for the packets which reach the destinations and the echo response. The primary technique used in this study is energy efficient geographic routing protocol and reward-based intelligent Ad hoc routing is used for the analysis. The energy-efficient geographic routing protocol enables the EGRPM method to reduce the sensor nodes and the WSN. This allows gathering the data and the nodes to maintain the geographic way. Reward-based intelligent Ad hoc routing is used in automatic decision-making, and the analysis of the system to produce the selection action for the research is reinforcement learning. This results from the study of the configuration and the analysis of the data in the ad hoc network. This enables the formation of learning about the routing protocol and facilitates the current data transfer to the research done in the ad hoc networks. This data analysis in the mobile network helps analyze the system and the entire data management.
... Most wireless networks use broadcast antennas for communication, unlike typical wired networks that use pointto-point communication. For multi-hop routing, SSR [15,16] has the characteristic of using broadcast communication without emulating point-to-point communication [22]. Therefore, in SSR, a sensing node transmitting a packet does not need to use a forwarding table to specify a neighbor to send the packet to the destination. ...
... To address this problem, opportunistic routing (OR) [1], which dynamically selects a forwarder based on various metrics [2]- [8], has been proposed. In ad hoc and sensor networks, backoff-based OR [6]- [8] has been proposed. The backoffbased OR selects a forwarder among packet receivers based on a random backoff time calculated from hop counts. ...
Backoff-based opportunistic routing can adaptively select a forwarder among receivers based on a random backoff time. However, it cannot correctly work in an environment with asymmetric links where the communication quality differs in the directions. To solve this problem, a confirmation method for link symmetry and destination reachability was previously proposed. However, the method can only confirm link symmetry with one neighbor and destination reachability for a single terminal in a single packet transmission. This paper proposes a fast confirmation method to verify the link symmetry of multiple terminals in single packet transmissions. The performance of the proposed method is clarified with simulations.
... • Dynamic Source Routing (DSR): The DSR routing protocol uses the source routing method in which the source node keeps the complete route in the packet header to reach the desired destination [20]. Therefore, the intermediate nodes do not need to update the information on the crossing road. ...
Internet of vehicles (IoV) can be considered as a superset of vehicular ad-hoc networks (VANETs). It extends VANET’s structure, applications and scale. Unlike, the traditional intelligent transportation system (ITS), IoV focus more on information interactions between vehicles, roadside units (RSU) and humans. The principal aim is to make people obtain road traffic information easily and in real-time, to ensure the travel convenience, and to increase the travel comfort. The goal behind the Internet of vehicles is essentially to be used in urban traffic environment to ensure network access for passengers and drivers. The environment of the IoV is the combination of different wireless network environment as well as road conditions. Despite its continuing expansion, the IOV contains different radio access technologies that lead to a heterogeneous network, and make it more crucial than the VANET. These drawbacks pose numerous challenges, especially the routing one. In IoV environment, the routing protocol must cope with events such as link failure and to find the best route to propagate the data toward the desired destination. In this paper, we mainly focus on surveying the IoV routing protocols, hence we present and compare unicast, multicast and broadcast protocols.
... SHR is a flat-based; multipath protocol for fault-tolerant WSN. It is an extension of Self Selective Routing (SSR) where each node measures its distance to destination by the number of hops [5], [7]. In SHR, a packet may be transferred through multi-paths especially in case of faulty sensors. ...
In this paper, a novel energy-aware routing strategy for Wireless Sensor Networks (WSN) is developed. The proposed strategy improves on the Self Healing Routing protocol (SHR), by periodically switching off different sensors while maintaining a small number of active nodes. These active nodes are carefully selected via a negotiation protocol to achieve proper terrain coverage. The proposed strategy is implemented and integrated into the SENSE simulation environment [1]. Experimental results illustrate the tradeoff between different performance parameters and the improvement in network lifetime. Different scenarios are implemented to study the effect of the number of active nodes as well as the scheduling time for inactive ones. The presented results can serve as a guide for selecting operating parameters in different scenarios.
... Many traditional network protocols such as AODV and DSR [13] and some newer ones [14][15][16] only use topological information and have limited scalability. Since many critical applications such as monitoring, tracking and targeting applications must have the locations of objects and nodes, many localization techniques [17][18][19][20][21] have been proposed. ...
In many applications of Wireless Sensor Networks (WSNs), the network has a few mobile sinks in addition to a large number of static sensor nodes that gather information from their surrounding environment. The static sensor nodes in such applications use a location service to find the location of a mobile sink. Most of the proposed location services are useful in mobile ad hoc networks and are not efficient for WSNs. Furthermore, new protocols specifically designed for WSNs are not load balanced. Some sensor nodes relay more packets and deplete their energy quickly, hence reducing the network lifetime dramatically. In this paper, we propose a location service called Load Balanced Location Service (LBLS) for WSNs containing a few mobile sinks. LBLS selects four nodes in the network outline and only uses the location of these nodes. LBLS do not deplete the energy of specific nodes comparing to other mechanisms that forward location information messages toward selected nodes. We formally prove that in LBLS every sensor node can always locate any mobile node in the network. By using exhaustive simulation, we show that LBLS is a load balanced location service. Simulation results demonstrate the superiority of LBLS regarding the load balancing factor compared to most available related location services.
In wireless multi-hop networks such as ad hoc networks and sensor networks, backoff-based opportunistic routing protocols, which make a forwarding decision based on backoff time, have been proposed. In the protocols, each potential forwarder calculates the backoff time based on the product of a weight and global scaling factor. The weight prioritizes potential forwarders and is calculated based on hop counts to the destination of a sender and receiver. The global scaling factor is a predetermined value to map the weight to the actual backoff time. However, there are three common issues derived from the global scaling factor. First, it is necessary to share the predetermined global scaling factor with a centralized manner among all terminals properly for the backoff time calculation. Second, it is almost impossible to change the global scaling factor during the networks are being used. Third, it is difficult to set the global scaling factor to an appropriate value since the value differs among each local surrounding of forwarders. To address the aforementioned issues, this paper proposes a novel decentralized local scaling factor control without relying on a predetermined global scaling factor. The proposed method consists of the following three mechanisms: (1) sender-centric local scaling factor setting mechanism in a decentralized manner instead of the global scaling factor, (2) adaptive scaling factor control mechanism which adapts the local scaling factor to each local surrounding of forwarders, and (3) mitigation mechanism for excessive local scaling factor increases for the local scaling factor convergence. Finally, this paper evaluates the backoff-based opportunistic routing protocol with and without the proposed method using computer simulations.
Clustering-based routing strategies have been widely studied in the context of wireless sensor network for energy-efficient data communication. However, application of clustering-based routing to hard real-time wireless network is still an open challenge. In this work, we study the integration of clustering-based routing with WirelessHART for energy-efficient real-time wireless data communication. We re-design the clustering strategy to incorporate node transmission frequency so that the end-to-end delay of each data delivery is captured early in the clustering phase. Moreover, the data aggregation within a cluster is taken care of in the superframe design phase to ensure the stringent timing requirements are met. Experimental results show that the proposed data communication framework prolongs the WirelessHART network by effectively reducing the number of data packages transmitted. Meanwhile, the end-to-end delay of each data delivery can be always guaranteed.
Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to perform distributed sensing of environmental phenomena. In this paper, we explore the directed diffusion paradigm for such coordination. Directed diffusion is datacentric in that all communication is for named data. All nodes in a directed diffusion-based network are application-aware. This enables diffusion to achieve energy savings by selecting empirically good paths and by caching and processing data in-network. We explore and evaluate the use of directed diffusion for a simple remote-surveillance sensor network.
This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a shared-channel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases, and increases as the density of the network increases. For example, our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Span integrates nicely with 802.11 - when run in conjunction with the 802.11 power saving mode, Span improves communication latency, capacity, and system lifetime.
The synthetic compound Oltipraz, 5-(2-pyrazinyl)-4-methyl-1,2-dithiole-3-thione, is related to the 1,2-dithiolthiones naturally found in cruciferous vegetables, the consumption of which has been epidemiologically associated with reduced frequency of colorectal cancers. Oltipraz has shown chemopreventive efficacy in numerous laboratory epithelial cancer models and is a potential chemopreventive, antimutagenic compound that specifically induces Phase II enzymes. Thirteen-week and 1-year toxicity studies in rats and dogs were performed to characterize the toxicities of the compound at high dosages and to support potential further development as a chemopreventive agent in clinical trials. Administration to rats by gavage for 13 weeks at dosages of 5 and 50 mg/kg/day and for 52 weeks at dosages of 10, 30, and 60 mg/kg/day produced effects on the liver and on clinical chemistry and hematology parameters. Absolute and relative liver weight increases correlated with diffuse hypertrophy in the mid- and high-dose males and centrilobular hypertrophy in the high-dose females. Granularity of hepatocyte cytoplasm was also observed. These anatomical findings were associated with dose-associated slight increases in albumin, total protein, and cholesterol in the males and a moderate increase in cholesterol only in the females. In addition, slight decreases in erythrocyte count, hemoglobin, and hematocrit and reticulocyte elevations occurred. The no effect dose was considered 10 mg/kg/day. Administration by capsule to dogs at dosages of 10 and 100 mg/kg/day for 13 weeks and of 5, 15, and 60 mg/kg/day for 52 weeks also produced effects on the same endpoints noted in the rodent studies. In the 13-week study, precipitate was observed in the bile canaliculi, and gonadal atrophy and increased pituitary weights occurred in the males. Cholesterol and alkaline phosphatase activity were slightly elevated in both studies. Decreased hematology parameters in the 13-week study also occurred. The no effect dose was considered to be 5 mg/kg/day. Oltipraz is being carefully evaluated in clinical trials as a potential antimutagenic compound.