519.83 22.1

. .

AD HOC 1

. .2,( . .., )

ad hoc . , . - . - , - . - . -, . , - . - , -. - - .

: , ad hoc , -, .

ad hoc - - -1 , 11-01-00771, 13-07-00491 .2 , (n.bazenkov@gmail.com).217

. 43

[23]. ad hoc-. ad hoc- (MANET) . (WSN) - , - , . - , - ad hoc - - 3g 4g [10]. ad hoc - , - . - (topology control) - , . - , - , - . -, , - , .. -. , - , - , . - , , - . - . - , - . , - , - , .

218

. .

, . - , . , - , . -, . - , - . , - , . -, - , - . . - , - , , . - , , . - . - -. . 1 - , - . 2 . 3. 6 . - 5. - 6.

219

. 43

1.

, , , - . - [21]. , - , NP- [9]. [8]. - . , LMST [16] - . . CBTC [17]. XTC , k [25]. - [7]. , - , , . [22], . [11, 15] - , , . [24] - , - . [18] (stochastic fictious play) , - . [5]. , -

220

. .

, [4] - , - . [3] - , - , . [1]. - - [2]. - , - [14]. , -, .

2.

2.1. , ,N={1, . . . , n}, . , - . p = (p1, . . . , pn), pi [0, pmax]. , .i j, -

(1)

pi(ij )>

,

pi i, > 1 , - , > 2 ij i j. , , . , - [21]. 1. , - (1), i pi, -221

. 43

pi- i Niout(pi). 2. , - p, g(p) =(N, E (p)), N , - ,E(p) , (i, j)E(p), i,j (1). 802.11 [12] 802.15 [13], ad hoc , - acknowledgement . - i j. . 3. g= (N, E) = (N, E), (i, j) E, (i, j) E (j, i) E. , , pmax. , - , gmax= g(pmax). -

(2)

Ctotal(p) = pi.iN -

p, g(p) 2 .

2.2. , - [15]. 4. -

(3)

= hN, {Ai}iN,{ui}iNi,

N = {1, . . . , n} - , ; Ai - i- ; ui:iNAiR .222

. .

- N= 1, . . . , n. i - pi[0, pmax]. , :

(4)

ui(p) = M fi(g(p)) pi. fi(g(p)) , i

g(p). , . M > pmax . - (4) , , -, , g(p).

2.3. 5. a - , i ai6= ai

(5)

ui(ai, ai)6 ui(ai, ai). ,

, . - . , . . 1 , , - . b . . 1 1 - , . - . 1 , . - . 1 . , - .223

. 43

a)

)

)

)

. 1. .) ; ) ; ) ;)

3.

3.1. , - . - - . , - - . - (learning process). - (iterated best response). 6. (best response) i ai

(6)

BRi(ai) = arg max ui(x, ai).xAi

. a0. . - , . k i - aki1.224

. .

a0 . , . 1 , - b. a c, - . 1. - , . 1. , .

3.2. (6) - , , . , - [5], , - . [5] . , - 0- , - (6). , 1- , -, 0. - 1 , [3]. 1- - 7. i ai

(7)

BRi2(ai) = arg max ui(x, BRi(x, ai)),

BRi(x, ai)

=

xAi(BR1(x, ai), . . . , BRi1(x, ai),

BRi+1(x, ai), . . . , BRn(x, ai)) i x. , (7) - . [4] - 225

. 43

. - , - . . 1 - , - . 1, . , - (7).

)

)

)

. 2. ) , ; ) Ctotal = 5 + 2;) Ctotal= 5 +

, - , , , - . . 2. c d, - , (c, d) , b. . 2. - , . 2 2. - -(a, c)(a, d). . 2 2 .226

. .

, - . 5 . . 2, .

3.3. (6) , - ai. . - . , i -. . 8. (Reflexive Set)Ri i , i (6). 9. - i ai

(8)

BR2i,Ri(ai) = arg max ui(x, aN\Ri, BRRi(x, ai )),

xAi aN\Ri , Ri; BRRi(x, ai) , Ri. . -, Ri= , -. Ri= N , -. i - , - i. (1), i .

(9)

Ri= {j | j Niout(pmaxi)}.

227

. 43

Niout(pmaxi/2), Niout(2pmaxi),k - .. - . (7) q , - (6). ,-, , , -, , . 2. , .

4.

