Local adaptive transmit power assignment strategy for wireless sensor networks

Abstract

A distributed local adaptive transmit power assignment (LA-TPA) strategy was proposed to construct a topology with better performance according to the environment and application scenario and prolong the network lifetime. It takes the path loss exponent and the energy control coefficient into consideration with the aim to accentuate the minimum covering district of each node more accurately and precisely according to various network application scenarios. Besides, a self-healing scheme that enhances the robustness of the network was provided. It makes the topology tolerate more dead nodes than existing algorithms. Simulation was done under OMNeT++ platform and the results show that the LA-TPA strategy is more effective in constructing a well-performance network topology based on various application scenarios and can prolong the network lifetime significantly.

Keywords

wireless sensor network / topology control / transmit power assignment / range assignment / path loss exponent / energy control coefficient / robustness / network lifetime

References

[1] AkyildizI. F., SuW., SankarasubramaniamY., CayirciE.. Wireless sensor networks: A survey [J]. Computer Network, 2002, 38(4): 393-422

[2] JenniferY., BiswanathM., DipakG.. Wireless sensor network survey [J]. Computer Networks, 2008, 52(12): 2292-2330

[3] SunilJ., PrabhatR.. A Survey: Topology control for wireless sensor networks [C]. IEEE International Conference on Signal Processing, Communications and Networking, 2008ChennaiIEEE Press422-427

[4] HempsteadM., TripathiN., MauroP., WeiG. Y., BrooksD.. An ultra low power system architecture for sensor network applications [C]. Proceeding of the 32nd International Symposium on Computer Architecture, 2005Madison, WIIEEE Computer Society Press208-219

[5] LiuH., RoederT., WalshK., BarrR., SirerE. G.. Design and implementation of a single system image operating system for ad hoc networks [C]. 3rd International Conference on Mobile Systems, Applications, and Services, 2005Seattle, WAUSENIX Association Press149-162

[6] SajjadZ., AmirN., NasserY.. Efficient construction of network topology to conserve energy in wireless Ad hoc networks [J]. Computer Communications, 2008, 31(1): 160-173

[7] PenroseM. D.. A strong law for the longest edge of the minimal spanning tree [J]. The Annals of Applied Probability, 1999, 27(1): 340-361

[8] PenroseM. D.. On k-connectivity for a geometric random graph [J]. Random Structures and Algorithms, 1999, 15(2): 145-164

[9] SantiP., BloughD. M.. The critical transmitting range for connectivity in sparse wireless ad hoc networks [J]. IEEE Transactions on Mobile Computing, 2005, 2(1): 25-39

[10] KirousisL., KranakisE., KrizancD., PelcA.. Power consumption in packet radio networks [J]. Theoretical Computer Science, 2000, 243(1/2): 289-305

[11] ClementiA., PennaP., SilvestriR.. Hardness results for the power range assignment problem in packet radio networks [C]. 2nd International Workshop on Approximation Algorithm for Combinatorial Optimization Problems (RANDO APPRO 99), 1999Berkeley, CASpringer Press197-208

[12] AlthausE., CalinescuG., AndoiuI., PrasadS., TchervenskiN., ElikovskyA.. Power efficient range assignment in ad hoc wireless networks [C]. IEEE WCNC2003, 2003New Orleans, LAIEEE Press1889-1894

[13] LiN., HouJ. C., ShaL.. Design and analysis of an MST-based topology control algorithm [J]. IEEE Transactions on Wireless Communications, 2005, 4(3): 1195-1206

[14] LiN., HouJ. C.. Flss: A fault-tolerant topology control algorithm for wireless networks [C]. Proc of the 10th Annual International Conference on Mobile Computing and Networking, MobiCom’04, 2004New YorkACM Press275-286

[15] LiN., HalpernJ. Y., BahlP.. A cone-based distributed topology control algorithm for wireless multi-hop networks [J]. IEEE Transactions on Networking, 2005, 13(1): 147-159

[16] BorbashS. A., JenningE. H.. Distributed topology control algorithm for multihop wireless networks [C]. Proc IEEE International Joint Conference on Neural Networks, 2002Honolulu, HIIEEE Press355-360

[17] ROGER W, AARON Z. XTC: A practical topology control algorithm for ad hoc and sensor networks [C]// 18th International Parallel and Distributed Processing Symposium. New Mexico, 2004: 216–223.

[18] LiuL., LiL., HuBin.. Algorithms for k-fault tolerant power assignments in wireless sensor networks [J]. Science China Information Sciences, 2010, 53(12): 2527-2537

[19] IndranilS., LokeshK. S., SubhasK. G., RanjeetK. P.. Distributed fault-tolerant topology control in wireless multi-hop networks [J]. Wireless Networks, 2010, 16(6): 1511-1524

[20] AnejaY. P., ChandrasekaranR., XiangyongL., NairK. P. K.. A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks [J]. European Journal of Operational Research, 2010, 204(3): 604-612

[21] LiuH.-t., ZhangB.-x., ZhengJ., HusseinT. M.. An energy-efficient localized topology control algorithm for wireless ad hoc and sensor networks [J]. International Journal of Communication Systems, 2008, 21(11): 1205-1220

[22] LiD.-y., DuH.-w., LiuL., HuangS. C.. Joint topology control and power conservation for wireless sensor networks using transmit power adjustment [C]. 14th Annual International Conference on Computing and Combinatorics, 2008Dalian, ChinaSpringer Press541-550

[23] HarishS., ThomasG.. A new distributed topology control algorithm for wireless environments with non-uniform path loss and multipath propagation [J]. Ad hoc Networks, 2010, 8(3): 280-294

[24] SantiP.. Topology control in wireless Ad hoc and sensor networks [J]. ACM Computing Surveys, 2005, 37(2): 164-194

[25] NarayanaswamyS., KawadiaV., SreenivasR. S., KumarP. R.. Power control in ad hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol [C]. Proc of the European Wireless Conf, 2002FlorenceSpringer Press156-162

[26] ToussaintG. T.. The relative neighborhood graph of a finite planar set [J]. Pattern Recognition, 1980, 12(4): 261-268