By Topic

A priority based resource allocation with max-min fairness in active sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Devi, K.V. ; Dept. of Comput. Sci. & Eng., Kalasalingam Univ., Krishnankoil ; Mehata, K.M.

Active networks provide a programmable user-network interface that supports dynamic modification of the networkpsilas behavior. Network nodes, in addition to forwarding packets, perform customized computation on the messages flowing through them. Individual packets carry executable code, or references to executable code. Resources in an active network mainly comprise of CPU and bandwidth. The inherent unpredictability of processing times of active packet poses a significant challenge in CPU scheduling. An efficient allocation is required for the optimal utilization of the resources. This paper describes and evaluates an approach to CPU allocation in active sensor networks. An algorithm is also designed for the fair allocation of resources using max-min fairness. The effectiveness of the algorithm is measured through simulation. The results show that the fair rate is maintained close to the admission threshold.

Published in:

Networks, 2008. ICON 2008. 16th IEEE International Conference on

Date of Conference:

12-14 Dec. 2008