4.1. , , . 0- -, (6). - [15], [11]. - (iterated best responses IBR). , , mac -. 1 ( ).1. (). - p0i=pmaxi. g0= g(pmax).2. (). i (6).pt+1i=BRi(pti).

3. ( ). .gt+1=g(pti+1, pti).4. (). 2 3 , .

228

. .

. [15] -, ., . - . - , [19]. , , .. 2 n , - . - . , , - . - . -. . 1, - , . 20 , - . 3. . - .

4.2. , (7). 2 ( ).

1. (). p0i=p0. g0= g(p0).2. (). i (7) (8)pt+1i=BR2i(pti)

229

. 43

)

)

. 3. 20 , ) ; )

pti+1= BR2i,Ri(pti), Ri .3. ( ). gt+1=g(pti+1, pti).4. (). 2 3 , .5. (). gt , - (6). 2. 2 (7) (8). - . 4 . - . 2 3 , - 5. . 3 , 2.

230

. .

4.3. , . , - , -, . , . , - , . -, . ci, , - . 1. 0, - . 3 ( ).1. (). pi= p0 ci= c0. g0= g(p0).2. (). i, (6),pbri=BRi(pti). ui(pbri, pi)> ui(pi, pi) ci> 0, pti+1= pbri. pti+1= BR2i(pti) ci = ci 1.3. ( ). - gt+1=g(pti+1, pti).4. (). 2 3 , . . , - c0.

231

. 43

5.

- MATLAB. , - , 100 100 . 10, 20, 30, 40 50 . - 100 . - pmax , - . . 4 , - , , . - 1, (BR ), , - (M ST ). [6] - , 1416%.

)

)

. 4. . x . y , ) ;)

, - -232

. .

)

)

. 5. . x . y ) ; )

-. , (4) - , MST . . 4 2. (7) (DBR -) (8), - (9) (LocalDBR ). DBR LocalDBR, - . , . 5. , , - . 3 - 1 3 ( V ar1, V ar2, V ar3). , 2 3. , , -233

. 43

. . 4 , 1 - (40 50 ). . 5. 2 . , . -. - . , . 5 , - 30 5,5 . 30%. - 20 30 . - , - -. 3 2, - . - , 1 .

6.

-, , - 1- . - - - .234

. .

- . . , . , - , - , - . . , - , - , ., - , , , . , - . , -. . - . , - . - - .

1. .. - // 55- - . . .: ,2012. 1. . 4648.235

. 43

2. .. . I: - // . 2004. 8. . 115132.3. .. - . .: , 2011. 127 .4. .., .. // . 2011. 5. . 6673.5. .., .. -. .: , 2003. 149 .6.ALTHAUSE.,C ALINESCUG.,M ANDOIUI.I.,PRASADS.,TCHERVENSKIN.,ZELIKOVSKYA.Power Efficient Range Assignment in Ad hoc WirelessNetwork// IEEE Wireless Communications and NetworkingConference (WCNC 2003), New Orleans, LA, USA, March2003. Vol. 3. P. 18891894.7.AZISA.A.,EKERCIO GLUY.A.,SINGHJ.P.,VENKATASUBRAMANIAN N.A Survey on DistributedTopology Control Techniques for Extending the Lifetimeof Battery Powered Wireless Sensor Networks// IEEECommunications Surveys and Tutorials. Vol. 15, No. 1. P. 121144.8.CALINESCU G., QIAO K.Asymmetric topology control:exact solutions and fast approximations// IEEE INFOCOMProceedings, March 2012, Orlando, Florida, USA. P. 783791.9.CLEMENTI A.E.F., PENNA P., SILVESTRI R.On thePower Assignment Problem in Radio Networks// ElectronicColloquium on Computational Complexity (ECCC). 2000. URL: http://eccc.hpi-web.de/eccc-reports/2000/TR00-054/index.html.

10.DO

N.M.,

HSU

C.-H.,

SINGH

J.P.,

236

VENKATASUBRAMANIANN.Massivelivevideodistribution using hybrid cellular and ad hoc networks//

. .

