Topology-based Routing for Xmesh in Dense Wireless Sensor Networks

Topology-based Routing for Xmesh in Dense Wireless Sensor Networks

4.11 - 1251 ratings - Source

In an effort to limit the path lengths, we propose to impose an underlying connectivity graph for XMesh [5] [6]. The underlying connectivity graph is a virtual topology of the network, hence the name qTopology-Based Routingq. Instead of being forwarded to the best link quality node among all neighbors within communication range, a packet is being routed according to the shortest path routing of the underlying graph. In the event that multiple shortest paths exist, the one with the best link quality is chosen. The purpose of the underlying connectivity graph is to impose a virtual topology that facilitates routing and guarantees a bounded path length. An ideal underlying graph should guarantee a small number of hops between nodes and should possess a simple routing algorithm.regulator) circuit diagram shown in Fig. 3.10. It placed a constant current across a resistor. The LM317 series of adjustable 3-terminal positive voltage regulators is capable of supplying in excess of 1.5A over a 1.2V to 37V output range [39].

Title:Topology-based Routing for Xmesh in Dense Wireless Sensor Networks
Author: Lei Wang
Publisher:ProQuest - 2007

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.

Click button below to register and download Ebook
Privacy Policy | Contact | DMCA