Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Dynamic Adaptation Of Joint Transmission Power And Contention Window In Vanet, Danda B. Rawat, Gongjun Yan, Dimitrie C. Popescu, Michele C. Weigle, Stephan Olariu
Dynamic Adaptation Of Joint Transmission Power And Contention Window In Vanet, Danda B. Rawat, Gongjun Yan, Dimitrie C. Popescu, Michele C. Weigle, Stephan Olariu
Electrical & Computer Engineering Faculty Publications
In this paper, we propose an algorithm for joint adaptation of transmission power and contention window to improve the performance of vehicular network in a cross layer approach. The high mobility of vehicles in vehicular communication results in the change in topology of the Vehicular Ad-hoc Network (VANET) dynamically, and the communication link between two vehicles might remain active only for short duration of time. In order for VANET to make a connection for long time and to mitigate adverse effects due to high and fixed transmission power, the proposed algorithm adapts transmission power dynamically based on estimated local traffic …
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
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) …