Cooperative Communications in Machine to Machine (M2M): Solutions, Challenges and Future Work

Raymond, Juma W.; Olwal, Thomas O.; Kurien, Anish Mathew

doi:10.1109/access.2018.2807583

Cited by 31 publications

(25 citation statements)

References 80 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar to in [21,24], we assume that nodes always have a means to acquire the geographical location information of their neighbors and where the destination is. Moreover, similar to [4,8], we assume that, within the range of N (i), ∀i ∈ V, channel state information (CSI) of P i,j , ∀j ∈ N (i) is available to node i and the signaling messages can be transmitted reliably with the negligible cost due to the fact that the length in bits of these messages is very small compared to the traffic data.…”

Section: System Modelmentioning

confidence: 99%

An Opportunistic Cooperative Packet Transmission Scheme in Wireless Multi-hop Networks

Gao

Zhang

Cheng

et al. 2019

2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)

View full text Add to dashboard Cite

Cooperative routing, combining cooperative communication in the physical layer and routing technology in the network layer, is one of the most widely used technologies for improving end-to-end transmission reliability and delay in the wireless multi-hop networks. However, the existing cooperative routing schemes are designed based on an optimal fixed-path routing so that the end-to-end performance is greatly restricted by the low spatial efficiency. To address this problem, in this paper an opportunistic cooperative packet transmission (OCPT) scheme is explored by combining cooperative communication and opportunistic routing. The proposed scheme divides the multi-hop route into multiple virtual multiple-input-multiple-output (MIMO) transmissions. Before each transmission, based on the idea of opportunistic routing, a cluster head (CH) is introduced to determine the multiple transmitters and multiple receivers to form a cluster. Then, the single-hop transmission distance is defined as the metric of forward progress to the destination. Each intra-cluster cooperative packet transmission is formulated as a transmit beamforming optimization problem, and an iterative optimal beamforming policy is proposed to solve the problem and maximize the single-hop transmission distance. CH organizes multiple transmitters to cooperatively transmit packets to multiple receivers with the optimized transmit beamforming vector. Finally, according to the transmission results, the cluster is updated and the new cooperative transmission is started. Iteratively, the transmission lasts until the destination has successfully received the packet. We comprehensively evaluate the OCPT scheme by comparing it with conventional routing schemes. The simulation results demonstrate that the proposed OCPT scheme is effective on shortening the end-to-end transmission delay, increasing the number of successful packet transmissions and improving the packet arrival ratio and transmission efficiency.

show abstract

Section: System Modelmentioning

confidence: 99%

An Opportunistic Cooperative Packet Transmission Scheme in Wireless Multi-hop Networks

Gao

Zhang

Cheng

et al. 2019

2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW)

View full text Add to dashboard Cite

show abstract

“…(ii) e proposed algorithm CGTCI is designed which starts with the partitioning of M2M devices into multiple networks of hierarchical zones, formation of coalition structures in the created hierarchical multiple zones, and invoking of a contract-modelled incentive to stimulate multihop transmissions up to the BS/sink. (iii) It is demonstrated through simulations that the proposed algorithm, CGTCI, improves energy efficiency among the M2M communications when compared with the closely related traditional approaches: CGTC [15], CG-DC (an improvement of low-energy adaptive clustering hierarchy (LEACH)) [16], Raymond et al [3], and noncoalition game (NCG) algorithms.…”

Section: Introductionmentioning

confidence: 97%

“…Huang et al [2] describe the use of credit-based clustering (CBC) scheme to encourage sharing among devices in the same social network. e application of cooperative schemes in energyefficient management has been proposed by Raymond et al [3] and Olwal et al [4]. Cooperative schemes that invoke game theory are examined for energy efficiency in WSNs [5].…”

Section: Introductionmentioning

confidence: 99%

Energy-Efficient Coalition Games with Incentives in Machine-to-Machine Communications

Juma

Kurien

Olwal

2019

Journal of Computer Networks and Communications

Self Cite

View full text Add to dashboard Cite

The need to achieve energy efficiency in machine-to-machine (M2M) communications has been a driver of the use of coalition game-based cooperative communication schemes. The proposed schemes have shown good energy-efficient performance results in the recent past. However, sustaining cooperation amongst coalition games of M2M devices from different network-operating authorities requires appropriate incentives. A review of the literature demonstrates that a limited number of contributions have considered the use of coalition games with incentives in M2M communications. In this paper, an energy-efficient coalition game with incentives in M2M communications is proposed. This work considers a Sierpinski triangle technique to partition M2M devices into multiple networks of hierarchical zones. Based on the constructed zones, a contract-modelled incentive is invoked to stimulate multihop transmissions between devices up to the BS/sink. The results obtained demonstrate that the proposed approach is on average 10% more energy efficient than the closely related existing algorithm, the coalition game theoretical clustering (CGTC).

show abstract

“…The time selective Nakagami-m fading channel model best captures wireless channels for mobile nodes as described in the work on vehicular communication (VC) for wireless access in vehicular environment (WAVE) related studies [18]. In addition, this has been well investigated for machine to machine (M2M) wireless communication scenarios in [19] and experiential models based on Nakagami-m fading channel has been proposed in [26]. In addition, the Nakagami-m fading channel model is also valid for practical scenarios where nodes are far apart from each other.…”

Section: Introductionmentioning

confidence: 99%

Pairwise Error Probability Analysis of Dual Hop Relaying Network over Time Selective Nakagami-m Fading Channel with Imperfect CSI and Node Mobility

Shankar¹,

Kumar²,

Mishra³

2019

View full text Add to dashboard Cite

We investigate the end-to-end performance of the selective decode and forward (S-DF) relaying network over time selective independent but not necessarily identically distributed (i.n.i.d.) Nakagami-m fading channel considering practical communication constraints such as mobile nodes and imperfect channel state information (CSI). The per block average pairwise error probability (PEP) is investigated for both optimal and equal power allocation scenarios. Simulation results have been presented for various values of fading severity parameter and channel variance. The end-to-end performance is examined for various node mobility scenarios and for various antenna configurations at the source, relay and destination nodes. Simulation results confirm the accuracy of the analytical results.

show abstract

Cooperative Communications in Machine to Machine (M2M): Solutions, Challenges and Future Work

Cited by 31 publications

References 80 publications

An Opportunistic Cooperative Packet Transmission Scheme in Wireless Multi-hop Networks

An Opportunistic Cooperative Packet Transmission Scheme in Wireless Multi-hop Networks

Energy-Efficient Coalition Games with Incentives in Machine-to-Machine Communications

Pairwise Error Probability Analysis of Dual Hop Relaying Network over Time Selective Nakagami-m Fading Channel with Imperfect CSI and Node Mobility

Contact Info

Product

Resources

About