{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:16:25Z","timestamp":1760217385971,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2015,6,29]],"date-time":"2015-06-29T00:00:00Z","timestamp":1435536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels.<\/jats:p>","DOI":"10.3390\/s150715265","type":"journal-article","created":{"date-parts":[[2015,6,29]],"date-time":"2015-06-29T10:05:22Z","timestamp":1435572322000},"page":"15265-15284","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Coded Cooperation for Multiway Relaying in Wireless Sensor Networks"],"prefix":"10.3390","volume":"15","author":[{"given":"Zhongwei","family":"Si","sequence":"first","affiliation":[{"name":"Key Lab of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), 100876 Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyang","family":"Ma","sequence":"additional","affiliation":[{"name":"Key Lab of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), 100876 Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ragnar","family":"Thobaben","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and ACCESS Linnaeus Center, KTH Royal Institute of Technology, 10044 Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2015,6,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.2307\/1426331","article-title":"Three-terminal communication channels","volume":"3","year":"1971","journal-title":"Adv. Appl. Probab."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/TIT.2007.911158","article-title":"Broadcast Capacity Region of Two-Phase Bidirectional Relaying","volume":"54","author":"Oechtering","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TIT.2012.2219156","article-title":"The Multiway Relay Channel","volume":"59","author":"Gunduz","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","unstructured":"Eswaran, K., and Gastpar, M. (July, January Canada,). Achievable rates for conferencing multiway channels. Toronto, ON, Canada."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3397","DOI":"10.1109\/TWC.2008.060841","article-title":"Piggyback a common message on half-duplex bidirectional relaying","volume":"7","author":"Oechtering","year":"2008","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Wyrembelski, R.F., and Boche, H. (2011, January 16\u201320). Bidirectional broadcast channels with common and confidential messages. Paraty, Brazil.","DOI":"10.1109\/ITW.2011.6089528"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Gallager, R.G. (1963). Low Density Parity Check Codes, MIT Press.","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Richardson, T., and Urbanke, R. (2008). Model Coding Theory, Cambridge University Press.","DOI":"10.1017\/CBO9780511791338"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1049\/el:20030526","article-title":"Distributed Turbo coded diversity for relay channel","volume":"39","author":"Zhao","year":"2003","journal-title":"Electron. Lett."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Roy, S., and Duman, T.M. (2006, January 11\u201315). Performance Bounds for Turbo Coded Half Duplex Relay Systems. Istanbul, Turkey.","DOI":"10.1109\/ICC.2006.255037"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1109\/JSAC.2007.070205","article-title":"Low density parity check codes for the relay channel","volume":"25","author":"Chakrabarti","year":"2007","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3384","DOI":"10.1109\/TWC.2007.06083","article-title":"Low Density Parity Check Codes over Wireless Relay Channels","volume":"6","author":"Hu","year":"2007","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Azmi, M.H., Li, J., Yuan, J., and Malaney, R. (2011, January 5\u20139). Design of Distributed Multi-Edge Type LDPC Codes for Two-Way Relay Channels. In. Kyoto, Japan.","DOI":"10.1109\/icc.2011.5962625"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Andersson, M., Wyrembelski, R.F., Oechtering, T.J., and Skoglund, M. (2012, January 28\u201331). Polar codes for bidirectional broadcast channels with common and confidential messages. Paris, France.","DOI":"10.1109\/ISWCS.2012.6328521"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2181","DOI":"10.1109\/18.782171","article-title":"Time-varying periodic convolutional codes with low-density parity-check matrix","volume":"45","author":"Felstrom","year":"1999","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1109\/TCOMM.2008.050519","article-title":"Implementation aspects of LDPC convolutional codes","volume":"56","author":"Pusane","year":"2008","journal-title":"IEEE Trans. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"5274","DOI":"10.1109\/TIT.2010.2059490","article-title":"Iterative decoding threshold analysis for LDPC convolutional codes","volume":"56","author":"Lentmaier","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TIT.2010.2095072","article-title":"Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC","volume":"57","author":"Kudekar","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Kudekar, S., Richardson, T., and Urbanke, R. (2012, January 1\u20136). Spatially coupled ensembles universally achieve capacity under belief propagation. Cambridge, MA, USA.","DOI":"10.1109\/ISIT.2012.6284229"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2303","DOI":"10.1109\/TIT.2011.2177439","article-title":"Windowed decoding of protograph-based LDPC convolutional codes over erasure channels","volume":"58","author":"Iyengar","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_21","unstructured":"Richardson, T., and Urbanke, R. Multi-Edge Type LDPC Codes. Available online: http:\/\/www.researchgate.net\/publication\/37439748_Multi-Edge_Type_LDPC_Codes."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Si, Z., Thobaben, R., Skoglund, M., and Oechtering, T.J. (2012, January 27\u201331). Bidirectional broadcasting by using multi-edge type LDPC convolutional codes.","DOI":"10.1109\/ISTC.2012.6325205"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","article-title":"A recursive approach to low complexity codes","volume":"27","author":"Tanner","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","article-title":"Noiseless coding of correlated information sources","volume":"19","author":"Slepian","year":"1973","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TIT.1979.1056084","article-title":"Capacity theorems for the relay channel","volume":"25","author":"Cover","year":"1979","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1974.1055171","article-title":"Recent results in the Shannon theory","volume":"20","author":"Wyner","year":"1974","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/TIT.2002.1003821","article-title":"Nested linear\/lattice codes for structured multiterminal binning","volume":"48","author":"Zamir","year":"2002","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/15\/7\/15265\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:48:28Z","timestamp":1760215708000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/15\/7\/15265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,29]]},"references-count":27,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2015,7]]}},"alternative-id":["s150715265"],"URL":"https:\/\/doi.org\/10.3390\/s150715265","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2015,6,29]]}}}