Power control and clustering in ad hoc networks
By Vikas Kawadia, P. Arun Raj Kumar. IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2003
685 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/4b3d47181622a5a78a00828275b667de57477c6e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Paolo Santi
- Guihai Chen
- Jean-Pierre Hubaux
- Ossama Younis
- Jie Wu
- Roger Wattenhofer
- Sonia Fahmy
- Xuxun Liu
Citations in the corpus
- A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues (2008, methodology): “An improved COMPOW, CLUSTERPOW, proposed by Kawadia and Kumar, integrates power control and route protocols [ 9 ].”
- Design and analysis of an MST-based topology control algorithm (2003, methodology): “In this section, we summarize several topology control algorithms that have been proposed in the literature: relay-region based approach (R&M) [10], CBTC [7], COMPOW [5] and CLUSTERPOW [ 8 ], and CONNECT [9].”
- Topology control in wireless ad hoc and sensor networks (2005, methodology): “This unfortunate situation, described in (Kawadia and Kumar 2003), is depicted in Figure 14.”
- Joint mobility and routing for lifetime elongation in wireless sensor networks (2005, background): “Therefore, Rm should be within [8, 10]: smaller values of Rm would not lead to lower loadN , because loadN ≥ 17.”
- HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks (2004, background): “In CLUSTERPOW [3], nodes are assumed to be nonhomogeneously dispersed in the network.”
- A network information theory for wireless communication: scaling laws and optimal operation (2004, background): “This includes ad hoc networks, currently the subject of great interest, the protocols for which are under intense development [1], [2], [3], [4], [5], [6], [7].”
- Energy-efficient deployment of Intelligent Mobile sensor networks (2005, background): “the second algorithm is the introduction of local clustering [12], [15] during the deployment process so as to increase the amount of local control over a fraction of the entire ROI.”
- A survey on clustering algorithms for wireless sensor networks (2007, neutral): “Although many clustering algorithms have been proposed in the literature for ad-hoc networks [11–15], the objective was mainly to generate stable clusters in environments with mobile nodes.”
- Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach (2004, background): “In CLUSTERPOW [7], nodes are assumed to be non-homogeneously dispersed in the network.”
- Routing protocols in ad hoc networks: A survey (2011, neutral): “Another aspect is whether the algorithm is implemented in a centralized [107,71,58,81] or a distributed way [7,60,115].”
- Does topology control reduce interference? (2004, background): “exploiting the benefit of such techniques also in practical networks [11].”
- Cluster head election techniques for coverage preservation in wireless sensor networks (2009, methodology): “In [22] the authors provide a method for achieving full coverage of targets by dividing the sensors into disjoint cover sets that are active successively.”
- Principles and protocols for power control in wireless ad hoc networks (2005, neutral): “4 illustrates the routes chosen, and the power level used when the above algorithm, called CLUSTERPOW [9], is executed on a typical clustered network.”
- An unequal cluster-based routing protocol in wireless sensor networks (2009, background): “choose an adjacent node as the relay node [29].”
- Denial of service resilience in ad hoc networks (2004, neutral): “However, if node j employs dynamic power management techniques (as in [24] for example) and reduces its transmission energy when communicating to node k, then node i will incorrectly infer that node j is misbehaving and will take action according to the specific routing protocol and counter-DoS tech”