IEEE Transactions on Parallel and Distributed Systems
Dominating-set-based routing in ad hoc wireless networks
Handbook of wireless networks and mobile computing
Location updates for efficient routing in ad hoc networks
Handbook of wireless networks and mobile computing
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
ZBP: A Zone-Based Broadcasting Protocol for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Optimized Broadcast Protocol for Sensor Networks
IEEE Transactions on Computers
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Virtual backbone based on MCDS for topology control in wireless ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
Journal of Global Optimization
Tree based broadcast in ad hoc networks
Mobile Networks and Applications
Fast distributed dominating set based routing in large scale MANETs
Computer Communications
Energy efficient all-to-all broadcast in all-wireless networks
Information Sciences: an International Journal
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
A Serial MIS Based CDS Constructing Algorithm for Wireless Networks
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
CMAB: cross layer mobility-adaptive broadcasting in mobile ad hoc networks
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Journal of Mathematical Modelling and Algorithms
A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks
INFORMS Journal on Computing
| Hi-index | 0.00 |
In a multihop wireless network, each node has a transmission radius and is able to send a message to one of its neighbors (one-to-one) or all of its neighbors (one-to-all) that are located within the radius. In a broadcasting task, a source node sends the same message to all the nodes in the network. Some existing solutions apply rebroadcasting from each clusterhead or border node in a clustered structure. In this paper, we propose to reduce the communication overhead of broadcasting algorithm by applying the concept of internal nodes. The maintenance of internal nodes requires much less communication overhead than the maintenance of cluster structure of nodes. In one-to-all broadcasting, only internal nodes forward the message, while in the one-to-one case messages are forwarded on the edges that connect two internal nodes, and on edges that connect each non-internal node with its closest internal node. Existing notions of internal nodes are improved by using node degrees instead of their IDs (which are used only as secondary keys) in internal node decisions. Highest node degrees are also proposed for reducing the number of clusterheads and border nodes in a clustering algorithm. Further savings are obtained if GPS and the concept of planar subgraphs are used for one-to-one networks. In case of one-to-all model, no re-broadcast is needed if all neighbors already received the message. The important features of proposed algorithms are their reliability (reaching all nodes in the absence of message collisions), significant savings in the rebroadcasting, and their localized and parameterless behavior. The reduction in communication overhead for broadcasting task, with respect to existing methods, is measured experimentally.