2012/04/17 by Mohammad R. Ataei, Amir H. Banihashemi, Ataei, Mohammad R. +3
Computer Science · Engineering · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks #Vehicular Ad Hoc Networks (VANETs)
paper · pdf · doi:10.48550/arxiv.1204.3920
openalex publication_date 2012/04/17 · openalex created_date 2025/10/24 · openalex updated_date 2026/07/28
In this paper, we investigate the transmission range assignment for N\nwireless nodes located on a line (a linear wireless network) for broadcasting\ndata from one specific node to all the nodes in the network with minimum\nenergy. Our goal is to find a solution that has low complexity and yet performs\nclose to optimal. We propose an algorithm for finding the optimal assignment\n(which results in the minimum energy consumption) with complexity O(N2). An\napproximation algorithm with complexity O(N) is also proposed. It is shown\nthat, for networks with uniformly distributed nodes, the linear-time\napproximate solution obtained by this algorithm on average performs practically\nidentical to the optimal assignment. Both the optimal and the suboptimal\nalgorithms require the full knowledge of the network topology and are thus\ncentralized. We also propose a distributed algorithm of negligible complexity,\ni.e., with complexity O(1), which only requires the knowledge of the adjacent\nneighbors at each wireless node. Our simulations demonstrate that the\ndistributed solution on average performs almost as good as the optimal one for\nnetworks with uniformly distributed nodes.\n