Algorithm for A Connected Dominating Set in Wireless Networks,Used

Algorithm for A Connected Dominating Set in Wireless Networks,Used

In Stock
SKU: DADAX365934723X
Brand: LAP Lambert Academic Publishing
Condition: New
$83.54
Quantity
Add to wishlist
Add to compare
Sold by Ergodebooks, an authorized reseller.

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

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

A wireless adhoc network is a collection of wireless mobile nodes forming a temporary network without the aid of any established infrastructure or centralized administration. The wireless networks face challenges to form an optimal routing protocol. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. Routing based on a connected dominating set is a Efficient approach, where the searching space for a route is reduced to nodes in the set, The proposed algorithm is an enhancement of the distributed algorithm proposed by Wu and Li. In this book, we propose a simple and efficient distributed algorithm for calculating connected dominating set in adhoc wireless networks, where connections of nodes are determined by their geographical distances. We also propose an update/recalculation algorithm for the connected dominating set when the topology of the adhoc wireless network changes dynamically. The simulation results show that the average dominating set of nodes decreased considerable after applying the new algorithm. Our approach can be potentially used in designing efficient routing algorithms based on a connected dominating set.

⚠️ 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