Abstract
Given a set of sensors in a plane or in higher dimension, the strong minimum energy topology problem is to assign transmission range to each of the sensor nodes, so as to minimize the total power consumption. Here the constraint is that the network must be strongly connected. This problem is known to be NP-hard. As this problem has lot of practical application, several approximation algorithms and heuristics has been proposed. There exist a MST based 2-approximation algorithm for this problem having running time complexity of O(n 2 logn). In this paper we propose a simple parallel version of the 2-approximation algorithm. We prove that this parallel algorithm is a NC-algorithm and is also cost optimal for a dense graph. We prove that the algorithm has a time complexity O(logn) and work complexity O(n 2) when the number of processor used is O(n 2).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arikan, E.: Some Complexity Result about Packet Radio Network. IEEE Transactions on Information Theory IT-30, 681–685 (1984)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38(4), 393–422 (2002)
Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal of Computer and System Science 43, 290–298 (1991)
Cheng, X., Narahari, B., Simha, R., Cheng, M., Liu, D.: Strong minimum energy topology in wireless sensor networks:NP-Completeness and Heuristics. IEEE Transactions on Mobile Computing 2(3), 248–256 (2003)
Chong, K.W., Han, Y., Igarashi, Y., Lam, T.W.: Improving the efficiency of parallel minimum spanning tree algorithms. Discrete Applied Mathematics 126, 33–54 (2003)
Chong, K.W.: Finding minimum spanning trees on the EREW PRAM. In: Proceedings of the 1996 International Computer Symposium (ICS 1996), Taiwan, pp. 7–14 (1996)
Clementi, A.E.F., Penna, P., Silvestri, R.: On the Power Assignment Problem in Radio Networks. Mobile Networks and Applications 9, 125–140 (2000)
Fuchs, B.: On The Hardness Of Range Assignment Problems. Electronic Colloquium On Complexity, Report No. 113 (2005)
Gonzales, T. (ed.): Handbook of Approximation Algorithms and Metaheuristics, ch. 67. Chapman and Hall CRC (2007)
Goto, H., Hasegawa, Y., Tanaka, M.: Efficient Scheduling Focusing on the Duality of MPL Representatives. In: Proc. IEEE Symp. Computational Intelligence in Scheduling (SCIS 2007), pp. 57–64. IEEE Press (December 2007), doi:10.1109/SCIS.2007.357670
Grama, A., Karypis, G., Kumar, V., Gupta, A.: Introduction to Parallel Computing, 2nd edn. Pearson, Addison Wesley (2003)
Kirousis, L.M., Kranakis, E., Krizane, D., Pele, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)
Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for Ad Hoc Networks. Mobile Networks and Applications 10, 19–34 (2005)
Santi, P.: Topology Control in wireless ad hoc and sensor Networks. ACM Computing Surveys 37(2), 164–194 (2005)
Santi, P.: Topology Control in wireless ad hoc and sensor Networks. Wiley Inter Science, Chichester (2005)
Panda, B.S., Pushparaj Shetty, D.: An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. In: Natarajan, R., Ojo, A. (eds.) ICDCIT 2011. LNCS, vol. 6536, pp. 187–196. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhatta, B.K., Shetty, D.P. (2013). A Parallel 2-Approximation NC-Algorithm for Range Assignment Problem in Packet Radio Networks. In: Hota, C., Srimani, P.K. (eds) Distributed Computing and Internet Technology. ICDCIT 2013. Lecture Notes in Computer Science, vol 7753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36071-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-36071-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36070-1
Online ISBN: 978-3-642-36071-8
eBook Packages: Computer ScienceComputer Science (R0)