Cluster Head Assignment in Networks Controlled by Gateway Entities (CHANGE): Simulation Analysis of Protocol Performance

Rico, Juan; Valiño, J.; Epifanio, E.

doi:10.1109/waina.2013.267

Cited by 3 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4 by simulation. This paper uses the network discovery method proposed in [9] to establish the cluster topology. In Fig.…”

Section: Backoff Procedures In a Group Paging Intervalmentioning

confidence: 99%

“…5, a shadowed circle stands for the coverage of cluster and uses the D2D communication. Under the method of network discovery proposed by J. Rico in [9], a cluster broadcasts a HELLO message that will be replied by all the nodes that are able to Device-to-Device Communication-Based Random Access Scheme detect the message, thereby updating the node neighbor list of the cluster head. Moreover, the selection of cluster head mainly comprehensive considers the parameters including the role of nodes, energy status and number of neighbors.…”

Section: Backoff Procedures In a Group Paging Intervalmentioning

confidence: 99%

“…As for complexity, the proposed random access scheme will not incur any hardware or architectural complexity, because it assumes the existence of D2D communication [9]). (2) How to manage device mobility.…”

Section: Performance Evaluationsmentioning

confidence: 99%

“…D2D communication mainly discusses proximity services and direct communications among devices without the intervention of an eNB [7]. References [8][9][10] devote to intra-cluster D2D communication. Yaacoub et al in [8] proposed a new concept that groups a number of devices into a coalition, and a command center gathers all the received information from different devices.…”

Section: Introductionmentioning

confidence: 99%

“…The scheme coalitionbased can save energy, reduce delay and enhance quality of service (QoS). A method forming a cluster and building the whole topology of the network in a wireless sensor network (WSN) was investigated by Rico et al in [9]. A closed-form probability density function for an optimal number of D2D relays in a downlink channel scenario was derived by Zhou et al in [10].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Performance Analysis of a Device-to-Device Communication-Based Random Access Scheme for Machine-Type Communications

Deng

Wang

2015

Wireless Pers Commun

View full text Add to dashboard Cite

Group paging was proposed by the 3rd generation partnership project to reduce the awesome paging overhead in machine-type communication (MTC) that usually involves a huge number of devices performing small data transmissions. Under group paging, MTC devices with identical or similar traffic characteristics are assembled into a paging group; and all the devices in a paging group is paged by a single group paging message. After receiving a group paging message, all the devices in a paging group simultaneously contend for the random access channel to transmit their random access requests, thereby resulting in congestion in the random access network in the case of large group size. To tackle this problem of group paging, we previously proposed an improved random access (I-RA) scheme. In this paper we develop a mathematical model based on Poisson arrival approximation method to analyze the performance of the I-RA scheme. We derive closed-form analytical formulas for performance metrics, such as successful access probability, collision probability, average access delay, the cumulative distribution function of preamble transmission, etc. The accuracy of the analytical formulas is validated through simulation. Based on the formulas, we conduct a numerical study to investigate the impact of diverse parameters on the performance of the I-RA scheme. Moreover, we compare the performance between the I-RA scheme and the existing schemes by numerical studies. The mathematical model developed and the formulas derived in this paper can guide the implementation of the I-RA scheme in MTC.

show abstract

“…4 by simulation. This paper uses the network discovery method proposed in [9] to establish the cluster topology. In Fig.…”

Section: Backoff Procedures In a Group Paging Intervalmentioning

confidence: 99%

Section: Backoff Procedures In a Group Paging Intervalmentioning

confidence: 99%

Section: Performance Evaluationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Performance Analysis of a Device-to-Device Communication-Based Random Access Scheme for Machine-Type Communications

Deng

Wang

2015

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

A random access scheme based on device-to-device communications for machine-type communications

Deng

Wang

Jiang

2013

2013 15th IEEE International Conference on Communication Technology

View full text Add to dashboard Cite

A Fault Tolerance Mechanism for On-Road Sensor Networks

Feng

Guo

Sun

et al. 2016

Sensors

View full text Add to dashboard Cite

On-Road Sensor Networks (ORSNs) play an important role in capturing traffic flow data for predicting short-term traffic patterns, driving assistance and self-driving vehicles. However, this kind of network is prone to large-scale communication failure if a few sensors physically fail. In this paper, to ensure that the network works normally, an effective fault-tolerance mechanism for ORSNs which mainly consists of backup on-road sensor deployment, redundant cluster head deployment and an adaptive failure detection and recovery method is proposed. Firstly, based on the N − x principle and the sensors’ failure rate, this paper formulates the backup sensor deployment problem in the form of a two-objective optimization, which explains the trade-off between the cost and fault resumption. In consideration of improving the network resilience further, this paper introduces a redundant cluster head deployment model according to the coverage constraint. Then a common solving method combining integer-continuing and sequential quadratic programming is explored to determine the optimal location of these two deployment problems. Moreover, an Adaptive Detection and Resume (ADR) protocol is deigned to recover the system communication through route and cluster adjustment if there is a backup on-road sensor mismatch. The final experiments show that our proposed mechanism can achieve an average 90% recovery rate and reduce the average number of failed sensors at most by 35.7%.

show abstract

Cluster Head Assignment in Networks Controlled by Gateway Entities (CHANGE): Simulation Analysis of Protocol Performance

Cited by 3 publications

References 8 publications

Performance Analysis of a Device-to-Device Communication-Based Random Access Scheme for Machine-Type Communications

Performance Analysis of a Device-to-Device Communication-Based Random Access Scheme for Machine-Type Communications

A random access scheme based on device-to-device communications for machine-type communications

A Fault Tolerance Mechanism for On-Road Sensor Networks

Contact Info

Product

Resources

About