Crowd Management System A presentation by Abhinav Golas Mohit Rajani Nilay Vaish Pulkit Gambhir
Abstract <ul><li>Need to monitor crowd and environment in large gatherings. </li></ul><ul><li>System to achieve the same m...
Why ad-hoc networks ? <ul><li>Easy deployability </li></ul><ul><li>Scalability much beyond any other wired or wireless net...
System Specifications <ul><li>(Network Mote + Sensor Board) deployed at every entrance and exit </li></ul><ul><li>Each net...
Mote & Sensors
Hardware Requirement <ul><li>Berkeley MPR410 wireless motes containing </li></ul><ul><li>ATMega128L  µ-controller </li></u...
MPR410
MIB 510
Door setup <ul><li>Door will be divided into entry, exit points </li></ul><ul><li>Each entry/exit point will have a light ...
Door setup <ul><li>Sensitivity – can detect person if beam is cut for min. 0.8 sec </li></ul><ul><li>Temperature and humid...
Issues in ad-hoc network setup <ul><li>Collisions and packet loss </li></ul><ul><li>Need for algorithms that are fault tol...
Networking Setup <ul><li>We use a flooding type protocol to do time synchronization initially. </li></ul><ul><li>During th...
Networking Setup
Configuration Parameters <ul><li>We can currently determine :- </li></ul><ul><ul><li>Children and Parent of every network ...
Work Distribution <ul><li>Nilay, Pulkit – Currently working on network scheduling and routing </li></ul><ul><li>Abhinav, M...
Progress <ul><li>Programming  : </li></ul><ul><li>Trip switch reports number of crossings of users in either direction </l...
Progress <ul><li>Other progress  : </li></ul><ul><li>Routing algorithm finalized. Ensures zero packet loss and minimizes p...
Future Plan <ul><li>Improve sensitivity of trip switch – 10 th  September </li></ul><ul><li>Complete implementation of rou...
Upcoming SlideShare
Loading in...5
×

Crowd management system

1,021

Published on

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
1,021
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
22
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Crowd management system

  1. 1. Crowd Management System A presentation by Abhinav Golas Mohit Rajani Nilay Vaish Pulkit Gambhir
  2. 2. Abstract <ul><li>Need to monitor crowd and environment in large gatherings. </li></ul><ul><li>System to achieve the same must be scaleable, portable and require minimal configuration. </li></ul><ul><li>Intent : Building such a system on a robust ad-hoc network backbone. </li></ul>
  3. 3. Why ad-hoc networks ? <ul><li>Easy deployability </li></ul><ul><li>Scalability much beyond any other wired or wireless network solution </li></ul><ul><li>Zero infrastructural requirement </li></ul><ul><li>Self configurable and Self healing networks </li></ul><ul><li>Global networking parameters determined by purely local decision making </li></ul><ul><li>Minimal external computation required </li></ul>
  4. 4. System Specifications <ul><li>(Network Mote + Sensor Board) deployed at every entrance and exit </li></ul><ul><li>Each network mote logs data about environment </li></ul><ul><li>Data routed in a efficient store and forward manner to a base station </li></ul><ul><li>Base station may deploy data over an alternative network interface such as LAN or GPRS </li></ul>
  5. 5. Mote & Sensors
  6. 6. Hardware Requirement <ul><li>Berkeley MPR410 wireless motes containing </li></ul><ul><li>ATMega128L µ-controller </li></ul><ul><li>CC1000 radio transceiver </li></ul><ul><li>512Kb Flash logger </li></ul><ul><li>Pluggable MTS400CA sensor boards to detect personnel movement and environment monitoring </li></ul><ul><li>MIB510 Programming board </li></ul><ul><li>Serial interface to PC </li></ul><ul><li>Easy on-board testing of motes </li></ul>
  7. 7. MPR410
  8. 8. MIB 510
  9. 9. Door setup <ul><li>Door will be divided into entry, exit points </li></ul><ul><li>Each entry/exit point will have a light beam focused onto the light sensor of the mote </li></ul><ul><li>When light beam is cut, counter increases by 1 </li></ul><ul><li>This information will be passed onto server </li></ul>
  10. 10. Door setup <ul><li>Sensitivity – can detect person if beam is cut for min. 0.8 sec </li></ul><ul><li>Temperature and humidity information also collected periodically </li></ul><ul><li>People count will be decided at server, by subtracting the 2 counts </li></ul><ul><li>Suitable contraption will be designed to ensure no other light gets to sensor </li></ul><ul><li>Advantage over single entry/exit </li></ul><ul><li>Single entry/exit system may not be able to handle concurrent user crossings </li></ul>
  11. 11. Issues in ad-hoc network setup <ul><li>Collisions and packet loss </li></ul><ul><li>Need for algorithms that are fault tolerant and depend only on local information in network </li></ul><ul><li>Time Synchronization </li></ul><ul><li>Interference in network, need to work with minimum message exchanges </li></ul><ul><li>Efficient power management – need to look into radio stack implementation </li></ul>
  12. 12. Networking Setup <ul><li>We use a flooding type protocol to do time synchronization initially. </li></ul><ul><li>During this flooding stage lots of packets are broadcasted in the network, and the network “configures itself” </li></ul><ul><li>During “configuration” we try and determine parameters essential for network routing, network scheduling and other optimizations. </li></ul>
  13. 13. Networking Setup
  14. 14. Configuration Parameters <ul><li>We can currently determine :- </li></ul><ul><ul><li>Children and Parent of every network node. In the routing tree. This means we can establish two-way communication in our network hierarchy. </li></ul></ul><ul><ul><li>Network sub-tree size below every node. This can be useful for efficient scheduling. </li></ul></ul><ul><li>Currently we are exploring ways to do post-order traversals in the tree for the purpose of polling the nodes. </li></ul>
  15. 15. Work Distribution <ul><li>Nilay, Pulkit – Currently working on network scheduling and routing </li></ul><ul><li>Abhinav, Mohit – Currently working on Trip switch </li></ul><ul><li>Simultaneous work going on in algorithm building by all four ( accounts for most of present work ) </li></ul>
  16. 16. Progress <ul><li>Programming : </li></ul><ul><li>Trip switch reports number of crossings of users in either direction </li></ul><ul><li>Motes build routing tree for the ad – hoc network for 2 – way routing (without need for broadcast) and network size estimation </li></ul>
  17. 17. Progress <ul><li>Other progress : </li></ul><ul><li>Routing algorithm finalized. Ensures zero packet loss and minimizes power consumption. </li></ul><ul><li>Scheduling algorithm close to completion </li></ul><ul><li>Trip switch testing in progress </li></ul>
  18. 18. Future Plan <ul><li>Improve sensitivity of trip switch – 10 th September </li></ul><ul><li>Complete implementation of routing and scheduling algorithms to set up ad – hoc network – 30 th September </li></ul><ul><li>Develop interactive web interface for accessing information – 10 th October - end </li></ul>
  1. A particular slide catching your eye?

    Clipping is a handy way to collect important slides you want to go back to later.

×