Computer Science ›› 2015, Vol. 42 ›› Issue (Z6): 279-284.

Previous Articles     Next Articles

Study of Wireless Sensor Network Model Based on Novel Local World Networks

WANG Jia-li, LI Hui-jia and JIA Chuan-liang   

  • Online:2018-11-14 Published:2018-11-14

Abstract: The existing wireless sensor network model seldom considers heterogeneous and load balance.And evaluation method of the model is limited.This paper proposed a wireless sensor network model based on novel local world network and took heterogeneous as well as node localization and local adjustment factor into account.The new model concludes wireless sensor network model based on energy aware local world network and wireless sensor network model based on load regulation local world network,which perfects the original model.By using MATLAB to simulate,this paper studied the degree distribution of the model and proposed an evaluation method of the model by comparing the characteristic parameters of complex networks.It introduces centrality in social network field to evaluate the importance of network node more deeply.Both theoretical analysis and experiment show that new model can describe the wireless sensor network well and can further optimize the network as well as improving communication ability.The idea of complex network used in this paper has positive effect on the research of wireless networks.

Key words: Wireless sensor network,Local world,Energy aware,Load regulation,Degree distribution

[1] Watts D J,Strogatz S H.Collective dynamics of ‘small-world’networks [J].Nature,1998,393(6684):440-442
[2] Barabási A-L,Albert R.Emergence of scaling in random networks [J].Science,1999,286(5439):509-512
[3] Ravasz E,Barabási A L.Hierarchical organization in complexnetworks[J].Physical Review E,2003,67(2):026112
[4] Li Hui-jia,Zhang Xiang-sun.Analysis of stability of community structure across multiple hierarchical levels[J].Europhysics Letters,2013,103(5),58002
[5] Sha K,Gehlot J,Greve R.Multipath routing techniques in wireless sensor networks:A survey[J].Wireless personal communications,2013,70(2):807-829
[6] Newman M E J.Assortative mixing in networks[J].Physical Review Letters,2002,89(20):208701
[7] 郭进利,汪丽娜.幂律指数在1与3之间的一类无标度网络[J].物理学报,2007,56(10):5635-5639
[8] Gross D,Shortle J F,Thompson J M,et al.Fundamentals ofqueueing theory[M].John Wiley & Sons,2013
[9] Freeman L C.Centrality in social networks conceptual clarification[J].Social networks,1979,1(3):215-239
[10] 汪秉宏.通讯网络-基于局域信息的最佳路由研究[M]∥郭雷,许晓鸣,史定华.复杂网络.上海:上海科技教育出版社,2006
[11] Barabási A L,Albert R.Emergence of scaling in random networks[J].Science,1999,286(5439):509-512
[12] 沈华伟,程学旗,陈海强,等.基于信息瓶颈的社区发现[J].计算机学报,2008,31(4):677-686
[13] 李慧嘉.基于信息扩散的多尺度重叠社团快速探测算法[J].计算机科学,2014,41(9):125-131
[14] Li Hui-jia,Zhang Jun-hua,Liu Zhi-ping,et al.Identifying overlapping communities in social networks using multi-scale local information expansion[J].European Physical Journal B,2012,85(6),109
[15] Bodik P,Hong W,Guestrin C,et al.Intel lab data.Online dataset,2004.http://db.csail.mit.edu/labdata/labdata.html
[16] Li Hui-jia,Xu Bing-ying,Zheng Liang,et al.Integrating attribu-tes of nodes solves the community structure partition effectively[J].Modern Physics Letters B,2014,28(05),1450037
[17] 马英红,李慧嘉,张晓东.赋权网络中的弱化免疫研究[J].管理科学学报,2010,13(10):32-39
[18] Rosvall M,Bergstrom C T.Maps of random walks on complex networks reveal community structure[J].Proceedings of the National Academy of Sciences,2008,105(4):1118-1123
[19] Blondel V D,Guillaume J L,Lambiotte R,et al.Fast unfolding of communities in large networks[J].Journal of Statistical mechanics-Theory and experiment,2008,10:10008
[20] Baras J S,Hovareshti P.Efficient and robust communication topologies for distributed decision making in networked systems[C]∥Proceedings of 47th IEEE Conference on Decision and Control.2008:2973-2978
[21] Newman M E J,Girvan M.Finding and evaluating community structure in networks[J].Physical Review E,2004,6(2)9:026113

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .