
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Feng Wang, My T. Thai, Yingshu Li, Xiuzhen Cheng, DingZhu Du, "FaultTolerant Topology Control for AlltoOne and OnetoAll Communication in Wireles Networks," IEEE Transactions on Mobile Computing, vol. 7, no. 3, pp. 322331, March, 2008.  
BibTex  x  
@article{ 10.1109/TMC.2007.70743, author = {Feng Wang and My T. Thai and Yingshu Li and Xiuzhen Cheng and DingZhu Du}, title = {FaultTolerant Topology Control for AlltoOne and OnetoAll Communication in Wireles Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {7}, number = {3}, issn = {15361233}, year = {2008}, pages = {322331}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2007.70743}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  FaultTolerant Topology Control for AlltoOne and OnetoAll Communication in Wireles Networks IS  3 SN  15361233 SP322 EP331 EPD  322331 A1  Feng Wang, A1  My T. Thai, A1  Yingshu Li, A1  Xiuzhen Cheng, A1  DingZhu Du, PY  2008 KW  Algorithm/protocol design and analysis KW  Mobile Computing VL  7 JA  IEEE Transactions on Mobile Computing ER   
[1] I.F. Akyildiz, W. Su, S. Yogesh, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, 2002.
[2] R. Rajaraman, “Topology Control and Routing in Ad Hoc Networks: A Survey,” SIGACT News, vol. 33, no. 2, pp. 6073, 2002.
[3] F. Wang, K. Xu, M. Thai, and D.Z. Du, “Fault Tolerant Topology Control for OnetoAll Communications in Symmetric Wireless Networks,” Int'l J. Sensor Networks, special issue on theoretical and algorithmic aspects in sensor networks, vol. 2, nos. 3/4 pp. 163168, 2007.
[4] M. Hajiaghayi, N. Immorlica, and V.S. Mirrokni, “Power Optimization in FaultTolerant Topology Control Algorithms for Wireless MultiHop Networks,” Proc. ACM MobiCom, 2003.
[5] X. Jia, D. Kim, P. Wan, and C. Yi, “Power Assignment for KConnectivity in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, 2005.
[6] N. Li and J.C. Hou, “FLSS: A FaultTolerant Topology Control Algorithm for Wireless Networks,” Proc. ACM MobiCom, 2004.
[7] A. Srinivas and E. Modiano, “Minimum Energy Disjoint Path Routing in Wireless AdHoc Networks,” Proc. ACM MobiCom, 2003.
[8] J.E. Wieselthier, G.D. Nguyen, and A. Ephremides, “On the Construction of EnergyEfficient Broadcast and Multicast Trees in Wireless Networks,” Proc. IEEE INFOCOM, 2000.
[9] O. Egecioglu and T.F. Gonzalez, “MinimumEnergy Broadcast in Simple Graphs with Limited Node Power,” Proc. IASTED Int'l Conf. Parallel and Distributed Computing and Systems (PDCS '01), 2001.
[10] M. Cagalj, J.P. Hubaux, and C. Enz, “MinimumEnergy Broadcast in AllWireless Networks: NPCompleteness and Distribution Issues,” Proc. ACM MobiHoc, 2002.
[11] D. Li, X. Jia, and H. Liu, “Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks,” IEEE Trans. Mobile Computing, vol. 3, 2004.
[12] M. Bahramgiri, M. Hajiaghayi, and V. Mirrokni, “FaultTolerant and 3Dimensional Distributed Topology Control Algorithms in Wireless MultiHop Networks,” Proc. 11th IEEE Int'l Conf. Computer Comm. and Networks (ICCCN '02), 2002.
[13] E.L. Lloyd, R. Liu, M.V. Marathe, R. Ramanathan, and S.S. Ravi, “Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks,” Proc. ACM MobiHoc, 2002.
[14] E.L. Lloyd, R. Liu, M.V. Marathe, R. Ramanathan, and S.S. Ravi, “Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks,” Mobile Network Application, vol. 10, nos. 12, pp. 1934, 2005.
[15] G. Calinescu and P.J. Wan, “Range Assignment for High Connectivity in Wireless Ad Hoc Networks,” Proc. Second Int'l Conf. AdHoc Networks and Wireless (ADHOCNOW '03), 2003.
[16] S. Khuller and B. Raghavachari, “Improved Approximation Algorithms for Uniform Connectivity Problems,” Proc. 27th Ann. ACM Symp. Theory of Computing (STOC '95), 1995.
[17] R. Wattenhofer, L. Li, P. Bahl, and Y.M. Wang, “Distributed Topology Control for Wireless Multihop AdHoc Networks,” Proc. IEEE INFOCOM, 2001.
[18] L. Li, J.Y. Halpern, P. Bahl, Y.M. Wang, and R. Wattenhofer, “Analysis of a ConeBased Distributed Topology Control Algorithm for Wireless MultiHop Networks,” Proc. 20th Ann. ACM Symp. Principles of Distributed Computing (PODC '01), 2001.
[19] R. Ramanathan and R. Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. IEEE INFOCOM, 2000.
[20] J.W. Suurballe, “Disjoint Paths in a Network,” Networks, pp. 125145, 1974.
[21] A. Frank and E. Tardos, “An Application of Submodular Flows,” Linear Algebra and Its Applications, vols. 114/115, pp. 329348, 1989.
[22] H.N. Gabow, “A Representation for Crossing Set Families with Applications to Submodular Flow Problems,” Proc. Fourth Ann. ACM/SIGACTSIAM Symp. Discrete Algorithms (SODA '93), 1993.
[23] L.K. Fleischer, S. Iwata, and S.T. McCormick, “A Faster Capacity Scaling Algorithm for Minimum Cost Submodular Flow,” Math. Programming, vol. 92, pp. 119139, 2002.
[24] J. Cheriyan, T. Jord, and Z. Nutov, “Approximating KOutconnected Subgraph Problems,” Proc. Int'l Workshop Approximation Algorithms for Combinatorial Optimization (APPROX '98), pp. 7788, 1998.
[25] Y. Li, X. Cheng, and W. Wu, “Optimal Topology Control for Balanced Energy Consumption in Wireless Networks,” J. Parallel Distributed Computing, vol. 65, no. 2, pp. 124131, 2005.
[26] N. Lynch, Distributed Algorithms. Morgan Kaufmann, 1996.
[27] J. Edmonds and R. Giles, “A MinMax Relation for Submodular Functions on Graphs,” Annals of Discrete Math., vol. 1, pp. 185204, 1977.