Advertisement

Weighted Broadcast in Linear Radio Networks

  • Gautam K. Das
  • Subhas C. Nandy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4041)

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 .

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ambühl, C., Clementi, A.E.F., Di Ianni, M., Lev-Tov, N., Monti, A., Peleg, D., Rossi, G., Silvestri, R.: Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 418–427. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  2. 2.
    Ambuhl, C., Clementi, A.E.F., Di Ianni, M., Monti, A., Rossi, G., Silvestri, R.: The range assignment problem in non-homogeneous static ad-hoc networks. In: Proc. of 18th International Parallel and Distributed Precessing Symposium (IPDPS 2004) (2004)Google Scholar
  3. 3.
    Clementi, A.E.F., Ferreira, A., Penna, P., Penennes, S., Silvestri, R.: The minimum range assignment problem on linear radio networks. Algorithmica 35, 95–110 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Cagalj, M., Hubaux, J.-P., Enz, C.: Minimum energy broadcast in all wireless networks: NP-completeness and distribution issues. In: Proc. of the 8th. Annual Int. Conf. on Mobile Computing and Networking, pp. 172–182 (2002)Google Scholar
  5. 5.
    Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some recent theoretical advances and open questions on energy consumption in Ad Hoc wireless networks. In: Proc. 3rd. Workshop on Approximation and Randomization Algorithms in Communication Networks, pp. 23–38 (2002)Google Scholar
  6. 6.
    Clementi, A.E.F., Di Ianni, M., Monti, A., Rossi, G., Silvestri, R.: Experimental analysis of practically efficient algorithms for bounded-hop accumulation in Ad-Hoc wireless networks. In: Proc. 19th International Parallel and Distributed Precessing Symposium (IPDPS 2005) (2005)Google Scholar
  7. 7.
    Clementi, A.E.F., Di Ianni, M., Silvestri, R.: The minimum broadcast range assignment problem on linear multihop wireless networks. Theoretical Computer Science 299, 751–761 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. Prentice Hall (India) Pvt. Ltd, New Delhi (1998)Google Scholar
  9. 9.
    Das, G.K., Das, S., Nandy, S.C.: Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. In: Bougé, L., Prasanna, V.K. (eds.) HiPC 2004. LNCS, vol. 3296, pp. 420–429. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Gabow, H.N., Galil, Z., Spencer, T., Tarjan, R.E.: Efficient algorithm for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(2), 109–122 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Gaibisso, C., Proietti, G., Tan, R.: Efficient management of transient station failures in linear radio communication networks with bases. In: 2nd Internatonal Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE 2001). Proceedings in Informatics, vol. 12, pp. 37–54. Carleton Scientific (2001)Google Scholar
  12. 12.
    Kirousis, L., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Mathar, R., Mattfeldt, J.: Optimal transmission ranges for mobile communication in linear multihop packet radio networks. Wireless Networks 2, 329–342 (1996)CrossRefGoogle Scholar
  14. 14.
    Park, J., Sahni, S.: Maximum lifetime broadcasting in wireless networks. IEEE Trans. on Computers 54, 1081–1090 (2005)CrossRefGoogle Scholar
  15. 15.
    Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. John Wiley & Sons, Chichester (2005)CrossRefGoogle Scholar
  16. 16.
    Wan, P.-J., Calinescu, G., Li, X.-Y., Frieder, O.: Minimum energy broadcast in static ad hoc wireless networks. Wireless Networks 8, 607–617 (2002)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Gautam K. Das
    • 1
  • Subhas C. Nandy
    • 1
  1. 1.Indian Statistical InstituteKolkataIndia

Personalised recommendations