Maximal Independent Sets in Heterogeneous Wireless Ad Hoc Networks

Bai, Sen; Che, Xiangjiu; Bai, Xiaoqing; Wei, Xiaohui

doi:10.1109/tmc.2015.2508805

Cited by 14 publications

(4 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So in this paper the algorithm is proposed named as -approximation for the CDS problem, it also gives the improvement in the performance ratio of given approximation algorithm on the UDG. [28] Almost all the approximation algorithm follows a two phased scheme in order to construct the CDS in network. In first phase, the DS (dominating SET) is constructed and in the second phase the nodes available are connected.…”

Section: Literature Surveymentioning

confidence: 99%

Energy efficient clustering using the AMHC (adoptive multi-hop clustering) technique

Vimala¹,

Ranjan²

2020

IJECE

View full text Add to dashboard Cite

IoT has gained fine attention in several field such as in industry applications, agriculture, monitoring, surveillance, similarly parallel growth has been observed in field of WSN. WSN is one of the primary component of IoT when it comes to sensing the data in various environment. Clustering is one of the basic approach in order to obtain the measurable performance in WSNs, Several algorithms of clustering aims to obtain the efficient data collection, data gathering and the routing. In this paper, a novel AMHC (Adaptive Multi-Hop Clustering) algorithm is proposed for the homogenous model, the main aim of algorithm is to obtain the higher efficiency and make it energy efficient. Our algorithm mainly contains the three stages: namely assembling, coupling and discarding. First stage involves the assembling of independent sets (maximum), second stage involves the coupling of independent sets and at last stage the superfluous nodes are discarded. Discarding superfluous nodes helps in achieving higher efficiency. Since our algorithm is a coloring algorithm, different color are used at the different stages for coloring the nodes. Afterwards our algorithm (AMHC) is compared with the existing system which is a combination of Second order data CC(Coupled Clustering) and Compressive-Projection PCA(Principal Component Analysis), and results shows that our algorithm excels in terms of several parameters such as energy efficiency, network lifetime, number of rounds performed.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Energy efficient clustering using the AMHC (adoptive multi-hop clustering) technique

Vimala¹,

Ranjan²

2020

IJECE

View full text Add to dashboard Cite

show abstract

“…For heterogeneous wireless sensor networks, where sensor nodes have different transmission ranges, the MISbased approaches are extended to general disk graphs and general ball graphs. [18][19][20] In addition to these MIS-based algorithms, some marking-based algorithms are proposed in Dai and colleagues. 21,22 These algorithms first mark a CDS and then prune redundant nodes to obtain a small size.…”

Section: Cds Algorithms Optimizing the Sizementioning

confidence: 99%

“…An MIS is also a DS. The MIS is used in the second algorithm because some previous works have studied and presented upper bounds of MISs to the size of a minimum CDS 6,8,[13][14][15]17,18 in UDGs and UBGs. According to these works, we can provide theoretical analysis for the size of the constructed CDS.…”

Section: Definition 2 (Mis)mentioning

confidence: 99%

Latency-optimal virtual backbone construction with acoustic communication in underwater sensor networks

Bai¹,

Wei²,

Bai³

2017

International Journal of Distributed Sensor Networks

Self Cite

View full text Add to dashboard Cite

The high attenuation of radio signals in water leaves acoustic waves the most viable communication media for underwater sensor networks. Nevertheless, acoustic communication suffers from significantly high latency because of its low propagation speed compared to radio communication. In this article, we consider the problem of constructing connected dominating sets as virtual backbones under acoustic communication. We abstract a wireless sensor network as a graph with weighted edges, where the weight of an edge represents the latency between the wireless nodes it links. Three approximation algorithms are proposed to optimize the latency of a connected dominating set. The first algorithm provides a two-approximation to the diameter of a connected dominating set, where the diameter is defined as the length of the longest shortest path in a graph. The second algorithm guarantees a six-approximation to the minimum latency between any pair of nodes and meanwhile has constant approximations to the connected dominating set size in unit disk graphs and unit ball graphs. The third algorithm constructs a connected dominating set with 12-approximation to the diameter and 10.197-approximation to the size in unit disk graphs. Extensive simulations are carried out to validate the performance of the proposed algorithms.

show abstract

“…Both of the features above make the interference relationship between wireless terminals of adjacent WiFi hotspots different from this study. Some traditional studies on the optimization of transmissions of randomly-deployed ad hoc nodes look also similar [ 18 , 19 ], but transmissions are between nodes, different from the new scenarios where transmissions are inside the SSNs (the smallest unit considered in our model). To sum up, those traditional studies basically focus on resource allocation to links or contention between adjacent nodes, which does not solve the problem in SSN scenarios.…”

Section: Introductionmentioning

confidence: 99%

Efficient Graph-Based Resource Allocation Scheme Using Maximal Independent Set for Randomly- Deployed Small Star Networks

Zhou

Wang

et al. 2017

Sensors

View full text Add to dashboard Cite

In future scenarios of heterogeneous and dense networks, randomly-deployed small star networks (SSNs) become a key paradigm, whose system performance is restricted to inter-SSN interference and requires an efficient resource allocation scheme for interference coordination. Traditional resource allocation schemes do not specifically focus on this paradigm and are usually too time consuming in dense networks. In this article, a very efficient graph-based scheme is proposed, which applies the maximal independent set (MIS) concept in graph theory to help divide SSNs into almost interference-free groups. We first construct an interference graph for the system based on a derived distance threshold indicating for any pair of SSNs whether there is intolerable inter-SSN interference or not. Then, SSNs are divided into MISs, and the same resource can be repetitively used by all the SSNs in each MIS. Empirical parameters and equations are set in the scheme to guarantee high performance. Finally, extensive scenarios both dense and nondense are randomly generated and simulated to demonstrate the performance of our scheme, indicating that it outperforms the classical max K-cut-based scheme in terms of system capacity, utility and especially time cost. Its achieved system capacity, utility and fairness can be close to the near-optimal strategy obtained by a time-consuming simulated annealing search.

show abstract

Maximal Independent Sets in Heterogeneous Wireless Ad Hoc Networks

Cited by 14 publications

References 22 publications

Energy efficient clustering using the AMHC (adoptive multi-hop clustering) technique

Energy efficient clustering using the AMHC (adoptive multi-hop clustering) technique

Latency-optimal virtual backbone construction with acoustic communication in underwater sensor networks

Efficient Graph-Based Resource Allocation Scheme Using Maximal Independent Set for Randomly- Deployed Small Star Networks

Contact Info

Product

Resources

About