Topology Control in Wireless Ad Hoc Networks phần 6 potx

... 2004 Istituto di Informatica e Telem atica Open issues Open issues: 1/11  Considerable body of research devoted to TC in ad hoc networks, but several aspects have not been carefully investigated ... properties) using these distributions 5 th ACM MobiHoc – Tokyo, May 24, 2004 Istituto di Informatica e Telem atica More realistic network models Open issues: 2/11  Ad hoc network mod...

Ngày tải lên: 14/08/2014, 14:20

... the minimum-power path in G’ and in G  In words, the power stretch factor is a measure of the increase in the energy cost due to the fact that we communicate using the routing graph G’ instead ... Determine a range assignment RA such that G S is connected and the energy cost is minimum  Solving the WSRA problem remains NP-hard for two and three- dimensional networks [Blough et al...

Ngày tải lên: 14/08/2014, 14:20

... 2004 Istituto di Informatica e Telem atica Topology control: an informal definition Topology control: the art of coordinating nodes’ decisions regarding their transmitting ranges, in order to generate ... network capacity Introduction: 1/7 5 th ACM MobiHoc – Tokyo, May 24, 2004 Istituto di Informatica e Telem atica Topology Control in Wireless Ad Hoc Networks Paolo San...

Ngày tải lên: 14/08/2014, 14:20

... power the minimum level such that the corresponding routing table contains all the nodes in the network  Setting the power to this minimum level achieves the three goals of: – maximizing network ... CTR: 10/12  In [Narayanaswamy et al.02], the authors introduce COMPOW, a protocol that attempts to determine the CTR for connectivity in a distributed way  Nodes maintain a routing table...

Ngày tải lên: 14/08/2014, 14:20

... the expected interference 5 th ACM MobiHoc – Tokyo, May 24, 2004 Istituto di Informatica e Telem atica Existing TC protocols TC protocols: 6/ 12  RodopluMeng99: – Goal: build a topology that minimizes ... (reverse of the broadcast problem) – Drawbacks: non localized; GPS required  RamanathanRosales-Hain00: – Goal: minimize the maximum of nodes transmitting ranges while maintaining conne...

Ngày tải lên: 14/08/2014, 14:20

... simulating mobile ad hoc networks 5 th ACM MobiHoc – Tokyo, May 24, 2004 Istituto di Informatica e Telem atica Mobile networks Mobility: 1/10  Which is the impact of mobility on TC? – Increased ... (similar to KNeigh): – at the beginning, every node orders its neighbors (set of nodes in the maximum transmitting range) according to some criterion (e.g., link quality) – then, every...

Ngày tải lên: 14/08/2014, 14:20

... every node u in the network maintains one routing table for each power level  The routing table for level i, RT i , is updated by a routing daemon (one for each level), and contains all the nodes ... reconfiguration? o Preliminary step in this direction: the determination of the information exchange period for the LMST protocol [Li et al.03b] 5 th ACM MobiHoc – Tokyo, May 24, 2004 Istit...

Ngày tải lên: 14/08/2014, 14:20

... on-line at the following URL: http://www.imc.pi.cnr.it/~santi  A survey paper on TC: P. Santi, Topology Control in Wireless Ad Hoc and Sensor Networks , Tech. Rep. IIT-TR-04/2003, Istituto di Informatica ... MobiHoc – Tokyo, May 24, 2004 Istituto di Informatica e Telem atica Technological problems Level-based TC: 6/ 16  The authors of [KawadiaKumar03] experienced several probl...

Ngày tải lên: 14/08/2014, 14:20