Reducing Broadcast Redundancy in Wireless Ad-Hoc Networks with Implicit Coordination Among Forwarding Nodes

Kok, Gin-Xian; Chow, Chee-Onn; Ishii, Hiroshi

doi:10.1007/s11277-014-2127-y

Cited by 6 publications

(17 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…D th is a constant value

N_{L} = ({, \begin{matrix} italicPrimary Leaf node if L_{n} < D_{t h} \\ italicSecondary leaf node if L_{n} > D_{t h} . \end{matrix})

After the calculation of node's location, the calculation of the Uncovered Neighbor Set UCNS (n a ) of node n a is happened using equation . Neighbor table for each node is maintained and recorded to identify the unknown node's Hello multimedia voice which is received by the covered node

italicUCNS ((), n_{a}) = N ((), n_{a}) - ([], N ((), n_{a}) \cap N ((), n_{s})) - ({}, n_{s}),

where N (n s ) and N (n a ) are the neighbor sets of source node “ n s ” and “ n a .” Each node sets a rebroadcast delay T d (n a ) ,which is the proportion of the common neighbors between node n a and its upstream node n s , whenever a node receives a fresh request message from its neighbor node, which is used to exploit their uncovered neighbors set accuracy by using the following update uncovered neighbor set UCNS up (n a ) Equation . Thus it avoids duplicate or redundant multimedia voice messages.…”

Section: Proposed Methodologymentioning

confidence: 99%

“…Thus it avoids duplicate or redundant multimedia voice messages. It is being updated till the rebroadcast delay T d ( n a ) expires

{UCNS}_{u p} ((), n_{a}) = U ((), n_{a}) - ([], U ((), n_{a}) \cap N ((), n_{b})) - ({}, n_{b}) .

When a neighbor receives request message, it could calculate the rebroadcast delay according to its own neighbor list. The rebroadcast delay T d ( n a ) of node n a is defined as follows: After determining the rebroadcast delay, the node can set its own timer for broadcasting multimedia voice message

T_{d} ((), n_{a}) = italicMaxDelay \times T_{p} ((), n_{a})

T_{p} ((), n_{a}) = ((), 1 - \frac{|N (s) \cap N (n_{a})|}{|N (s)|}),

where T p ( n a ) is the delay ratio of node n a is calculated by Equation and MaxDelay is a small constant delay .…”

Section: Proposed Methodologymentioning

confidence: 99%

“…The reasons for using rebroadcast delay are given below: Used to determine the node transmission order. Used to sufficiently exploit and disseminate the neighbor coverage knowledge more quickly. After updating the uncovered neighbor set within the rebroadcast delay then calculate the ratio of uncovered neighbors R u (n a ) and uncovered neighbor factor F u (n a ) [ ] by using the following Equations and

R_{u} ((), n_{a}) = \frac{|U (n_{a})|}{(||, N ((), n_{a})) - 1}

F_{u} ((), n_{a}) = \frac{|U (n_{a})|}{N_{c}} .

From the work of Kok et al, where N c = 5.1774 log n, and n is the number of nodes in the network that if each node attached to more than 5.1774 log n of its adjacent neighbor nodes, then the chance of the network being connected is approaching 1 as number of nodes increases. Subsequently the calculation of the Additional Coverage Ratio ACR (n a ) of node n a is done using Equation .…”

Section: Proposed Methodologymentioning

confidence: 99%

“…Hence, the ratio of uncovered nodes and node density and mobility factor may vary in time. For that, β = 0.8 the influence coefficient of R u (n a ) is set to support dynamic nature . It is used for determination of rebroadcast probability thus reduces broadcast overhead and delay.…”

Section: Proposed Methodologymentioning

confidence: 99%

“…It considers only the coverage area of transmission and not whether the nodes exist within that area. In Distance‐Based Flooding, a node compares the distance between itself and neighbor node that has previously rebroadcast a given packet . Upon reception of a previously unseen packet, a RAD is initiated and redundant packets are cached.…”

Section: Preliminary Workmentioning

confidence: 99%

See 4 more Smart Citations

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

“…D th is a constant value

N_{L} = ({, \begin{matrix} italicPrimary Leaf node if L_{n} < D_{t h} \\ italicSecondary leaf node if L_{n} > D_{t h} . \end{matrix})

italicUCNS ((), n_{a}) = N ((), n_{a}) - ([], N ((), n_{a}) \cap N ((), n_{s})) - ({}, n_{s}),

Section: Proposed Methodologymentioning

confidence: 99%

“…Thus it avoids duplicate or redundant multimedia voice messages. It is being updated till the rebroadcast delay T d ( n a ) expires

{UCNS}_{u p} ((), n_{a}) = U ((), n_{a}) - ([], U ((), n_{a}) \cap N ((), n_{b})) - ({}, n_{b}) .

T_{d} ((), n_{a}) = italicMaxDelay \times T_{p} ((), n_{a})

T_{p} ((), n_{a}) = ((), 1 - \frac{|N (s) \cap N (n_{a})|}{|N (s)|}),

where T p ( n a ) is the delay ratio of node n a is calculated by Equation and MaxDelay is a small constant delay .…”

Section: Proposed Methodologymentioning

confidence: 99%

R_{u} ((), n_{a}) = \frac{|U (n_{a})|}{(||, N ((), n_{a})) - 1}

F_{u} ((), n_{a}) = \frac{|U (n_{a})|}{N_{c}} .

Section: Proposed Methodologymentioning

confidence: 99%

Section: Proposed Methodologymentioning

confidence: 99%

Section: Preliminary Workmentioning

confidence: 99%

See 3 more Smart Citations

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

show abstract

Extended Neighborhood Knowledge based Dominant Pruning (ExDP)

Anannya

Rahman

2018

2018 5th International Conference on Networking, Systems and Security (NSysS)

View full text Add to dashboard Cite

A Framework for Disaster Mitigation Networks

Kok

Chow

Ishii

et al. 2013

AEJ

View full text Add to dashboard Cite

The existing communication infrastructure could be destroyed during a disaster and this could lead to the disruption of communication activities. Communication is extremely important during disasters; therefore, it is vital that a temporary network is quickly setup to restore communication activities. Temporary networks could be setup using programmable sensor nodes. In this paper, we present SafeNet, a framework for disaster mitigation networks using programmable sensor nodes. We discussed several aspects such as: i) placement of sensor nodes, ii) modes of operation, and iii) the required components.

show abstract

Reducing Broadcast Redundancy in Wireless Ad-Hoc Networks with Implicit Coordination Among Forwarding Nodes

Cited by 6 publications

References 17 publications

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

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

Extended Neighborhood Knowledge based Dominant Pruning (ExDP)

A Framework for Disaster Mitigation Networks

Contact Info

Product

Resources

About