1 / 8

Selection Criteria and Distributed Selection Algorithms in Wireless Cellular and Sensor Networks

Selection Criteria and Distributed Selection Algorithms in Wireless Cellular and Sensor Networks. Neelesh B. Mehta ECE Department, IISc. New Project Proposal. Outline. Research problem and applications Proposed approach Author ’ s previous work in this area Project milestones

knox
Télécharger la présentation

Selection Criteria and Distributed Selection Algorithms in Wireless Cellular and Sensor Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Selection Criteria and Distributed Selection Algorithms in Wireless Cellular and Sensor Networks Neelesh B. Mehta ECE Department, IISc New Project Proposal

  2. Outline • Research problem and applications • Proposed approach • Author’s previous work in this area • Project milestones • Budget estimates

  3. Research Problem Background • Selection arises naturally in several wireless systems • Cooperative communications • Cellular communications • Two key questions in selection • Whom to select? • Selection criterion depends on system • How to select? • Timer algorithm • Fast, scalable, and distributed r1 t r2 s r3 h1 h2 h3 h4

  4. Proposed Approach • Selection algorithm: Find optimal mapping • Maximize overall throughput for rate-adaptive systems • Minimize average BER for non-adaptive systems • Selection metric • Determine how important it is to account for channel and battery states • Evaluate ‘dumb’ criteria • Propose new smart criteria Optimal mapping will look like Timer Metric

  5. Previous Related Work By Author • On selection criteria • BhargavMedepally and Neelesh B. Mehta, “Voluntary Cooperative Energy Harvesting Relay Nodes: Analysis and Benefits”, IEEE Intl. Conf. on Communications (ICC), South Africa, May 2010. • On selection algorithms • AnandaTheertha, Neelesh B. Mehta, and Virag Shah, “On Optimal Timer-Based Distributed Selection For Rate-Adaptive Multi-user Diversity Systems”, National Conf. on Communications, Jan. 2010 [Received best paper award] • Virag Shah, Neelesh B. Mehta, and Raymond Yim, “Optimal Timer Based Selection Schemes”, To appear in IEEE Trans. on Communications, June 2010.

  6. Impact of Proposed Research • Customized distributed selection schemes for: • Cooperative systems to find best relay • Mobile multi-hop networks • Vehicular ad hoc networks • Selection and selection criteria for energy harvesting sensor networks

  7. Project Milestones First year • Develop timer-based selection method to select best node • Customize timer scheme to handle rate adaptive systems and simpler non-adaptive systems • Propose and evaluate performance of selection criteria for energy harvesting sensor networks Second year • Extend selection criteria to account for battery state of energy harvesting sensor node also • Develop selection algorithms to select multiple nodes

  8. Budget Estimate Total duration: 2 years

More Related