›› 2011, Vol. 26 ›› Issue (2): 256-268.doi: 10.1007/s11390-011-1128-5

Special Issue: Computer Networks and Distributed Computing

• Computer Network and Information Security • Previous Articles     Next Articles

A Combinational Perspective in Stimulating Cooperation in Mobile Ad Hoc Networks

Mahshid Rahnamay-Naeini1,2, and Masoud Sabaei1   

  1. 1. Department of Computer Engineering and Information Technology, Amirkabir University of Technology P.O.Box 15875-4413, Tehran, Iran;
    2. Department of Electrical and Computer Engineering, University of New Mexico, Albuquerque, NM 87131, U.S.A.
  • Received:2010-06-21 Revised:2010-11-28 Online:2011-03-05 Published:2011-03-05
  • About author:Mahshid Rahnamay-Naeini received her B.Sc. degree from Sharif University of Technology, Tehran, Iran and her M.Sc. degree from Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran in the field of computer engineering and information technology in 2007 and 2009 respectively. She is currently a Ph.D. candidate in University of New Mexico, USA, in Department of Electrical and Computer Engineering in the field of communication. Her research interests are communication networks, network reliability, stochastic modeling, wireless networks, and game theory.
    Masoud Sabaei received his B.Sc. degree from Esfahan University of Technology, Esfahan, Iran, and his M.Sc. and Ph.D. degrees from Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran, all in computer engineering in 1992, 1995 and 2000 respectively. Dr. Sabaei has been a professor of Computer Engineering Department, Amirkabir University of Technology (Tehran Polytechnic) since 2002. His research interests are wireless networks, mobile ad hoc networks, wireless sensor networks, and telecommunication network management.
  • Supported by:

    This work is supported by Iran Telecommunication Research Center under Grant No. T-500-21804.

In wireless ad hoc networks cooperation among nodes cannot always be assumed since nodes with limited resources and different owners are capable of making independent decisions. Cooperation problems in topology control and packet forwarding tasks have been mostly studied separately but these two tasks are not independent. Considering a joint cooperation problem by taking into account dependencies between tasks will result in more reliable and efficient networks. In this paper topology control definition is extended to cover cooperation problem in both packet forwarding and topology control in a single problem. In this definition nodes have to adjust their transmission power and decide on their relay role. This paper models the interactions of nodes as a potential game with two-dimensional utility function. The presented model, named TCFORCE (Topology Control packet FORwarding Cooperation Enforcement), preserves the network connectivity and reduces the energy consumption by providing cooperative paths between all pairs of nodes in the network.

[1] Marti S, Giuli T J, Lai K, Baker M. Mitigating routing misbehavior in mobile ad hoc networks. In Proc. the 6th Annu. Int. Conf. Mobile Computing and Networking, Boston, USA, Aug. 6-11, 2000, pp.255-265.

[2] Santi P. Topology control in wireless ad hoc and sensor networks. ACM Computing Surveys, 2005, 37(2): 164-194.

[3] Rajaraman R. Topology control and routing in ad hoc networks: A survey. SIGACT News, 2002, 33(2): 60-73.

[4] Eidenbenz S, Resta G, Santi P. The COM-MIT protocol for truthful and cost-efficient routing in ad hoc networks with selfih nodes. IEEE Trans. Mobile Computing, 2008, 7(1): 463-476.

[5] Anderegg L, Eidenbenz S. Ad hoc-VCG: A truthful and costefficient routing protocol for mobile ad hoc networks with selfish agents. In Proc. the 9th Annu. Int. Conf. Mobile Computing and Networking, San Diego, USA, Sept. 14-19, 2003, pp.245-259.

[6] Chen K, Nahrstedt K. iPass: An incentive compatible auction scheme to enable packet forwarding service in Manets. In Proc. the 24th IEEE Int. Conf. Distributed Computing Systems, Tokyo, Japan, Mar. 23-26, 2004, pp.534-542.

[7] Buchegger S, Boudec J L. Performance analysis of the CON-FIDANT protocol: Cooperation of nodes fairness in dynamic ad hoc networks. In Proc. IEEE/ACM Symp. Mobile Ad Hoc Networking and Computing, Lausanne, Switzerland, Jun. 9-11, 2002, pp.226-236.

[8] Michiardi Y P, Molva R. CORE: A collaborative repudiation mechanism to enforce node cooperation in mobile ad hoc networks. In Proc. the 6th IFIP Conference on Security Communications, and Multimedia, Portorosz, Slovenia, Sept. 26-27, 2002, pp.107-121.

