Abstract

The non-homogeneous version of the range assignment problem in Ad-Hoc wireless network is studied in the context of information broadcast and accumulation. Efficient algorithms are presented for the unbounded and bounded-hop broadcast problems for a set of radio-stations when they are placed on a straight line. This improves time complexity of the existing results for the same two problems by a factor of n, where n is the number of radio-stations [2]. An easy to implement algorithm for the unbounded version of accumulation problem is also presented for the non-homogeneous version of the range assignment problem. Its worst case running time complexity is O(n 2). The same algorithm works when the radio-stations are placed in R d.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.