IEEE International Symposium on World of Wireless, Mobileand Multimedia Networks (WoWMoM), June 2011, Lucca,Italy. P. 19.11.EIDENBENZ S., KUMAR A., ZUST S.Equilibria inTopology Control Games for Ad Hoc Networks andGeneralizations // Mobile Network and Applications. 2006. Vol. 11, No. 2. P. 143159.12.IEEEStd.802.11Part11:WirelessLANMediumAccessControl(MAC)andPhysicalLayer(PHY)Specifications.2012.URL:http://standards.ieee.org/getieee802/download/802.11-2012.pdf ( 05.04.2013).13.IEEEStd.802.15.4Part15.4:Low-RateWirelessPersonal Area Networks (LR-WPAN). 2011. URL:http://standards.ieee.org/getieee802/download/802.15.4-2011.pdf ( 05.04.2013).14.JACKSON M.O. A Survey of Models of Network Formation:Stability and Efficiency // In: Group Formation in Economics:Networks, Clubs and Coalitions, edited by Gabrielle Demangeand Myrna Wooders. - Cambridge University Press:Cambridge, UK, 2005.15.KOMALI R.S., MACKENZIE A.B., GILLES R.P.Effect ofSelfish Node Behavior on Efficient Topology Design // IEEETransactions on Mobile Computing. 2008. Vol. 7, No. 9. P. 10571070.16.LI N., HOU J.C., SHA L.Design and Analysis of an MST-Based Topology Control Algorithm // Twenty-Second AnnualJoint Conference of the IEEE Computer and Communications(INFOCOM 2003), San Francisco, CA, USA. 2003. Vol. 3. P. 17021712.17.LIL.,HALPERNJ.Y.,BAHLP.,YI-MINW.,WATTENHOFER R.A cone-based distributed topology-control algorithm for wireless multi-hop networks//IEEE/ACM Transactions on Networking, February, 2005. Vol. 13, No. 1. - P. 147159.237

. 43

18.LONG C., ZHANG Q., LI B., YANG H., GUAN XNon-Cooperative Power Control for Wireless Ad Hoc Networkswith Repeated Games// IEEE Journal on Selected Areas inCommunications. - 2007. Vol. 25, No. 6. P. 11011112.19.MONDERER D., SHAPLEY L.S. Potential Games // Gamesand Economic Behavior. 1996. Vol. 14. P. 124143.20.NISANN.,ROUGHGARDENT.,TARDOSE.,VAZIRANI V.V.Algorithmic Game Theory. CambridgeUniversity Press, New York, NY, USA, 2007. - 776 p.21.SANTI P. Topology Control in Wireless Ad Hoc and SensorNetworks// Journal ACM Computing Surveys (CSUR). Vol. 37, No. 2. P. 164194.22.SHI H.-Y., WANG W.-L., KWOK N.-M., CHEN S.-Y. GameTheory for Wireless Sensor Networks: A Survey // Sensors. 2012. Vol. 12, No. 7. P. 90559097.23.TOH C.K.-K.Ad Hoc Wireless Networks: Protocols andSystems (1sted.). Prentice Hall PTR: Upper Saddle River,NJ, USA, 2002.24.REN H., MENG M.Q.-H.Game-Theoretic Modeling ofJoint Topology Control and Power Scheduling for WirelessHeterogeneous Sensor Networks// IEEE Transactions onAutomation Science and Engineering. 2009. Vol. 6, No. 4. P. 610625.25.WATTENHOFER R., ZOLLINGER A.XTC: A PracticalTopology Control Algorithm for Ad-Hoc Networks// 18thInternational Parallel and Distributed Processing Symposium,Santa Fe, NM, USA, 2004.26.ZARIFZADEH S., YAZDANI N., NAYYERI A.Energy-efficient topology control in wireless ad hoc networks withselfish nodes// Computer Networks. 2012. Vol. 56. P. 902914.

238

. .

DOUBLE BEST RESPONSE DYNAMICS INTOPOLOGY FORMATION GAME FOR AD HOCNETWORKS

Nikolay Bazenkov, Institute of Control Sciences of RAS, Moscow,(n.bazenkov@gmail.com).

Abstract: We consider a topology formation problem for wireless adhoc networks. There are wireless nodes located on a plane. Everynode can dynamically adjust its transmission power. The globalobjective is to assign optimal transmission power to every node suchthat the resulting topology is connected and minimizes total powercost. The topology formation problem is studied as a noncooperativegame. We propose two algorithms of collective behavior based on the,so-called, "double best response" decision rule . This decision ruleoriginates from a reflexive game framework and describes behaviorof an agent with the first rank of reflection. Efficiency of proposedalgorithms is evaluated by simulations and is compared with aconventional best response algorithm.

Keywords: network formation game, ad hoc networks, reflection,double best response.

. . 15.04.2013. 31.05.2013.

239