[9] Buttyán L, Hubaux J. Stimulating cooperation in selforganizing mobile ad hoc networks. ACM Journal of Mobile Networks and Applications, 2003, 8(5): 579-592.

[10] Santi P, Eidenbenz S, Resta G. A framework for incentive compatible topology control in non-cooperative wireless multi-hop networks. In Proc. Workshop on Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks, Los Angeles, USA, Sept. 25-26, 2006, pp.9-18.

[11] Eidenbenz S, Kumar V, Zust S. Equilibria in topology control games for ad hoc networks. ACM/Kluwer Mobile Networks and Applications, 2006, 11(2): 143-159.

[12] Komali R S, MacKenzie A B. Impact of selfih packet forwarding on energy-efficient topology control. In Proc. the 6th Int. Symposium on Modeling and Optimization, Berlin, Germany, Apr. 1-3, 2008, pp.251-259.

[13] Komali R S, MacKenzie A B, Gilles R P. Effect of selfih node behavior on efficient topology design. IEEE Transaction on Mobile Computing, 2008, 7(9): 1057-1069.

[14] Cai J, Liu Y, Lian J, Li M, Pooch U, Ni L. Truthful topology control in wireless ad hoc networks with selfih nodes. In Proc. International Conference on Parallel Processing, Ohio, USA, Aug. 14-18, 2006, pp.203-210.

[15] Yuen S, Li B. Strategyproof mechanism towards evolutionary topology formation in autonomous networks. ACM/Kluwer Mobile Networks and Applications, 2005, 10(6): 961-970.

[16] Fudenberg D, Tirole J. Game Theory. MIT Press, 1991.

[17] Osborne M J, Rubinstein A. A Course in Game Theory. MIT Press, 1994, pp.255-263.

[18] Monderer J D, Shapley L. Potential games. Games and Economic Behavior, 1996, 14(1): 124-143.

[19] Cisco Aironet 350 data sheets. http://www.cisco.com/en/US/ products/hw/wireless, 2007.

[20] Kawadia V, Kumar P R. Power control and clustering in ad hoc networks. In Proc. IEEE INFOCOM, San Francisco, USA, Mar. 30-Apr. 3, 2003, pp.459-469.

[21] Zhang X, Maxemchuk N. A generalized energy consumption analysis in multihop wireless networks. In Proc. IEEE Wireless Communications and Networking Conf., Atlanta, USA, Mar. 21-25, 2004, pp.1476-1481.

[22] Li L, Halpern J. A minimum-energy path-preserving topology-control algorithm. IEEE Transaction on Wireless Communications, 2004, 3(3): 910-921.

[23] Egoh K, De S. Priority-based receiver-side relay election in wireless ad hoc sensor networks. In Proc. Int. Conf. Wireless Communications and Mobile Computing, Vancouver, Canada, Jul. 3-6, 2006, pp.1177-1182.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] Min Yinghua; Yashwant K. Malaiya; Jin Boping;. Aliasing Errors in Parallel Signature Analyzers[J]. , 1990, 5(1): 24 -40 .
[2] Yao Rong; Kang Tai; Chen Tinghuai;. Algorithms for the Determination of Cutsets in a Hypergraph[J]. , 1990, 5(1): 41 -46 .
[3] Han Jianchao; Shi Zhongzhi;. Formalizing Default Reasoning[J]. , 1990, 5(4): 374 -378 .
[4] Cai Shijie; Zhang Fuyan;. A Fast Algorithm for Polygon Operations[J]. , 1991, 6(1): 91 -96 .
[5] Fei Xianglin; Liao Lei; Wang Hezhen; Wang Chengzao;. Structured Development Environment Based on the Object-Oriented Concepts[J]. , 1992, 7(3): 193 -201 .
[6] Shen Yidong;. Form alizing Incomplete Knowledge in Incomplete Databases[J]. , 1992, 7(4): 295 -304 .
[7] Zhou Yong; Tang Zesheng;. Constructing Isosurfaces from 3D Data Sets Taking Account of Depth Sorting of Polyhedra[J]. , 1994, 9(2): 117 -127 .
[8] Liu Jian; Chen Zhiming; Zhong Yanru; Du Zhong;. Compact DC-DC Converter for Pocket Micro-Controller Systems[J]. , 1996, 11(6): 607 -614 .
[9] wang Xuejun; Shi Chunyi;. A Multiagent Dynamic interaction Testbed:Theoretic Framework, System Architecture and Experimentation[J]. , 1997, 12(2): 121 -132 .
[10] Chen Yangjun;. Counting and Topological Order[J]. , 1997, 12(6): 497 -509 .

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved