A channel access scheme for large dense packet radio networks

Abstract

Prior work in the eld of packet radio networks has often assumed a simple success-if-exclusive model of successful reception. This simple model is insucient to model interference in large dense packet radio networks accurately. In this paper we present a model that more closely approximates communication theory and the underlying physics of radio communication. Using this model we present a decentralized channel access scheme for scalable packet radio networks that is free of packet loss due to collisions and that at each hop requires no per-packet transmissions other than the single transmission used to convey the packet to the next-hop station. We also show that with a modest fraction of the radio spectrum, pessimistic assumptions about propagation resulting in maximum-possible self-interference, and an optimistic view of future signal processing capabilities that a self-organizing packet radio network may scale to millions of stations within a metro area with raw per-station rates in the hundreds of megabits per second.

A Differential Evolution-Based Routing Algorithm for Environmental Monitoring Wireless Sensor Networks

“…A negotiation-based routing algorithm such as the sensor protocol for information via negotiation or SPIN [7] is a data-centric self-adaptive communication routing protocol. Its goal is to offset the deficiencies in the diffusion method of SPIN through the negotiation mechanism between nodes and the resource self-adaptive mechanism.…”

“…From the point of view of network layers, many routing protocols are designed and used to improve the network scalability and to extend its network life cycle for WSN applications, such as the energy-based routing protocol [5], the SPIN negotiation-based routing algorithm [6], the MTE minimum transmission energy protocol [7], and the data-centric directed diffusion protocol [8]. Among them, the routing protocol based on the clustering mechanism is used comparatively more than others [9].…”

Energy efficient topology control algorithm for multi-hop ad-hoc wireless sensor network

“…Kravets and Krishnan [5] presents a system in which mobile units wake up periodically and poll a base station for newly arrived packets. Minimum energy routing [6] saves power by choosing paths through a multi-hop ad hoc networks that minimizes the total transmit energy. This approach further extended by Chang et al [7] to maximize overall network lifetime by distributing energy consumption fairly.…”

Applying an SOM Neural Network to Increase the Lifetime of Battery-Operated Wireless Sensor Networks

“…Furthermore, using a conventional multi-hop routing protocol such as Minimum Transmission Energy (MTE) (Ettus, 1998;Shepard, 1996) will also result in an equally undesirable effect. This is due to the fact that in MTE, the intermediate nodes are chosen in such a way that the sum of squared distances (and thus the total transmit energy, assuming 2 d power loss) is minimised.…”