2010 IEEE Global Telecommunications Conference GLOBECOM 2010 2010
DOI: 10.1109/glocom.2010.5683253
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Localized Protocols to Compute Connected Dominating Sets for Ad Hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
10
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(10 citation statements)
references
References 16 publications
0
10
0
Order By: Relevance
“…Using the location information of its neighbors, a node, आ, can discover if any two of its neighbors are directly connected or not; nodes u and w are directly connected if the Euclidean distance between them is shorter than the transmission range; otherwise, they are not connected; however, in [20], it was shown that utilizing the location information does not guarantee the reduction of signaling overhead. The argument made in [20] is that since the node ID is a four-byte integer number while its location information, i.e. its X and Y coordinates, is two eight-byte floating point numbers, broadcasting the location information of a given node is more costly, in terms of signaling overhead, than broadcasting its list of neighbors if this node has three neighbors or less.…”
Section: Location-information-based Wu and LI Algorithmmentioning
confidence: 99%
See 4 more Smart Citations
“…Using the location information of its neighbors, a node, आ, can discover if any two of its neighbors are directly connected or not; nodes u and w are directly connected if the Euclidean distance between them is shorter than the transmission range; otherwise, they are not connected; however, in [20], it was shown that utilizing the location information does not guarantee the reduction of signaling overhead. The argument made in [20] is that since the node ID is a four-byte integer number while its location information, i.e. its X and Y coordinates, is two eight-byte floating point numbers, broadcasting the location information of a given node is more costly, in terms of signaling overhead, than broadcasting its list of neighbors if this node has three neighbors or less.…”
Section: Location-information-based Wu and LI Algorithmmentioning
confidence: 99%
“…X and Y coordinates, instead of broadcasting their lists of neighbors [11]. Using the location information of its neighbors, a node, आ, can discover if any two of its neighbors are directly connected or not; nodes u and w are directly connected if the Euclidean distance between them is shorter than the transmission range; otherwise, they are not connected; however, in [20], it was shown that utilizing the location information does not guarantee the reduction of signaling overhead. The argument made in [20] is that since the node ID is a four-byte integer number while its location information, i.e.…”
Section: Location-information-based Wu and LI Algorithmmentioning
confidence: 99%
See 3 more Smart Citations