ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240)
DOI: 10.1109/icc.2001.936312
|View full text |Cite
|
Sign up to set email alerts
|

Virtual dynamic backbone for mobile ad hoc networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
78
0

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 95 publications
(78 citation statements)
references
References 5 publications
0
78
0
Order By: Relevance
“…Phase I: Leader selection (1) Leader node dc ← (2) for each sensor node detecting the target do (3) if it does not receive any election message then (4) broadcasts its election message and waits for a predefined timeout period for election messages from neighbor nodes (5) if it does not receive any message during the period then (6) elects itself as the cluster head dc (7) else (8) elects the node with the highest received signal as the cluster head dc Phase II: Dynamic cluster construction (1) dynamic cluster set dc ← (2) dc broadcasts a recruit message (3) while node V receiving the recruit message do (4) V .leader ← dc (5) V replies a confirm message (6) while dc receives a confirm message from V do (7) dc ← dc ∪ {V } Phase III: Boundary node formation (1) boundary nodes set dc ← (2) for each node V ∈ dc do (3) while ∃V ∈ (V ) such that ( , ) ≤ and…”
Section: International Journal Of Distributed Sensor Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…Phase I: Leader selection (1) Leader node dc ← (2) for each sensor node detecting the target do (3) if it does not receive any election message then (4) broadcasts its election message and waits for a predefined timeout period for election messages from neighbor nodes (5) if it does not receive any message during the period then (6) elects itself as the cluster head dc (7) else (8) elects the node with the highest received signal as the cluster head dc Phase II: Dynamic cluster construction (1) dynamic cluster set dc ← (2) dc broadcasts a recruit message (3) while node V receiving the recruit message do (4) V .leader ← dc (5) V replies a confirm message (6) while dc receives a confirm message from V do (7) dc ← dc ∪ {V } Phase III: Boundary node formation (1) boundary nodes set dc ← (2) for each node V ∈ dc do (3) while ∃V ∈ (V ) such that ( , ) ≤ and…”
Section: International Journal Of Distributed Sensor Networkmentioning
confidence: 99%
“…For example, it facilitates spatial reuse of resources to increase the system capacity [2]; it also benefits local collaboration and routing [3,4]. Recently, the cluster structure is gradually adopted for solving the target tracking problem [5][6][7][8][9][10][11][12][13].…”
Section: Introductionmentioning
confidence: 99%
“…Clustering schemes make it easier in responding to changes caused by network dynamics, node mobility, unpredicted failures and local changes. Since these changes need to be managed and detected within individual clusters only [11,12].…”
Section: Why Clustering In Wsns?mentioning
confidence: 99%
“…This provides a very useful tool for the user to view the current state of the test subject (ad-hoc network software). For example, some ad-hoc routing algorithms assign different roles to different nodes, such as selecting nodes to be "cluster heads" (e.g., ZRP [5]), or marking nodes "green" or "black" color depending on its internal state (e.g., VDBP [9]). If we are to test these algorithms, we can instrument the routing code so that it sends a command to the master controller whenever the node changes color, and the corresponding node on the canvas board will change color accordingly.…”
Section: Ad-hoc Network Visualizationmentioning
confidence: 99%