Distributed topology control algorithm based on one- and two-hop neighbors’ information for ad hoc networks

Kadivar, Mehdi; Shiri, Mohammad Ebrahim; Dehghan, Mehdi

doi:10.1016/j.comcom.2008.11.014

Cited by 20 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These issues are related to limited battery resource. In this section, the NMST is compared with two existing topology control algorithms, including OTTC [16] and DIA [18]. Simulations are implemented by using Matlab.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…The following metrics are considered for comparative evaluation of the abovementioned algorithms: node degree, transmission range, and stretch factor and power stretch mean psm. The sf of node and V is determined as sf( , V) = ( , V)/ ( , V) where ( , V) represents the energy cost of the shortest path between nodes and V on the topology network of and the initial graphs, respectively [16]. In addition, the psm is determined as psm( , V) = ∑ ,V∈ ( ( , V)/ ( , V))/ 2 where denotes the number of nodes [16].…”

Section: Simulation Resultsmentioning

confidence: 99%

“…The XTC algorithm does not require node coordinate information. In [16] the author proposed OTTC algorithm that operates with weight of the links. Each node collects its one-hop neighbors in an ordered list and exchanges the list between its neighbors.…”

Section: Related Workmentioning

confidence: 99%

“…Several algorithms such as LMST [14], XTC [15], and OTTC [16] are introduced for connected topology in wireless networks. In topologies constructed by XTC, LMST, and OTTC the number of neighbors and energy efficiency are considerably bounded.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Game Theory Based Construction Efficient Topology in Wireless Sensor Networks

Abbasi

Latiff

Chizari

et al. 2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Topology control is one of the most important techniques used in wireless sensor networks; to some extent it can reduce energy consumption in which each node is capable of minimizing its transmission power level while preserving network connectivity. Reducing energy consumption has been addressed through different aspects till now. In this paper, we present a minimum spanning tree-(MST-) based algorithm, called noncooperative minimum spanning tree (NMST), for topology control in wireless multihop networks. In this algorithm, each node constructs its minimum power-cost spanning tree which is a tree and can connect the node with one hop away from its neighbor node in constructed topology. In addition we address the power-cost allocation problem when node acts selfishly. A class of strategies is proposed which construct minimum power-cost spanning tree such that the sum of the power-cost (as proxy of weight), at the same time, is a strong Nash equilibrium for a noncooperative game associated with the problem of efficient topology construction. Simulation results show that NMST can maximize the sensor network lifetimes.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Section: Simulation Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Game Theory Based Construction Efficient Topology in Wireless Sensor Networks

Abbasi

Latiff

Chizari

et al. 2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…For simplicity, the vast majority of studies based on the idealized unit-disk graph (UDG) network model, where any two sensors can directly communicate with each other if and only if their geographic distance is smaller than a predetermined radio range. Examples of these research include geo-routing protocols [12,13], localization algorithms [8,14], and topology control techniques [15,16]. Similarly, most of the works related to the hop-distance relationship have been investigated assuming the UDG model [11,[17][18][19][20][21][22][23].…”

Section: Introductionmentioning

confidence: 99%

Hop-distance relationship analysis with quasi-UDG model for node localization in wireless sensor networks

Gao

Chen

Foh

et al. 2011

J Wireless Com Network

View full text Add to dashboard Cite

In wireless sensor networks (WSNs), location information plays an important role in many fundamental services which includes geographic routing, target tracking, location-based coverage, topology control, and others. One promising approach in sensor network localization is the determination of location based on hop counts. A critical priori of this approach that directly influences the accuracy of location estimation is the hop-distance relationship. However, most of the related works on the hop-distance relationship assume the unit-disk graph (UDG) model that is unrealistic in a practical scenario. In this paper, we formulate the hop-distance relationship for quasi-UDG model in WSNs where sensor nodes are randomly and independently deployed in a circular region based on a Poisson point process. Different from the UDG model, quasi-UDG model has the non-uniformity property for connectivity. We derive an approximated recursive expression for the probability of the hop count with a given geographic distance. The border effect and dependence problem are also taken into consideration. Furthermore, we give the expressions describing the distribution of distance with known hop counts for inner nodes and those suffered from the border effect where we discover the insignificance of the border effect. The analytical results are validated by simulations showing the accuracy of the employed approximation. Besides, we demonstrate the localization application of the formulated relationship and show the accuracy improvement in the WSN localization.

show abstract