Routing Algorithms for 3D Ad Hoc Networks: Efficient positionbased routing algorithms with the associated preprocessing algori,Used

Routing Algorithms for 3D Ad Hoc Networks: Efficient positionbased routing algorithms with the associated preprocessing algori,Used

In Stock
SKU: DADAX3659175153
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$92.41
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

In positionbased routing algorithms, the nodes use the geographical information to make routing decisions. Recent research in this field addresses such routing algorithms in twodimensional (2D) space. However, in real applications, the nodes may be distributed in threedimensional (3D) space. Transition from 2D to 3D is not always easy, since many problems in 3D are significantly harder than their 2D counterparts. This book focuses on providing reliable and efficient positionbased routing algorithms with the associated preprocessing algorithms for various 3D ad hoc networks. The first part of this book proposes a constant time algorithms that construct an independent dominating set and connected dominating set of a Unit Disk Graph in a 3D environment. The second part of the book proposes an implementation of 3D versions of many current 2D positionbased routing algorithms in addition of creating many new algorithms that are specially designed for a 3D environment. It has been showed that these new routing algorithms can achieve nearly guaranteed delivery while discovering routes significantly closer in length to a shortest path.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed