TAILIEUCHUNG - Topology Control in Wireless Ad Hoc and Sensor Networks phần 10

Xác định người hàng xóm cuối cùng thiết lập sau khi danh sách hàng xóm đặt hàng từ tất cả các nút trong N (u) đã được và nhà nước-of-the -nghệ thuật các giải pháp mô hình di động điện thoại di động quan trọng truyền phạm vi Topology kiểm soát với di động | 224 CASE STUDY TC AND COOPERATIVE ROUTING IN AD HOC NETWORKS Finally we observe that in this chapter we have implicitly assumed that the nodes execute the TC protocol truthfully. This assumption is in general quite unrealistic since a selfish node is expected to manipulate the TC protocol also if this results in an increase of its utility. Thus designing truthful TC protocols is also a very interesting open research topic which has been only partially addressed by a recent paper Eidenbenz et al. 2003 . A Elements of Graph Theory In this Appendix we report basic definitions and concepts from graph theory that have been used in this book. Most of the material presented in this Appendix is based on Bol-lobas 1998 Section and on Goodman and O Rourke 1997 and deBerg et al. 1997 Section . Basic Definitions Definition Graph A graph G is an ordered pair of disjoint sets N E where E c N X N. Set N is called the vertex or node set while set E is the edge set of graph G. Typically it is assumed that self-loops . edges of the form u u for some u e N are not contained in a graph. Definition Directed and undirected graph A graph G N E is directed if the edge set is composed of ordered node pairs. A graph is undirected if the edge set is composed of unordered node pairs. Examples of directed and undirected graphs are reported in Figure . Unless otherwise stated in the following by graph we mean undirected graph. Definition Neighbor nodes Given a graph G N E two nodes u v e N are said to be neighbors or adjacent nodes if u v e E. If G is directed we distinguish between incoming neighbors of u those nodes v e N such that v u e E and outgoing neighbors of u those nodes v e N such that u v e E . Definition Node degree Given a graph G N E the degree of a node u e N is the number of its neighbors in the graph. Formally deg u v e N u v e E . If G is directed we distinguish between in-degree number of incoming neighbors and out-degree number of .

TỪ KHÓA LIÊN QUAN
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.