Towards optimal broadcast in wireless networks

Haas, Zygmunt J.; Nikolov, Milen

doi:10.1145/2068897.2068935

Cited by 5 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, various reactive or on-demand routing protocols such as AODV, DSR etc utilize the concept of discovering of a route when the actual need to route data arises [14]. The route discovery mechanism depends on the broadcast operation to determine a route between a source and destination nodes.…”

Section: Broadcast Operation In Duty Cycled Wsnmentioning

confidence: 99%

Minimum energy broadcast in duty cycled wireless sensor networks

Jahan

Narayanan

2013

2013 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

Minimum Energy Broadcast in Duty Cycled Wireless Sensor NetworksMosarrat JahanWe study the problem of finding a minimum energy broadcast tree in duty cycled wireless sensor networks. In such networks, every node has a wakeup schedule and is awake and ready to receive packets or transmit in certain time slots during the schedule and asleep during the rest of the schedule. We assume that a forwarding node needs to stay awake to forward a packet to the next hop neighbor until the neighbor is awake. The minimum energy broadcast tree minimizes the number of additional time units that nodes have to stay awake in order to accomplish broadcast. We show that finding the minimum energy broadcast tree is NP-hard. We give two algorithms for finding energy-efficient broadcast trees in such networks. We performed extensive simulations to study the performance of these algorithms and compare them with previously proposed algorithms. Our results show that our algorithms exhibit the best performance in terms of average number of additional time units a node needs to be awake, as well as in terms of the smallest number of highly loaded nodes, while being competitive with previous algorithms in terms of the total number of transmissions and delay.iii

show abstract

Section: Broadcast Operation In Duty Cycled Wsnmentioning

confidence: 99%

Minimum energy broadcast in duty cycled wireless sensor networks

Jahan

Narayanan

2013

2013 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

show abstract

“…Haas and Nikolov [6] introduce a timing mechanism that allows covering all nodes in a network. This solution, however, is not suitable when multiple messages are being simultaneously disseminated from different sources, neither does it consider communication errors, such as MAC collisions or signal attenuation.…”

Section: Related Workmentioning

confidence: 99%

Revisiting Gossip-Based Ad-Hoc Routing

Gaba

Voulgaris

Iwanicki

et al. 2012

2012 21st International Conference on Computer Communications and Networks (ICCCN)

View full text Add to dashboard Cite

Abstract-We focus on a popular message dissemination protocol for wireless ad-hoc networks, GOSSIP3. Our contribution is twofold. First, we perform an extensive experimental evaluation of GOSSIP3 under fully utilized wireless channel and across diverse node densities. We identify the parameters of GOSSIP3 that need special configuration for the protocol to operate optimally. Second, we devise a self-configuration algorithm for GOSSIP3 that allows the protocol to work optimally for any network. We demonstrate through simulations that our protocol significantly outperforms the default configuration of GOSSIP3.

show abstract

“…The issues of the MANET to be dealt are lack of centralized management, reachability problem and topological challenges where mobility of nodes, scalable nodes, and relationship among nodes need to be taken into account . In order to increase the efficiency of the MANET in such environment, the broadcasting overhead must be under consider maintaining the packet delivery ratio with respect to the on demand requirement . The challenges and desired features for an efficient and reliable rebroadcasting algorithm are: Broadcast multimedia voice hello message should reach all the network nodes. Need of local neighborhood one‐hop information. Reduction in the multimedia voice messages received multiple times by a network node. Condense the broadcast overhead‐ hello multimedia voice message. Minimal delay time needed for the broadcast multimedia voice message to be received by the nodes in the network. The overall organization of this research method is given as follows: In this section, detailed introduction about the MANET and broadcasting techniques has been given.…”

Section: Introductionmentioning

confidence: 99%

On demand knowledge‐based memory‐aided rebroadcast algorithm for multimedia voice data transmission in MANET

Kanthavel¹,

Banumathi²,

Dhaya³

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary MANET refers to wireless networks in which mobile nodes can be easily adapted to change the location dynamically due to their mobility and offers flexibility in the network configuration. An efficient mechanism for reliable exchanging of the multimedia voice messages through MANET nodes is achieved by route discovery of broadcasting operation. A major problem in such systems is the broadcast overhead and retransmission associated with high dense network and less reachability in sparse network. In systems of vastly dynamic nature, to reduce this broadcast overhead in nodes and to increase the reachability in static or semi static nodes in an environment, an enhanced mechanism shore up called On Demand Knowledge‐Based Memory‐Aided Rebroadcast Algorithm for Multimedia voice Data Transmission in MANET (OMRA) is herewith proposed, which operates on both dense and sparse network. In this scheme, hello multimedia voice messages are broadcast to collect one‐hop neighbor information such as mobility factor, node velocity, node density ratio and uncovered neighbors. Additionally, it determines and preserves inquiry data of mobile nodes when the mobility factor is low ensue in sparse network. By considering these varying nature the rebroadcast delay and rebroadcast probability are adjusted adaptively to decide whether to rebroadcast the inward multimedia voice messages. This paper concentrates only on broadcasting the multimedia voice message through MANET nodes in a reliable manner. The performance study of this work is analyzed by various existing algorithms in the literature such as flooding, Gossip1, DBA, and NCPR. The experimental results proves that the proposed OMRA has got an edge over the existing broadcast schemes in terms of broadcast overhead and retransmission of multimedia voice messages, especially to increase reachability in sparse networks.

show abstract

Towards optimal broadcast in wireless networks

Cited by 5 publications

References 10 publications

Minimum energy broadcast in duty cycled wireless sensor networks

Minimum energy broadcast in duty cycled wireless sensor networks

Revisiting Gossip-Based Ad-Hoc Routing

On demand knowledge‐based memory‐aided rebroadcast algorithm for multimedia voice data transmission in MANET

Contact Info

Product

Resources

About