2010/10/04 by Petteri Mannersalo, Mannersalo, Petteri, Georgios S. Paschos +3
Computer Science · Engineering · #Cellular Automata and Applications #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Performance (cs.PF) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1010.0630
openalex publication_date 2010/10/04 · openalex created_date 2022/10/02 · openalex updated_date 2026/07/28
This paper focuses on a particular transmission scheme called local network\ncoding, which has been reported to provide significant performance gains in\npractical wireless networks. The performance of this scheme strongly depends on\nthe network topology and thus on the locations of the wireless nodes. Also, it\nhas been shown previously that finding the encoding strategy, which achieves\nmaximum performance, requires complex calculations to be undertaken by the\nwireless node in real-time.\n Both deterministic and random point pattern are explored and using the\nBoolean connectivity model we provide upper bounds for the maximum coding\nnumber, i.e., the number of packets that can be combined such that the\ncorresponding receivers are able to decode. For the models studied, this upper\nbound is of order of \√(N), where N denotes the (mean) number of\nneighbors. Moreover, achievable coding numbers are provided for grid-like\nnetworks. We also calculate the multiplicative constants that determine the\ngain in case of a small network. Building on the above results, we provide an\nanalytic expression for the upper bound of the efficiency of local network\ncoding. The conveyed message is that it is favorable to reduce computational\ncomplexity by relying only on small encoding numbers since the resulting\nexpected throughput loss is negligible.\n