Chin-Yi University of Technology Institute of Electronic Engineering Network E.M.U Application Lab Reporter : Huang-Wei Liu Advisor : Tsung-Hung Lin 1.

Slides:



Advertisements
Similar presentations
Self-Configurable Positioning Technique for Multi-hop Wireless Networks To appear in IEEE Transaction on Networking Chong Wang Center of Advanced Computer.
Advertisements

Multirate adaptive awake-sleep cycle in hierarchical heterogeneous sensor network BY HELAL CHOWDHURY presented by : Helal Chowdhury Telecommunication laboratory,
GRS: The Green, Reliability, and Security of Emerging Machine to Machine Communications Rongxing Lu, Xu Li, Xiaohui Liang, Xuemin (Sherman) Shen, and Xiaodong.
General Description Coverage-Preserving Routing Protocol for WSNs Distributed, power-balanced multi- hop routing protocol Coverage-preserving based route-
Generated Waypoint Efficiency: The efficiency considered here is defined as follows: As can be seen from the graph, for the obstruction radius values (200,
Location-Aware Security Services for Wireless Sensor Networks using Network Coding IEEE INFOCOM 2007 최임성.
KAIST Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks Suho Yang (September 4, 2008) Ming Ma, Yuanyuan Yang IEEE Transactions.
Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.
Impact of Mobility and Heterogeneity on Coverage and Energy Consumption in Wireless Sensor Networks Xiao Wang, Xinbing Wang, Jun Zhao Department of Electronic.
Mobility Improves Coverage of Sensor Networks Benyuan Liu*, Peter Brass, Olivier Dousse, Philippe Nain, Don Towsley * Department of Computer Science University.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
A Hierarchical Energy-Efficient Framework for Data Aggregation in Wireless Sensor Networks IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 55, NO. 3, MAY.
IEEE TSMCA 2005 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS Presented by 황재호.
1 TTS: A Two-Tiered Scheduling Algorithm for Effective Energy Conservation in Wireless Sensor Networks Nurcan Tezcan & Wenye Wang Department of Electrical.
Speaker: Li-Sheng Chen 1 Jan 2, 2012 EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing Protocol for Wireless Ad Hoc Networks.
Maximum Network lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Mihaela Cardei, Jie Wu, Mingming Lu, and Mohammad O. Pervaiz Department.
Impact of Different Mobility Models on Connectivity Probability of a Wireless Ad Hoc Network Tatiana K. Madsen, Frank H.P. Fitzek, Ramjee Prasad [tatiana.
Delay Analysis of Large-scale Wireless Sensor Networks Jun Yin, Dominican University, River Forest, IL, USA, Yun Wang, Southern Illinois University Edwardsville,
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Layered Approach using Conditional Random Fields For Intrusion Detection.
The Coverage Problem in Wireless Ad Hoc Sensor Networks Supervisor: Prof. Sanjay Srivastava By, Rucha Kulkarni
Authors: Sheng-Po Kuo, Yu-Chee Tseng, Fang-Jing Wu, and Chun-Yu Lin
Using Rotatable and Directional (R&D) Sensors to Achieve Temporal Coverage of Objects and Its Surveillance Application You-Chiun Wang, Yung-Fu Chen, and.
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
Energy Efficient Routing and Self-Configuring Networks Stephen B. Wicker Bart Selman Terrence L. Fine Carla Gomes Bhaskar KrishnamachariDepartment of CS.
TRUST, Spring Conference, April 2-3, 2008 Taking Advantage of Data Correlation to Control the Topology of Wireless Sensor Networks Sergio Bermudez and.
Mobility Weakens the Distinction between Multicast and Unicast Xinbing Wang Dept. of Electronic Engineering Shanghai Jiao Tong University Shanghai, China.
K. Banerjee, P. Basuchaudhuri, D. Sadhukhan and N. Das
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
1/30 Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks Wireless and Sensor Network Seminar Dec 01, 2004.
Coordinated Sensor Deployment for Improving Secure Communications and Sensing Coverage Yinian Mao, Min Wu Security of ad hoc and Sensor Networks, Proceedings.
On Energy-Efficient Trap Coverage in Wireless Sensor Networks Junkun Li, Jiming Chen, Shibo He, Tian He, Yu Gu, Youxian Sun Zhejiang University, China.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Multi-Resolution Spatial and Temporal Coding in a Wireless Sensor Network for Long-Term Monitoring Applications You-Chiun Wang, Member, IEEE, Yao-Yu Hsieh,
Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users Yingzhe Li, Xinbing Wang, Xiaohua Tian Department of Electronic Engineering.
Cross-layer Packet Size Optimization for Wireless Terrestrial, Underwater, and Underground Sensor Networks IEEE INFOCOM 2008 Mehmet C. Vuran and Ian F.
Converge-Cast: On the Capacity and Delay Tradeoffs Xinbing Wang Luoyi Fu Xiaohua Tian Qiuyu Peng Xiaoying Gan Hui Yu Jing Liu Department of Electronic.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
Bounded relay hop mobile data gathering in wireless sensor networks
A Dead-End Free Topology Maintenance Protocol for Geographic Forwarding in Wireless Sensor Networks IEEE Transactions on Computers, vol. 60, no. 11, November.
Dual-Region Location Management for Mobile Ad Hoc Networks Yinan Li, Ing-ray Chen, Ding-chau Wang Presented by Youyou Cao.
1 Utilizing Shared Vehicle Trajectories for Data Forwarding in Vehicular Networks IEEE INFOCOM MINI-CONFERENCE Fulong Xu, Shuo Gu, Jaehoon Jeong, Yu Gu,
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Copyright © 2011, Scalable and Energy-Efficient Broadcasting in Multi-hop Cluster-Based Wireless Sensor Networks Long Cheng ∗ †, Sajal K. Das†,
Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Wensheng Zhang, and Chuang Wang Department of Computer Science, Iowa State University.
Fast and Reliable Route Discovery Protocol Considering Mobility in Multihop Cellular Networks Hyun-Ho Choi and Dong-Ho Cho Wireless Pervasive Computing,
Enhanced MAC Protocol to reduce latency in Wireless Sensor Network Myungsub Lee 1, Changhyeon Park 2 1 Department of Computer Technology, Yeungnam College.
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation Yanwei Wu, Member, IEEE, Xiang-Yang Li, Senior Member, IEEE, YunHao Liu, Senior.
Two Connected Dominating Set Algorithms for Wireless Sensor Networks Overview Najla Al-Nabhan* ♦ Bowu Zhang** ♦ Mznah Al-Rodhaan* ♦ Abdullah Al-Dhelaan*
KAIS T Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua MobiCom ‘05 Presentation by.
Adaptive Tracking in Distributed Wireless Sensor Networks Lizhi Yang, Chuan Feng, Jerzy W. Rozenblit, Haiyan Qiao The University of Arizona Electrical.
Energy-Efficient Randomized Switching for Maximizing Lifetime in Tree- Based Wireless Sensor Networks Sk Kajal Arefin Imon, Adnan Khan, Mario Di Francesco,
Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati (Fellow IEEE) IEEE Transactions on Mobile Computing, March 2012.
ICIIS Peradeniya, Sri Lanka1 An Enhanced Top-Down Cluster and Cluster Tree Formation Algorithm for Wireless Sensor Networks H. M. N. Dilum Bandara,
Doc.: a Submission September 2004 Z. Sahinoglu, Mitsubishi Electric research LabsSlide 1 A Hybrid TOA/RSS Based Location Estimation Zafer.
Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Younghwan Yoo† and Dharma P. Agrawal‡ † School of Computer Science and Engineering, Pusan National University, Busan, KOREA ‡ OBR Center for Distributed.
Mobile Networks and Applications (January 2007) Presented by J.H. Su ( 蘇至浩 ) 2016/3/21 OPLab, IM, NTU 1 Joint Design of Routing and Medium Access Control.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Group Multicast Capacity in Large Scale Wireless Networks
Hacker Detection in Wireless sensor network
استاد راهنما: دکتر کمال جمشیدی ارائه دهنده: حجت اله بهلولی دی ماه 1386
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks High-Speed Networking Lab. Dept. of CSIE,
Modeling and Simulation of WSN for Target Tracking
Presentation transcript:

Chin-Yi University of Technology Institute of Electronic Engineering Network E.M.U Application Lab Reporter : Huang-Wei Liu Advisor : Tsung-Hung Lin 1

Network E.M.U Application Lab  IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 7, NO. 6, JUNE 2008  Yun Wang, Student Member, IEEE Xiaodong Wang, Student Member, IEEE Bin Xie, Senior Member, IEEE Demin Wang, Student Member,IEEE Dharma P. Agrawal, Fellow, IEEE 2

Network E.M.U Application Lab  Introduction  Intrusion detection model and definitions  Intrusion detection in a homogeneous wireless sensor network  Intrusion detection in a heterogeneous wireless sensor network  Network connectivity and broadcast reachability in a heterogeneous wireless sensor network  Simulation and Verification  Conclusion  Reference 3

Network E.M.U Application Lab  The intrusion detection application concerns how fast the intruder can be detected by the WSN.  A high-density deployment policy increases the network investment and may be even unaffordable for a large area.  A network with small and scattered void areas will also be able to detect a moving intruder within a certain intrusion distance. 4

Network E.M.U Application Lab  In this paper, the authors derive the expected intrusion distance and evaluate the detection probability in different application scenarios. 5

Network E.M.U Application Lab  The main contributions of this paper:  Developing an analytical model for intrusion detection in WSNs, and mathematically analyzing the detection probability with respect to various network parameters.  Applying the analytical model to single-sensing detection and multiple-sensing detection scenarios for homogeneous and heterogeneous WSNs. 6

Network E.M.U Application Lab  Defining and examining the network connectivity and broadcast reachability in a heterogeneous WSN. 7 Fig. Intrusion detection in a WSN

Network E.M.U Application Lab  Our intrusion detection model includes :  Network Model  Detection Model  Intrusion Strategy Model 8

Network E.M.U Application Lab  Network Model  Homogeneous (Fig.1(a))  Heterogeneous (Fig.1(b)) 9 sensor type I sensor type II Fig.1 Network model type : (a)Homogeneous WSNs(b)Heterogeneous WSNs (a) (b) intruder Sensor that has a smaller sensor range r s2 as well as a shorter transmission range r x2 Sensor that has a large sensor range r s1 as well as a longer transmission range r x1 L L λ1λ1 λ2λ2 λ : node density of the WSN AA A : square area L*L

Network E.M.U Application Lab  Detection Model  The detection model defines how the intruder can be detected.  Two detection models : ▪ single-sensing detection model ▪ multiple-sensing detection model  Three metrics (Fig.2) : ▪ Intrusion distance ▪ Detection probability ▪ Average intrusion distance 10

Network E.M.U Application Lab 11 D D : Intrusion detection distance Ρ % : detection probability Ρ % E(D): Average intrusion distance E(D) the expected distance that the intruder travels before it is detected by the WSN for the first time the probability that an intruder is detected within a certain intrusion distance the distance that the intruder travels before it is detected by a WSN for the first time. Fig.2 three metrics of WSNs

Network E.M.U Application Lab  Intrusion Strategy Model  The intrusion strategy illustrates the moving policy of the intruder.  Two intrusion strategies for the movement of the intruder in a WSN: the intrusion path is a straight line(Fig.3) and the intrusion area accordingly is a curved band(Fig.4). 12

Network E.M.U Application Lab 13 Fig. 3. Intrusion strategy 1. Fig. 4. Intrusion strategy 2. If D 1 =D 2, the corresponding intrusion detection areas approximately satisfy S 1 =S 2.

Network E.M.U Application Lab 14 Calculate S D : Fig. 5. The intruder starts from the boundary of the WSN. Fig. 6. The intruder starts form a random point in the WSN.

Network E.M.U Application Lab 15 Instrusion detection analytical items

Network E.M.U Application Lab  Single-Sensing Detection ( homogeneous ) 16 Thorem 1. Thorem 3. Thorem 2. Possion distributed: (1) (2) (3)

Network E.M.U Application Lab  K-Sensing Detection ( homogeneous ) 17 Thorem 4. Thorem 5. Thorem 6. (4) (5) (6)

Network E.M.U Application Lab  Detection Model: 18 Fig. 7. Intrusion detection at the start point (D h =0). Fig. 8. Intrusion detection in the heterogeneous WSN (D h = ξ). Intruder I Intruder II Intruder I

Network E.M.U Application Lab  Single-Sensing Detection ( heterogeneous ) 19 Thorem 7. Thorem 8. Thorem 9. (7) (8) (9)

Network E.M.U Application Lab  K-Sensing Detection ( heterogeneous ) 20 Thorem 12. Thorem 10. Thorem 11. (10) (11) (12)

Network E.M.U Application Lab  Incorporating Node Availability  RIS(Random Independent Sleeping) scheme.  The authors assume all sensors have the same availability probability, denoted by p a.  Therefore, the above analysis can be extended to incorporate RIS scheme with a node availability rate p a by replacing the previous node densities, λ, λ 1, and λ 2 with λp a, λ 1 p a1, and λ 2 p a2, respectively. 21

Network E.M.U Application Lab  A WSN must provide satisfactory connectivity so that sensors can communicate for data collaboration and reporting to the administrative center.  In a heterogeneous WSN, the deployment of sensors with different capability complicates the network operation with the asymmetric links. 22

Network E.M.U Application Lab  In a heterogeneous WSN, sensors mainly use a broadcast paradigm for communication and high-capacity sensors usually undertake more important tasks. 23

Network E.M.U Application Lab  Two fundamental characteristics of a heterogeneous WSN. The definitions are listed below:  Network connectivity ▪ The probability that a packet broadcasted from any sensor can reach all the other sensors in the network.  Broadcast reachability ▪ The probability that a packet broadcasted from any Type I sensor can reach all the other sensors in the network. 24 (13) (14)

Network E.M.U Application Lab  The results indicate that for a given heterogeneous WSN, the network connectivity and broadcast reachability is enhanced with the increase of node density and transmission range. 25

Network E.M.U Application Lab  The analytical and simulation results are compared by varying the sensing range, transmission range, node density, and node availability.  In the simulation, sensors are deployed in accordance with a uniform distribution in a squared network domain. 26

Network E.M.U Application Lab  The intruder moves into the network domain from a randomly selected point on the network boundary.  The simulation includes that:  Verification for Homogeneous WSNs  Verification for Heterogeneous WSNs  Verification for Network Connectivity and Broadcast Reachability 27

Network E.M.U Application Lab  Verification for Homogeneous WSNs 28 Simulation Parameters

Network E.M.U Application Lab 29 Fig. 10. Intrusion detection probability (single and three-sensing) in the homogeneous WSN. Fig. 11. Average intrusion distance (single and three-sensing in the homogeneous WSN.) Simulation results(Verification for Homogeneous WSNs) Sensing range : 0~30 meter r s, P r s, E(D)

Network E.M.U Application Lab  Verification for Heterogeneous WSNs 30 Simulation Parameters

Network E.M.U Application Lab 31 Fig. 12. Intrusion detection probability under heterogeneous case. Simulation results(Verification for Heterogeneous WSNs) Heter[k=1] Homo[k=1] Heter[k=3] Homo[k=3] Type I, P

Network E.M.U Application Lab  Verification for Network Connectivity and Broadcast Reachability 32 Simulation Parameters

Network E.M.U Application Lab 33 Fig. 14. Effects of Type I sensors on the broadcast reachability in heterogeneous WSN. Fig. 13. Effects of transmission range on the broadcast reachability in heterogeneous WSN. Simulation results(Verification for Network Connectivity and Broadcast Reachability) br(heter) con(heter) con(homo) con(heter) r x, P br, P con Type I, P br, P con

Network E.M.U Application Lab  This paper analyzes the intrusion detection problem in both homogeneous and heterogeneous WSNs by characterizing intrusion detection probability with respect to the intrusion distance and the network parameters. 34

Network E.M.U Application Lab 35 [1] D.P. Agrawal and Q.-A. Zeng, Introduction to Wireless and Mobile Systems. Brooks/Cole Publishing, Aug [2] B. Liu and D. Towsley, “Coverage of Sensor Networks: Fundamental Limits,” Proc. Third IEEE Int’l Conf. Mobile Ad Hoc and Sensor Systems (MASS), Oct [3] S. Ren, Q. Li, H. Wang, X. Chen, and X. Zhang, “Design and Analysis of Sensing Scheduling Algorithms under Partial Coverage for Object Detection in Sensor Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 3, pp , Mar [4] S. Banerjee, C. Grosan, A. Abraham, and P. Mahanti, “Intrusion Detection on Sensor Networks Using Emotional Ants,” Int’l J. Applied Science and Computations, vol. 12, no. 3, pp , [5] S. Capkun, M. Hamdi, and J. Hubaux, “GPS-Free Positioning in Mobile Ad-Hoc Networks,” Proc. 34th Ann. Hawaii Int’l Conf. System Sciences, Jan [6] N. Bulusu, J. Heidemann, and D. Estrin, “Gps-Less Low Cost Outdoor Localization for Very Small Devices,” IEEE Personal Comm. Magazine, special issue on smart spaces and environments, [7] D. Niculescu, “Positioning in Ad Hoc Sensor Networks,” IEEE Network, vol. 18, no. 4, pp , July-Aug

Network E.M.U Application Lab 36 [8] Y. Wang, X. Wang, D. Wang, and D.P. Agrawal, “Localization Algorithm Using Expected Hop Progress in Wireless Sensor Networks,” Proc. Third IEEE Int’l Conf. Mobile Ad hoc and Sensor Systems (MASS ’06), Oct [9] P. Traynor, R. Kumar, H. Choi, G. Cao, S. Zhu, and T.L. Porta, “Efficient Hybrid Security Mechanisms for Heterogeneous Sensor Networks,” IEEE Trans. Mobile Computing, vol. 6, no. 6, June [10] J.-J. Lee, B. Krishnamachari, and C.J. Kuo, “Impact of Heterogeneous Deployment on Lifetime Sensing Coverage in Sensor Networks,” Proc. First Ann. IEEE Comm. Soc. Conf. Sensor and Ad Hoc Comm. and Networks, pp , Oct [11] V.P. Mhatre, C. Rosenberg, D. Kofman, R. Mazumdar, and N. Shroff, “A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint,” IEEE Trans. Mobile Computing, vol. 4, no. 1, pp. 4-15, [12] M. Yarvis, N. Kushalnagar, H. Singh, A. Rangarajan, Y. Liu, and S. Singh, “Exploiting Heterogeneity in Sensor Networks,” Proc. IEEE INFOCOM, [13] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Comm. Magazine, vol. 40, no. 8, pp , Aug [14] H. Kung and D. Vlah, “Efficient Location Tracking Using Sensor Networks,” Proc. IEEE Wireless Comm. and Networking Conf., vol. 3, pp , Mar

Network E.M.U Application Lab 37