Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Computer Engineering

On Reducing Communication Energy Using Cross-Sensor Coding Technique, Kien Nguyen, Thinh Nguyen, Sen-Ching Cheung Feb 2011

On Reducing Communication Energy Using Cross-Sensor Coding Technique, Kien Nguyen, Thinh Nguyen, Sen-Ching Cheung

Electrical and Computer Engineering Faculty Publications

This paper addresses the uneven communication energy problem in data gathering sensor networks where the nodes closer to the sink tend to consume more energy than those of the farther nodes. Consequently, the lifetime of a network is significantly shortened. We propose a cross-sensor coding technique using On-Off keying which exploits (a) the tradeoff between delay and energy consumption and (b) the network topology in order to alleviate the problem of unequal energy consumption. We formulate our coding problem as an integer linear programming problem and show how to construct a number of codes based on different criteria. We show …


Optimal Layout Of Multicast Groups Using Network Embedded Multicast Security In Ad Hoc Sensor Networks, Richard R. Brooks, Brijesh Pillai, Michele C. Weigle, Matthew Pirretti Jan 2007

Optimal Layout Of Multicast Groups Using Network Embedded Multicast Security In Ad Hoc Sensor Networks, Richard R. Brooks, Brijesh Pillai, Michele C. Weigle, Matthew Pirretti

Computer Science Faculty Publications

This paper considers the security of sensor network applications. Our approach creates multicast regions that use symmetric key cryptography for communications. Each multicast region contains a single keyserver that is used to perform key management and maintain the integrity of a multicast region. Communications between two multicast regions is performed by nodes that belong to both regions. To ease the network management burden, it is desirable for the networks to self-organize into regions and dynamically select their keyservers. This paper shows how to determine the number of keyservers (k) to use and the size in the number of hops (h) …