Shamila Makki

Maximal lifetime scheduling in sensor surveillance networks

This paper addresses the maximal lifetime scheduling problem in sensor surveillance networks. Given a set of sensors and targets in a Euclidean plane, a sensor can watch only one target at a time, our task is to schedule sensors to watch targets, such that the lifetime of the surveillance system is maximized, where the lifetime is the duration that all targets are watched. We propose an optimal solution to find the target watching schedule for sensors that achieves the maximal lifetime. Our solution consists of three steps: 1) computing the maximal lifetime of the surveillance system and a workload matrix by using linear programming techniques; 2) decomposing the workload matrix into a sequence of schedule matrices that can achieve the maximal lifetime; 3) obtaining a target watching timetable for each sensor based on the schedule matrices. Simulations have been conducted to study the complexity of our proposed method and to compare with the performance of a greedy method.

Mobile and Wireless Network Security and Privacy

Mobile and Wireless Network Security and Privacy analyzes important security and privacy problems in the realms of wireless networks and mobile computing. The material includes a report to the National Science Foundation of the United States which will be used by program managers for the foundation in setting priorities for research directions in this area. In the following chapters field experts expand upon the report and provide further information about important research directions in the fields of wireless networks and mobile computing. The chapters are written by the leading international researchers and professionals in thes fields. Each chapter represents state-of-the-art research and includes several influential contributions. A multitude of valuable discussions on relevant concepts, such as the various approaches that define emerging security and privacy in mobile and wireless environment, are featured. The book is useful to researchers working in the fields of mobile and wireless security and privacy and to graduate students seeking new areas to perform research. It also provides information for academics and industry people researching recent trends and developments in the mobile and wireless security fields.

Developing an Infrastructure for Mobile and Wireless Systems

Consensus Report.- Research Direction for Developing an Infrastructure for Mobile & Wireless Systems: Consensus Report of the NSF Workshop Held on October 15, 2001 in Scottsdale, Arizona.- Keynote Presentation.- Recent Developments with Mobile IPv6.- Invited Papers.- Ad Hoc Wireless Networks: Analysis, Protocols, Architecture, and Convergence.- Supporting E-commerce in Wireless Networks.- Modeling Moving Objects for Location Based Services.- Accepted Papers.- Content-Based Networking: A New Communication Infrastructure.- Flexible Integrated Cache for Efficient Information Access in Mobile Computing Environments.- Design Considerations for Mobile Client-Server Database Applications.- Smart Environments: Middleware Building Blocks for Pervasive Network Computing (A Position Paper).- Agents, Mobility, and M-services: Creating the Next Generation Applications and Infrastructure on Mobile Ad-Hoc Networks.- ANTARCTICA: A Multiagent System for Internet Data Services in a Wireless Computing Framework.- A Collaborative Infrastructure for Mobile and Wireless Systems.- The Rationale for Infrastructure Support for Adaptive and Context-aware Applications: A Position Paper.- Mobile Wireless Interfaces: In Search for the Limits.- Prospects of Secure Real-Time Video Transmission over CDPD Networks.- Middleware for Location Based Information Services in Mobile Environment.

Accusation resolution using security metrology

In this paper, we design good security metrology to solve the problem when, in a network, there is a node accusing another one of misbehaving. This problem is not easy because bad nodes tend to use false accusations to disrupt the network and the result is disastrous. We set up a standard, namely the security ratings, and use it to resolve such accusations. We use approaches of negative-credit, and mixed-credit (positive-credit), respectively, to solve this problem. We exclude the use of public key infrastructure and use only symmetric ciphers and hash functions to reduce the computational overhead of the security metrology. Our results prove to be practical and robust against node compromise. The communication and computational overhead also prove to be small and suitable for real world applications.

The CSMA/DM LAN protocol

We propose an extension of the classical CSMA/CD protocol that eliminates its three main drawbacks. The new protocol, called dual-mode CSMA/CD (CSMA/DM), operates in two modes, light mode and heavy mode. The light mode of CSMA/DM is almost the same as the original CSMA/CD protocol and is primarily used when the LAN load is light. The heavy mode is a collision free mode and is applied when the LAN load is heavy. The proposed modification to CSMA/CD is minimal while performance gain is significant. CSMA/DM automatically switches between its two modes based on the observed LAN load. Under heavy mode, the monitor station in a CSMA/DM LAN allocates bandwidth to those busy stations without collisions. The newly added priority scheme in the heavy mode allows stations to reserve bandwidth for their high priority frames. Compared with the current collision-free fast Ethernet and Gigabit Ethernet, CSMA/DM has the advantage of not needing any extra switches or hubs while maintaining comparable performance. Its priority scheme provides more flexibility on bandwidth distribution than in fast Ethernet and Gigabit Ethernet. It can also be easily adapted for high-speed wireless LANs. More importantly, CSMA/DM should be a good alternative of the widely used CSMA/CA (collision avoidance) in mobile ad hoc networks (MANET) and sensor networks. Copyright