Research Page


Guard Coverage in Wireless Networking


Guard Coverage for Wireless networks allows users to confine a polygonal area that clients can access if and only if they have the right keys. Guard Coverage uses transmitters that have overlapping transmissions with different predetermine keys. In order to gain the access needed, one must have the keys necessary for each transmitter that overlaps their coverage area. It does not need to know where the client is in proximity to the transmitter. Guard Coverage happens to be very robust. It can be scaled to lower end businesses like coffee shops can restrict uses of wireless internet to shop that are in the in shop, to huge networks that grants different amount of access depending the area the person is in.


Guard Coverage provides a very secure area to conduct business. Only with the right combinations of keys are they allowed to connect with the network. This makes it hard for people to try to spoof a key. This ensures the people that want to keep a network private will keep it that way. It is pretty effective and cheap to implement. Again, the Guard Coverage is very scalable, and it adds a great deal of security when implemented correctly.Guard Coverage for wireless networks also provide GPS (Global Positioning System). It provides node localization for a client, by verifying the right keys (from the various overlapping transmitters) in order to tell the location of the node.


Meguerdichian, Seapahn, Koushanfar, Farinaz, Potkonjak, Miodrag, and Srivastava, Mani B. Coverage problems in wireless ad-hoc sensor networks.IEEE INFOCOM 2001 20th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings,2001,pp.1380-1387.
[Coverage determines whether or not a wireless implementation is good or not. The main point that the paper hits upon is that coverage (strength of the signal and service) plays a major factor in the judging of an implementation of providing wireless service. Coverage is addressed by using computational geometry and shows various algorithms that have polynomial worst and average case for coverage calculation. Theoretically the paper points out that, the more sensors there are, the stronger the strength of coverage provided.]

Megerian, Seapahn, Koushanfar, Farinaz, Potkonjak, Miodrag,and Srivastava, Mani B."Worst and Best-Case Coverage in Sensor Networks" IEEE Transactions on Mobile Computing, vol. 4,no. 1,pp. 84-92,Jan/Feb,2005
[Coverage of the Wireless network is the main focus of the paper. They review various implementations to figure out the costs of each implementation. They tried to incorporate graph theory as well as computational geometry in order to find the best and worst case for each implementation. Maximal breach is the worst case scenario determined through the papers methodically where as Maximal Support was the best case. Maximal Breach branches out and tries to explore every possible edge, where as Maximal Support just tries to find the shortest distance to bridge a connection.]

Tseng, Yu-Chee, Wu, Shih-Lin, Liao, Wen-Hwa, and Chao, Chih-Min.Location awareness in ad hoc wireless mobile networks.Computer,Jun 2001,pp 46-52.
[Mobile wireless networks (Maget: mobile ad hoc network ) that were mobile hosts that would still relay information while moving. The paper stresses that the need for this is great. Military personnel will find it a very effective tool on the battle field. One implementation of a mobile wireless networks is using GPS (Global Positioning System). By knowing the location of the nodes, operators can move it to get the range needed in order to operate. Flooding is another implementation when a node sends out signals in hopes of finding other nodes in range of communication. When the signals from nodes start overlapping connections are found and they start communicating. ]

Aurenhammer, Franz.Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Computing Surveys 23, pp. 345-405, 1991.
[The paper reinforces the importance of Voronoi diagrams. It goes into great detail about the history of these diagrams. This paper tries to relate the importance of these diagrams to other aspects other than computer science. It gives also the background properties of the Voronoi diagrams (both mathematically and algorithmically). ]

Fragoudakis, Christodoulos, Markou, Euripides, and Zachos, Stathis.Maximizing the guarded boundary of an Art Gallery is APX-completeComputational Geometry: Theory and Applications Volume 38,Issue 3.pp.170-180,October 2007
[This paper takes a unique spin at the Art Gallery Problem. Originally the Art gallery problem states that guards must be placed in such a way that the predetermined polygonal region could be under guard. The approach this paper took was to only watch high end items and just view the others partially. This leaves a lot of extra guards laying around. But the thing is both of this implementation have O(log n) efficient. They both share the same approximation ratio. This starts a problem, will a "watching line segment" be as efficient as watching over them?]

"Art Gallery Problem."Wikipedia. 14 Sept. 2007. 26 Sept. 2007.
[The article gives a brief overview on the problem of placing guards in the most efficient way to define an location]

Related References:

Updated: 9/26/2007