期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

无线传感器网络中参数设定的双层规划模型及算法 被引量：1

A Bi-Level Programming Model and Solution Algorithm on Optimal Parameter Setting in Wireless Sensor Networks
下载PDF
导出
摘要 能效及健壮性一直是大规模无线传感器网络研究的重点.当应用程序在基站进行广播查询时,通常采用泛洪这种鲁棒性强的方法对每个节点发送数据包.泛洪传播不仅会在较长时间内占用整个网络通信信道,影响正常的数据传输,它还将消耗大量的能量.在分析节点传输半径对泛洪平均建立时间(此时,网络中的所有节点都传输完泛洪数据包)以及数据包长度对传感器网络能效影响的基础上,提出了一个双层规划模型.上层模型的目标是设定最优节点传输半径,使泛洪平均建立时间最小;下层模型在上层模型的影响下,通过设定最优数据包长度使网络的能效达到最大.最后,通过数值分析说明了双层规划模型模拟泛洪传播及设定最优数据包长度是可行并且有效的. Both energy efficiency and robustuess are critical design challenges to large scales wireless sensor networks. Applications such as query propagation rely regularly on network-wide flooding as a robust way while frequent flooding consumes too much energy and bandwidth. The effect of packet size on the energy efficiency, and the impact of the transmission radius on the average settling time in which all nodes finish transmitting the flooded packet are analyzed in this paper. A bi-level programming model is imported： the upper level model aims to minimize the average settling time of flooding and the lower level model maximizes the energy efficiency of the whole network. Furthermore, one numerical example is introduced to validate the programming model which shows that the result is feasible and efficient.
作者 赵彤 杨文国 郭田德
机构地区 中国科学院研究生院数学科学学院
出处 《软件学报》 EI CSCD 北大核心 2007年第12期3124-3130,共7页 Journal of Software
基金 Supported by the Presidential Foundation of the Graduate University of the Chinese Academy of Sciences under Grant No.yzjj200503(中国科学院研究生院院长基金) the Scientific Research Startup Foundation of the Graduate University of the Chinese Academy of Sciences under Grant Nos.055101A KYQD200502(中国科学院研究生院科研启动基金)
关键词 无线传感器网络 双层规划模型 最优数据包长度 最优传输半径 wireless sensor network bi-level programming model optimal packet size optimal transmission radius
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献11

  • 1Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E. A survey on sensor networks. IEEE Communications Magazine, 2002, 40(8):102-114.
  • 2Intanagonwiwat C, Govindan R, Estrin D. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In: Pickholtz R, ed. Proc. of the 6th Annual Int'l Conf. on Mobile Computing and Networking. New York: ACM Press, 2000. 56-67.
  • 3Ni S, Tseng Y, Chen Y, Chen J. The broadcast storm problem in a mobile ad hoc network. In: Proc. of the 5th Annual ACM/IEEE Int'l Conf. Seattle: ACM Press, 1999. 151-162.
  • 4Zuniga ZM, Krishnamachari B. Optimal transmission radius for flooding in large scale wireless sensor networks. Journal of Cluster Computing, 2005,8(2-3): 167-178.
  • 5Takagi H, Kleinrock K. Optimal transmission ranges for randomly distributed packet radio terminals. IEEE Trans. on Communications, 1984,COM-32(3):246-257.
  • 6Akyildiz IF, Joe I. A new ATM adaptation layer for TCP/IP over wireless ATM networks. Wireless Networks, 2000,6(3):191-199.
  • 7Sankarasubramanian Y, Akyildiz IF, McLaughlin SW. Energy efficiency based packet size optimization in wireless sensor networks. In: Proc. of the 1st IEEE Int'l Workshop on Sensor Network Protocols and Applications (SNPA). Anchorage: IEEE CS Press, 2003, 1-8.
  • 8Chen P, Dea BO, Callaway E. Energy efficient system design with optimum transmission range for wireless Ad hoc networks. In: Proc. of the IEEE Int'l Conf. on Communications. New York: IEEE CS Press, 2002.945-952.
  • 9Ye W, Heidemann J, Estrin D. An energy-efficient MAC protocol for wireless sensor networks. In: Proc. of the INFOCOM 2002. San Francisco: IEEE CS Press, 2002. 1567-1576.
  • 10Dana TV, Langendoen K. An adaptive energy-efficient MAC protocol for wireless sensor networks. In: Proc. of the SenSys 2003. Los Angeles: ACM Press, 2003. 171-180.

同被引文献20

  • 1Chong C Y,Kumar S P.Sensor networks evolution opportunitiesand challenges[J].Proceedings of the IEEE,2003,91(8):1247-1256.
  • 2Ahlswede R,Cai N,Li S Y R,et al.Network informationflow[J].IEEE Transactions on Information Theory,2000,46(4):1204-1216.
  • 3Li S Y R,Yeung R W,Cai N,et al.Linear network coding[J].IEEE Transactions on Information Theory,2003,49(2):371-381.
  • 4Koetter R,Médard M.An algebraic approach to networkcoding[J].IEEE/ACM Transactions on Networking,2003,11(5):782-795.
  • 5Chou P A,Wu Y N,Jain K.Practical network coding[C]//Proceedings of 41st Allerton Conference on Communication,Control,and Computing,2003.
  • 6Ho T,Koetter R,Muriel M,et al.The benefits of codingover routing in a randomized setting[C]//Proceedings ofISIT2003,2003.
  • 7Ho T,Médard M,Koetter R.A random linear network codingapproach to multicast[J].IEEE Transactions on InformationTheory,2006,52(10):4413-4430.
  • 8Chachulski S,Jennings M,Katti S,et al.Trading structurefor randomness in wireless opportunistic routing[C]//Proceedingsof SIGCOMM’07,2007.
  • 9Ho T,Viswanathan H.Dynamic algorithms for multicastwith intra-session network coding[J].IEEE Transactionson Information Theory,2009,55(2):797-815.
  • 10Donoho D L.Compressed sensing[J].IEEE Transactionson Information Theory,2006,52(4):1289-1306.

引证文献1

软件学报
2007年 第12期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部