Hidden Terminal Aware Clustering for Large-scale D2D Networks

Rhee, Seung Hyong; Li, Xiaoying

doi:10.1007/s11277-018-5746-x

Cited by 5 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the grouping algorithms of [4][5][6][7][8][9], only the hidden node problem is considered. In our work, the load balance is synchronously considered.…”

Section: Resultsmentioning

confidence: 99%

“…In [8], the intercluster grouping method is proposed to eliminate the hidden node problem. In [9], the authors propose a hidden terminal aware clustering mechanism, and the clusters are formed based on the detected information of the neighbor learning phase. The grouping access strategy can significantly mitigate the effect of hidden nodes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

Sun

Chi

2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Wireless communications play a critical role in the applications of Internet of Things (IoT). The Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) is a well-proven wireless random access protocol. A crucial factor affecting the performance of random access networks is “hidden node collision,” which incurs performance degradation and lower resource utilization. Grouping is an efficient strategy for hidden node avoidance. In current IoT networks, the terminals usually have different traffic load, so load balance should be considered when grouping algorithm is designed. To mitigate hidden nodes and achieve load balance simultaneously, we propose a grouping algorithm based on the game theory. By introducing the supermartingale theory, the delay performance of the completed groups is analyzed. Simulations prove that the proposed algorithm alleviates collision, balances traffic, and promotes the efficient guarantee for Quality of Service (QoS).

show abstract

“…In the grouping algorithms of [4][5][6][7][8][9], only the hidden node problem is considered. In our work, the load balance is synchronously considered.…”

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

Sun

Chi

2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…The operator is responsible for user identity authentication, access control, connection establishment, resource allocation and security management. V2V communication links share the spectrum resources of normal cellular systems and can be applied to local services, such as local content sharing V2V direct communication is performed between the transmitting and the receiving of the VU, and the CU communication needs to pass through the BS first and then to the receiving end [29]. Eve intercepts the V2V link.…”

Section: A Scene Modelmentioning

confidence: 99%

Simulation of Vehicle Network Communication Security Based on Random Geometry and Data Mining

2020

View full text Add to dashboard Cite

Internet of vehicles is a specific application of Internet of things technology in the field of intelligent transportation. The rapid development of 5G communication technology promotes the development of Internet of vehicles. Car for cellular network communication node random distribution and complex multi-source interference and mobile terminal security calculation ability is limited, this article in view of the actual scene, was proposed based on random geometry contains eavesdropper (Eve) honeycomb-V2V heterogeneous physical layer security system model, the introduction of automatic (PB) as artificial floating vehicle noise, the analysis of cellular network users in the system (CU), V2V users (VU) and interference of the eavesdropper, each user letter simulation with dry to noise ratio (SINR) of the cumulative distribution function, and by using the random geometry tools related safety expression deduction, Then, data mining was carried out on the distance between PB and VU receiver, PB transmitting power and other related variables through genetic algorithm, and the value process was visualized to extract valuable information, providing a mathematical analysis framework and theoretical guidance for the future design, deployment and operation of cellular vehicle network. The results show that the proposed system model can significantly improve the security of vehicle-network communication.

show abstract

Performance evaluation of grouping and regrouping scheme for mitigating hidden station problem in IEEE 802.11ah network

Gopinath

Nithya

2020

Cluster Comput

View full text Add to dashboard Cite

Hidden Terminal Aware Clustering for Large-scale D2D Networks

Cited by 5 publications

References 14 publications

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

Simulation of Vehicle Network Communication Security Based on Random Geometry and Data Mining

Performance evaluation of grouping and regrouping scheme for mitigating hidden station problem in IEEE 802.11ah network

Contact Info

Product

Resources

About